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 |
|---|---|---|---|---|---|---|---|---|---|
| 2482 | Leha and another game about graph | constructive algorithms data structures dfs and similar dp graphs | Statement | B | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 2100 |