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 |
|---|---|---|---|---|---|---|---|---|---|
| 1197 | Valera and Swaps | constructive algorithms dsu graphs implementation math string suffix structures | Statement | D | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | Разбор Codeforces Round #252 (Div. 2) | 2300 |