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 |
|---|---|---|---|---|---|---|---|---|---|
| 611 | Copper Squander | binary search data structures dsu graphs greedy math sortings ternary search | Statement | G | Codeforces Round 1125 (Div. 3) {2275} | PROGRAMMING |