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 |
|---|---|---|---|---|---|---|---|---|---|
| 1750 | Long Way Home | data structures divide and conquer dp geometry graphs shortest paths | Statement | E | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 2750.0 | Codeforces Round #816 (Div. 2) editorial |