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 |
|---|---|---|---|---|---|---|---|---|---|
| 2861 | String | brute force constructive algorithms hashing implementation string suffix structures strings | Statement | B | Codeforces Beta Round 94 (Div. 1 Only) {128} | PROGRAMMING | 3219 | 2200 |