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 |
|---|---|---|---|---|---|---|---|---|---|
| 2430 | Two Heaps | combinatorics constructive algorithms greedy implementation math sortings | Statement | B | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 1800 |