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 |
|---|---|---|---|---|---|---|---|---|---|
| 207 | Visible Black Areas | data structures dsu geometry trees | Statement | G | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2900 | |
| 661 | Tree Queries | binary search data structures dp dsu geometry trees | Statement | F | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 |