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 4Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 16270 | Production of Snowmen | combinatorics dp | Statement | C | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 9392 | Christmas Tree Decoration | combinatorics dp greedy math | Statement | D | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 1178 | Jumping Man | combinatorics data structures dp trees | Statement | F | Hello 2026 {2183} | PROGRAMMING | 2750.0 | ||
| 6108 | Exquisite Array | combinatorics data structures dsu | Statement | E | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 10012 | Unfair Game | combinatorics dp math | Statement | D | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 2052 | Little String (Hard Version) | binary search combinatorics dp greedy math number theory | Statement | D2 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 750.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 4194 | Little String (Easy Version) | combinatorics dp math | Statement | D1 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 2000.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 260 | Median Permutation | combinatorics | Statement | E | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 2750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 11391 | Sub-RBS (Easy Version) | combinatorics constructive algorithms dp greedy strings two pointers | Statement | B1 | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 3348 | 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 | |
| 1005 | Prufer Vertex | combinatorics dsu number theory probabilities trees | Statement | D | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 2250.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 3852 | Interactive Graph (Simple Version) | combinatorics dfs and similar dp graphs interactive | Statement | C1 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 2699 | Interactive Graph (Hard Version) | combinatorics dfs and similar dp graphs interactive | Statement | C2 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 98 | Sum of MEX | *special combinatorics data structures dp math | Statement | H | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 167 | Self-Produced Sequences | *special combinatorics math | Statement | F | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 1154 | Operation Permutation | combinatorics dp math probabilities | Statement | G | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 2178 | Rigged Bracket Sequence | combinatorics dp | Statement | C | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 1750.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 1337 | Sum of Fractions | binary search combinatorics greedy math two pointers | Statement | F | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 958 | N-MEX (Counting Version) | combinatorics math | Statement | E2 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1000.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 469 | Counting Cute Arrays | combinatorics dp | Statement | E | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 3000.0 | Tutorial | |
| 3220 | AND-array | bitmasks combinatorics math | Statement | D | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 2000.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 1003 | 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 | |
| 872 | Interval Game | bitmasks combinatorics dp games greedy math probabilities | Statement | F | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2750.0 | Tutorial | |
| 441 | Down the Pivot | combinatorics trees | Statement | G | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 3250.0 | Tutorial | |
| 147 | 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 | |
| 300 | Amanojaku and Sequence (Hard Version) | combinatorics data structures implementation math | Statement | E2 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 1500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 599 | Amanojaku and Sequence (Easy Version) | combinatorics math | Statement | E1 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 2000.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 1956 | 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 | |
| 202 | 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 | |
| 570 | Snaking Arrangement | combinatorics constructive algorithms | Statement | E | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 2750.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 1112 | Permutation Transmission (Easy Version) | combinatorics sortings | Statement | E1 | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | |||
| 1085 | Permutation Transmission (Difficult Version) | combinatorics sortings | Statement | E2 | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | |||
| 1868 | 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 | ||
| 914 | Elections in Saransk (hard version) | combinatorics dp fft math number theory | Statement | F2 | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | |||
| 375 | Infinite Work | combinatorics graphs greedy math | Statement | F | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 2750.0 | ||
| 561 | Hunting the Beast | combinatorics dp graphs | Statement | D | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 2000.0 | ||
| 10153 | AI Finds Nothing Here | combinatorics | Statement | B | Codeforces Round 1105 (Div. 2) {2240} | PROGRAMMING | 1250.0 | ||
| 5344 | Fair and Square | combinatorics dp graphs math number theory trees | Statement | E | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 139 | Familiar? | brute force combinatorics dp | Statement | F | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 3000.0 | ||
| 7247 | 0mar and Alternating Sums | combinatorics dp math | Statement | C | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 1500.0 |