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 |
|---|---|---|---|---|---|---|---|---|---|
| 1886 | Desk Disorder | combinatorics dfs and similar ds graphs trees | Statement | E | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 2100 | |
| 275 | Send Tree to Charlie | combinatorics dfs and similar ds trees | Statement | E | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 3200 |