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 |
|---|---|---|---|---|---|---|---|---|---|
| 540 | A Shade of Moonlight | binary search geometry math sortings two pointers | Statement | D | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 2500 | |
| 1150 | Minimum Influence | binary search data structures geometry greedy implementation math sortings two pointers | Statement | E | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial |