Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 8755 | King's Path | dfs and similar graphs hashing shortest paths | Statement | C | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | 1800 | ||
| 1769 | President and Roads | dfs and similar graphs hashing shortest paths | Statement | E | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | 2600 |