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 |
|---|---|---|---|---|---|---|---|---|---|
| 18931 | Polo the Penguin and Matrix | brute force dp implementation sortings ternary search | Statement | B | Codeforces Round 177 (Div. 2) {289} | PROGRAMMING | Codeforces Round #177, editorial | 1400 |