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 8Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1590 | 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 | ||
| 11701 | Unstable Elements | brute force data structures implementation sortings two pointers | Statement | C | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 406 | 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 | |
| 94 | Connect Connect See | brute force data structures | Statement | H | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 5000.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 3271 | diss_quack and Array Game | bitmasks brute force games greedy | Statement | D | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 1750.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 10257 | Rank Subsequence | brute force greedy implementation | Statement | A | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 750.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 9681 | Risky Tower | binary search brute force data structures greedy sortings | Statement | C | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 1250.0 | 155741 | |
| 3385 | Hypercarp and Interdimensional Jumps | binary search brute force geometry greedy implementation math | Statement | D | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 12107 | Hypercarp and the Control Panel | brute force data structures two pointers | Statement | B | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 1356 | Diameter Intersections | brute force dfs and similar fft graphs trees | Statement | E | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 252 | What Will Remain at the End? (Easy Version) | brute force data structures | Statement | E1 | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1750.0 | 155840 | |
| 2008 | 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 | |
| 20093 | Creating Abbreviations | brute force strings | Statement | A | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 500.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 4571 | Carrot Chopdown (Hard Version) | brute force implementation math | Statement | B2 | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 1000.0 | Codeforces Round 1118 (Div. 2) Editorial | |
| 14277 | Carrot Chopdown (Easy Version) | brute force math | Statement | B1 | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 750.0 | Codeforces Round 1118 (Div. 2) Editorial | |
| 23985 | Moo Language School | brute force greedy two pointers | Statement | A | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | |||
| 396 | Edge Three-Coloring | bitmasks brute force dfs and similar dsu graphs trees | Statement | F | Educational Codeforces Round 194 (Rated for Div. 2) {2260} | PROGRAMMING | |||
| 127 | Sortable Permutations | brute force combinatorics math number theory | Statement | G | Educational Codeforces Round 194 (Rated for Div. 2) {2260} | PROGRAMMING | |||
| 3766 | Signs of Prefix Sums | brute force constructive algorithms dfs and similar dp | Statement | D | Educational Codeforces Round 194 (Rated for Div. 2) {2260} | PROGRAMMING |