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 |
|---|---|---|---|---|---|---|---|---|---|
| 602 | Stack | *special expression parsing implementation | Statement | H | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1900 |