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
< 1 2 3 ... 6 7 8Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2011 | Dr. Agos's Dark Mode | brute force constructive algorithms math strings | Statement | D | Codeforces Round 1121 (Div. 2) {2264} | PROGRAMMING | 2500.0 | ||
| 319 | Deranged Calculator | constructive algorithms implementation math | Statement | F | Codeforces Round 1121 (Div. 2) {2264} | PROGRAMMING | 3000.0 | ||
| 6979 | Falling Concrete | constructive algorithms data structures math sortings | Statement | D | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING |