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 |
|---|---|---|---|---|---|---|---|---|---|
| 1539 | Pastoral Oddities | data structures divide and conquer dsu math trees | Statement | E | Codeforces Round 334 (Div. 1) {603} | PROGRAMMING | Codeforces Round #334 Bonus Editorial: More Ideas on Div. 1 E | 2900 |