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 |
|---|---|---|---|---|---|---|---|---|---|
| 7496 | Vasya and Basketball | binary search brute force data structures implementation sortings two pointers | Statement | C | Codeforces Round 281 (Div. 2) {493} | PROGRAMMING | Codeforces Round #281 (Div. 2) Editorial | 1700 | |
| 4388 | Cutting Game | binary search brute force data structures implementation sortings two pointers | Statement | F | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 1900 |