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 |
|---|---|---|---|---|---|---|---|---|---|
| 10849 | King's Path | dfs and similar graphs hashing shortest paths | Statement | C | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | Codeforces Round #149 (Div. 2) Tutorial | 1800 | |
| 2219 | President and Roads | dfs and similar graphs hashing shortest paths | Statement | E | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 2600 | |
| 4843 | The Strongest Build | data structures dfs and similar graphs greedy hashing implementation shortest paths | Statement | D | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 |