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 2Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 370 | 4-beauty | bitmasks dp graphs math | Statement | F | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 3060 | Whiplash | bitmasks constructive algorithms math | Statement | F | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial |