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 |
|---|---|---|---|---|---|---|---|---|---|
| 2610 | Medium Demon Problem (hard version) | dfs and similar dp ds graphs implementation trees | Statement | G2 | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING |