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 |
|---|---|---|---|---|---|---|---|---|---|
| 603 | Hamming Distance | constructive algorithms greedy math matrices | Statement | C | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 2400 |