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 |
|---|---|---|---|---|---|---|---|---|---|
| 3117 | Returning Home | data structures graphs implementation shortest paths sortings | Statement | D | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 1500.0 | Codeforces Round #675 (Div. 2) Editorial |