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 |
|---|---|---|---|---|---|---|---|---|---|
| 2092 | Comments | dfs and similar expression parsing implementation strings | Statement | E | Codeforces Round 387 (Div. 2) {747} | PROGRAMMING | 49171 | 1700 |