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 |
|---|---|---|---|---|---|---|---|---|---|
| 488 | Down Below | binary search dfs and similar graphs meet-in-the-middle shortest paths | Statement | E | Codeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine)) {1558} | PROGRAMMING | 3000.0 | Codeforces Round #740 Editorial | 3000 |