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 ... 9 10 11Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 25212 | A Simple Sequence | constructive algorithms dp greedy number theory | Statement | A | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 500.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 2463 | A Simple GCD Problem (Hard Version) | dp greedy number theory | Statement | C2 | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 1000.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 1056 | Learning Binary Search | combinatorics divide and conquer dp | Statement | F | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 3000.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 1061 | Minimum Path Cover | dp interactive number theory trees | Statement | E | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 2500.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 182 | 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 | |
| 4059 | Interval Mod | constructive algorithms dp greedy math | Statement | A | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 750.0 | 152930 | |
| 955 | Interval Game | bitmasks combinatorics dp games greedy math probabilities | Statement | F | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2750.0 | Tutorial | |
| 299 | Closer | dp | Statement | H | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 3750.0 | Tutorial | |
| 1531 | Coloring a Red Black Tree | dp greedy probabilities trees | Statement | C | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 1750.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 164 | Counting Sort? | combinatorics dp | Statement | H | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 4000.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 6493 | Median Partition | dp | Statement | C | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 1500.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 4019 | Zhily and Barknights | binary search data structures dp math sortings two pointers | Statement | B | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 750.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 14662 | Red-Black Pairs | dp greedy | Statement | C | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 3366 | Reserved Reversals | constructive algorithms dp greedy | Statement | D | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2000.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 10354 | It All Went Sideways | binary search data structures dp greedy | Statement | E | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 4689 | It Just Keeps Going Sideways | data structures dp greedy math | Statement | F | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 1797 | Fallen Leaves | dfs and similar dp trees | Statement | H | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 8391 | 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 | |
| 372 | Momoyo and the Network | binary search dfs and similar divide and conquer dp trees | Statement | F | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 3500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 1160 | 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 | |
| 2085 | Deconstruction Tree | combinatorics data structures dp graphs trees | Statement | E | 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 | |
| 247 | Wowee Binary String | combinatorics dp strings | Statement | H | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 4000.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 378 | Roadworks | data structures dp | Statement | G | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 3250.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 246 | The Endians | dp trees | Statement | I | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 5000.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 541 | Game on Growing Tree | binary search dfs and similar dp games trees | Statement | F | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 5594 | Good Schedule | dp graphs greedy two pointers | Statement | D | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 1231 | Graph Cutting | dfs and similar dp trees | Statement | E | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2500.0 | ||
| 12530 | Seating Arrangement (Easy Version) | binary search dp greedy ternary search two pointers | Statement | C1 | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 750.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 2834 | Magical Tiered Cake | constructive algorithms dfs and similar dp greedy | Statement | D | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 2000.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 9901 | Cost of a Bracket Sequence | brute force dp greedy | Statement | C | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 536 | Shortest GCD Paths | dp graphs math number theory shortest paths | Statement | F | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 2187 | Vlad, Misha and Two Arrays | combinatorics data structures dfs and similar divide and conquer dp | Statement | E | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 2500.0 | Tutorial | |
| 13332 | Brand New Tatar TV Show | binary search constructive algorithms dp games math | Statement | D | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 1230 | Elections in Saransk (hard version) | combinatorics dp fft math number theory | Statement | F2 | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 6777 | Friendly Gifts | dp | Statement | E | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 1118 | Paint the Array | data structures dp greedy | Statement | F | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 2500.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 85 | DBFS Order (Easy Version) | dp trees | Statement | I1 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 3500.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 112 | DBFS Order (Hard Version) | dp trees | Statement | I2 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 4500.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 9666 | Village Guilds | dfs and similar dp trees | Statement | C | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 1250.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 2247 | Cake Trial | dp greedy two pointers | Statement | E | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 2250.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 698 | Hunting the Beast | combinatorics dp graphs | Statement | D | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 2000.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 245 | Colorful Works | dp fft games implementation | Statement | F | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 3500.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 6759 | Fair and Square | combinatorics dp graphs math number theory trees | Statement | E | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 16944 | An Alternative Way | dp greedy math | Statement | D | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 1615 | Product of Closures | bitmasks brute force constructive algorithms dp greedy implementation math | Statement | E | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 491 | Summer Vacation | data structures dp probabilities | Statement | F | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 8157 | Two Digit Strings | dp greedy strings | Statement | D | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 13730 | Yaroslav and Productivity | constructive algorithms dp greedy math number theory | Statement | D | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 3006 | Yura and Deadlines | data structures dp | Statement | G | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 9221 | Masha and the Garland | data structures dp strings | Statement | E | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 30571 | Iskander and Drawings | dp games greedy strings | Statement | A | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 4568 | Anya Loves Trees! | dp greedy trees | Statement | F | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 427 | Familiar? | brute force combinatorics dp | Statement | F | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 3000.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 1187 | Tom and Jerry | dfs and similar dsu games trees | Statement | E | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 2500.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 9251 | 0mar and Alternating Sums | combinatorics dp math | Statement | C | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 1500.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 597 | Paths on a Grid | data structures dp hashing | Statement | F | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 3500.0 | ||
| 10281 | Maximize the Score | dp greedy | Statement | C | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 1500.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 236 | No Balance Left | dp math | Statement | G | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 3500.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 1839 | Generational Triplets | bitmasks combinatorics dp math | Statement | E | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 2250.0 | 155741 | |
| 550 | Spectral Components | dfs and similar dp greedy sortings trees | Statement | F | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 2750.0 | 155741 | |
| 518 | 4-beauty | bitmasks dp graphs math | Statement | F | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 1422 | Diameter Intersections | brute force dfs and similar fft graphs trees | Statement | E | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 1260 | Nightcrawler | data structures dfs and similar dp greedy sortings trees | Statement | G | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 2124 | Busy Beaver | brute force divide and conquer dp greedy implementation sortings | Statement | E | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 2250.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 679 | Beaver's Jumping Track (Easy Version) | data structures dp matrices | Statement | F1 | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 2750.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 401 | Beaver's Jumping Track (Hard Version) | data structures dp matrices | Statement | F2 | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 1000.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 249 | Plus Minus Tree | dfs and similar dp graphs trees | Statement | F | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 3000.0 | Codeforces Round 1118 (Div. 2) Editorial | |
| 513 | Magic Tiles | dp implementation | Statement | D | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 2000.0 | Codeforces Round 1118 (Div. 2) Editorial | |
| 899 | Treasure Map Destruction (Counting Version) | 2-sat combinatorics dfs and similar dp graphs math | Statement | H | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | |||
| 4618 | Signs of Prefix Sums | brute force constructive algorithms dfs and similar dp | Statement | D | Educational Codeforces Round 194 (Rated for Div. 2) {2260} | PROGRAMMING | |||
| 2774 | Floor of MEX (Hard Version) | dp implementation | Statement | A2 | Codeforces Round 1120 (Div. 1) {2262} | PROGRAMMING | 1000.0 | ||
| 1021 | A Prime Flood (Easy Version) | combinatorics dp number theory | Statement | E1 | Codeforces Round 1121 (Div. 2) {2264} | PROGRAMMING | 2000.0 | ||
| 326 | A Prime Flood (Hard Version) | combinatorics dp number theory | Statement | E2 | Codeforces Round 1121 (Div. 2) {2264} | PROGRAMMING | 1500.0 | ||
| 186 | Deque Malfunction | data structures dp greedy | Statement | H | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING | |||
| 5004 | Prime Destruction | dp math number theory | Statement | E | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING |