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 |
|---|---|---|---|---|---|---|---|---|---|
| 4414 | Almost Sorted | binary search bitmasks combinatorics constructive algorithms dp implementation math | Statement | B | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1000.0 | Codeforces Round #715 Editorial | |
| 11282 | Divan and bitwise operations | bitmasks combinatorics constructive algorithms dp math | Statement | C | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 1500 |
| 681 | Lost Array | bitmasks combinatorics constructive algorithms dp math | Statement | F | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 3000.0 | Codeforces Round #812 (Div. 2) Editorial | 2900 |