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 |
---|---|---|---|---|---|---|---|---|---|
753 | Trails and Glades | constructive algorithms ds graphs greedy | Statement | C | VK Cup 2012 Finals, Practice Session {209} | PROGRAMMING | 2400 | ||
3388 | Spanning Tree with One Fixed Degree | constructive algorithms dfs and similar ds graphs greedy | Statement | F2 | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 2200 |