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 |
|---|---|---|---|---|---|---|---|---|---|
| 137 | Tanya is 5! | graph matchings graphs greedy schedules | Statement | E | Codeforces Round 380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2) {737} | PROGRAMMING | 3300 |