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 |
|---|---|---|---|---|---|---|---|---|---|
| 3336 | Tyler and Strings | combinatorics data structures implementation strings | Statement | C | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 1500.0 | Codeforces Round #775 Editorial | |
| 5773 | Invertible Bracket Sequences | binary search combinatorics data structures divide and conquer implementation two pointers | Statement | D | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial |