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
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1004 | Huge Strings | bitmasks brute force dp implementation strings | Statement | D | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 2100 | |
| 19105 | Vitamins | bitmasks brute force dp implementation | Statement | B | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1200 | |
| 21815 | a-Good String | bitmasks brute force divide and conquer dp implementation | Statement | D | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 1500 | |
| 5751 | 505 | bitmasks brute force dp implementation | Statement | D | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 2000.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 7262 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1946 | 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 |
| 2087 | Vlad and Avoiding X | bitmasks brute force constructive algorithms dfs and similar dp implementation | Statement | F | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 4753 | 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) | |
| 319 | 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 |
| 78 | 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 |