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 2Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6533 | 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) | |
| 1481 | 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) | ||
| 19954 | Monsters Attack! | dp greedy implementation | Statement | B | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 14948 | 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 | ||
| 2101 | Vlad and Avoiding X | bitmasks brute force constructive algorithms dfs and similar dp implementation | Statement | F | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 4575 | Vlad and Trouble at MIT | dfs and similar dp flows graphs greedy implementation trees | Statement | G | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 32962 | Vlad and a Sum of Sum of Digits | dp implementation | Statement | C | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 2122 | 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 | |
| 34025 | Thorns and Coins | dp greedy implementation | Statement | A | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 21034 | Rudolf and the Ball Game | dp implementation | Statement | D | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 13822 | 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 | |
| 26333 | Array Fix | brute force dp greedy implementation | Statement | B | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 6152 | Shuffling Songs | bitmasks dp graphs implementation strings | Statement | G | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 26560 | Product of Binary Decimals | dp implementation number theory | Statement | D | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 4808 | 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) | |
| 11596 | Minimizing the Sum | dp implementation | Statement | C | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 1700 | |
| 406 | Card Pairing | dp greedy hashing implementation | Statement | F | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 3000 | |
| 30712 | Binary Cut | dp greedy implementation sortings strings | Statement | D | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1100 | |
| 320 | 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 |
| 28683 | 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 |
| 12493 | 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 | ||
| 4629 | Computing Machine | data structures dp greedy implementation | Statement | E | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 2000.0 | 130527 | |
| 14786 | 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 | ||
| 24156 | Test of Love | dp greedy implementation | Statement | D | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 23795 | Triple Operations | dp implementation math | Statement | E | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 2337 | Ksyusha and the Loaded Set | binary search data structures dp implementation trees | Statement | H | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 6994 | Color Rows and Columns | dp greedy implementation math | Statement | F | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 4671 | 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 | |
| 3341 | Subtangle Game (Easy Version) | dp games greedy implementation | Statement | E1 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 1500.0 | Discussion stream (With Hints) | |
| 1069 | Subtangle Game (Hard Version) | dp games greedy implementation | Statement | E2 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 2000.0 | Discussion stream (With Hints) | |
| 8736 | Lazy Narek | dp implementation | Statement | C | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 1500.0 | Discussion stream (With Hints) | |
| 5222 | 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) | |
| 336 | 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) | |
| 2206 | 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) | |
| 1940 | 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 | |
| 6526 | Gerrymandering | dp implementation | Statement | C | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1750.0 | Codeforces Round 978 (Div 2) Editorial | |
| 7924 | 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 | ||
| 5920 | 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 | ||
| 401 | 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 | ||
| 1913 | 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 | |
| 7026 | 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 | |
| 550 | 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 | |
| 3770 | 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 | |
| 5852 | 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 | |
| 862 | 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 | ||
| 331 | 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 | ||
| 912 | Two Subarrays | data structures dp implementation matrices | Statement | F | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 2615 | Hard Demon Problem | data structures dp implementation math | Statement | H | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 3887 | 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 | ||
| 6071 | Shift + Esc | dp implementation | Statement | D | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 1750.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 14653 | Three Strings | dp implementation strings | Statement | E | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 953 | Earnest Matrix Complement | data structures dp greedy implementation | Statement | F | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2500.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 4540 | Resourceful Caterpillar Sequence | dfs and similar dp games graphs implementation trees | Statement | E | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 21294 | Tender Carpenter | dp geometry implementation math | Statement | A | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 500.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 2280 | Kevin and Binary String (Easy Version) | binary search brute force data structures dp greedy implementation strings two pointers | Statement | F1 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 2000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 1110 | Infinite Sequence (Hard Version) | bitmasks constructive algorithms data structures dp implementation math | Statement | D2 | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1250.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 2393 | Binary Subsequence Value Sum | combinatorics dp fft implementation math | Statement | C | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 1500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 85 | Quantifier | combinatorics dp implementation | Statement | E | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 2250.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 8294 | Wonderful City | dp implementation | Statement | C | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) {2096} | PROGRAMMING | 1500.0 | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial | |
| 731 | Numbers and Strings | brute force dfs and similar dp implementation math | Statement | F | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 18011 | Fibonacci Cubes | brute force dp implementation math | Statement | B | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 2519 | Red Light, Green Light (Hard version) | binary search dfs and similar dp dsu graphs implementation number theory | Statement | D2 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 8526 | Red Light, Green Light (Easy version) | brute force dfs and similar dp graphs implementation | Statement | D1 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1250.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 713 | And Constraint | bitmasks dp greedy implementation | Statement | E | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 2500.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 2275 | Ice Baby | binary search brute force data structures dp implementation sortings | Statement | H | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 853 | 23 Rises Again | brute force data structures dfs and similar dp flows graphs implementation probabilities trees | Statement | H | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 4000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 8941 | From 1 to Infinity | binary search dp implementation math | Statement | D | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 1468 | Looking at Towers (difficult version) | combinatorics data structures dp implementation | Statement | E2 | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 2629 | Looking at Towers (easy version) | combinatorics dp implementation | Statement | E1 | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 10155 | Rabbits | 2-sat dp graphs greedy implementation | Statement | C | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 1500.0 | ||
| 858 | Attraction Theory | combinatorics dp implementation math | Statement | D | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 6385 | Not Alone | dp implementation | Statement | D | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 1750.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 10473 | The Ancient Wizards' Capes | brute force dp implementation | Statement | C | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 1750.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 2802 | Locked Out | binary search data structures dp graphs greedy implementation two pointers | Statement | D | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 2250.0 | ||
| 7300 | Rae Taylor and Trees (hard version) | binary search constructive algorithms data structures dp dsu implementation trees | Statement | F | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 11843 | Rae Taylor and Trees (easy version) | binary search data structures dp dsu greedy implementation trees | Statement | D | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 15975 | First or Second | dp greedy implementation | Statement | C | Good Bye 2025 {2178} | PROGRAMMING | 1250.0 | ||
| 230 | Zhora the Vacuum Cleaner | dp implementation sortings trees | Statement | F | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 3250.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 3258 | Sub-RBS (Hard Version) | combinatorics dp games implementation matrices strings | Statement | B2 | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 5197 | Simons and Beating Peaks | data structures divide and conquer dp greedy implementation trees | Statement | D | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 1750.0 | Tutorial | |
| 133 | EXPloration, EXPloitation, and Gain Some EXPerience! | bitmasks brute force dp greedy implementation | Statement | D | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 2750.0 | 152930 | |
| 6859 | Cirno and Number (Easy Version) | binary search brute force dp implementation | Statement | C1 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 1500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 856 | Load Unbalancing | binary search bitmasks dp greedy implementation | Statement | F | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 2500.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial |