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 |
|---|---|---|---|---|---|---|---|---|---|
| 2122 | Partial Teacher | dp graphs greedy implementation | Statement | A | Manthan 2011 {67} | PROGRAMMING | 1800 | ||
| 525 | Widget Library | dp expression parsing graphs implementation | Statement | B | Codeforces Beta Round 74 (Div. 1 Only) {89} | PROGRAMMING | 2200 | ||
| 1213 | Museums Tour | dp graphs implementation | Statement | C | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2800 |