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 |
|---|---|---|---|---|---|---|---|---|---|
| 2848 | Edges in MST | dfs and similar ds graphs sortings | Statement | D | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | 2500 | ||
| 8971 | New Year Permutation | dfs and similar ds graphs greedy math sortings | Statement | B | Good Bye 2014 {500} | PROGRAMMING | 1600 | ||
| 1827 | Polycarp and Hay | dfs and similar ds graphs greedy sortings | Statement | F | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | 2100 | ||
| 1383 | Network Safety | dfs and similar ds graphs math sortings | Statement | C | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2300 | |
| 7851 | 0-1 MST | dfs and similar ds graphs sortings | Statement | B | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 1900 |