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 |
|---|---|---|---|---|---|---|---|---|---|
| 5004 | Send Boxes to Alice (Easy Version) | constructive algorithms greedy math number theory ternary search two pointers | Statement | B1 | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2000 | |
| 3416 | Send Boxes to Alice (Hard Version) | constructive algorithms greedy math number theory ternary search two pointers | Statement | B2 | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2100 |