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 |
|---|---|---|---|---|---|---|---|---|---|
| 678 | Lenient Vertex Cover | data structures dfs and similar divide and conquer ds graphs | Statement | F | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 |