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 |
|---|---|---|---|---|---|---|---|---|---|
| 8228 | Minimum spanning tree for each edge | data structures dfs and similar ds graphs trees | Statement | E | Educational Codeforces Round 3 {609} | PROGRAMMING | Editorial | 2100 | |
| 1341 | Leaf Sets | data structures dfs and similar ds graphs greedy sortings trees | Statement | F | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2400 |