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 |
|---|---|---|---|---|---|---|---|---|---|
| 1875 | Ant Man | dp graphs greedy | Statement | B | Codeforces Round 366 (Div. 1) {704} | PROGRAMMING | 2700 | ||
| 2945 | Tree with Small Distances | dp graphs greedy | Statement | E | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2200 |