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 |
|---|---|---|---|---|---|---|---|---|---|
| 932 | KiaKio and Energy Intervals | binary search bitmasks brute force data structures divide and conquer greedy two pointers | Statement | C | Codeforces Round 1124 (Div. 1) {2268} | PROGRAMMING | 1750.0 | 157140 |