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 |
|---|---|---|---|---|---|---|---|---|---|
| 4369 | Maximum Number | *special constructive algorithms greedy | Statement | C | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 1200 | |
| 382 | Minesweeper | *special constructive algorithms greedy | Statement | C | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 |