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 |
|---|---|---|---|---|---|---|---|---|---|
| 14216 | Lomsat gelral | data structures dfs and similar ds trees | Statement | E | Educational Codeforces Round 2 {600} | PROGRAMMING | Editorial | 2300 | |
| 1159 | Acyclic Organic Compounds | data structures dfs and similar ds hashing strings trees | Statement | D | Codeforces Round 333 (Div. 1) {601} | PROGRAMMING | Codeforces Round #333 — editorial | 2400 | |
| 7958 | Minimum spanning tree for each edge | data structures dfs and similar ds graphs trees | Statement | E | Educational Codeforces Round 3 {609} | PROGRAMMING | Editorial | 2100 | |
| 602 | Clockwork Bomb | data structures dfs and similar ds greedy trees | Statement | E | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | 3100 | ||
| 190 | Iqea | data structures dfs and similar divide and conquer ds shortest paths trees | Statement | E | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 3300 | |
| 1316 | Leaf Sets | data structures dfs and similar ds graphs greedy sortings trees | Statement | F | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2400 |