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 |
|---|---|---|---|---|---|---|---|---|---|
| 159 | Greedy Petya | *special dfs and similar graphs greedy | Statement | F | Первоапрельский контест 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 2800 | |
| 2469 | Road Improvement | *special dfs and similar graphs greedy trees | Statement | C | VK Cup 2016 - Квалификация 2 {638} | PROGRAMMING | 2100 | ||
| 3205 | Cycle In Maze | *special dfs and similar graphs greedy shortest paths | Statement | C | VK Cup 2017 - Квалификация 1 {769} | PROGRAMMING | Tutorial | 1800 |