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 |
|---|---|---|---|---|---|---|---|---|---|
| 5078 | Clique Problem | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 2100 | |
| 3395 | Portals | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 |