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 |
|---|---|---|---|---|---|---|---|---|---|
| 349 | Tree or not Tree | data structures divide and conquer implementation trees | Statement | E | Codeforces Beta Round 88 {117} | PROGRAMMING | 2800 | ||
| 396 | Red-Black Cobweb | data structures divide and conquer implementation trees | Statement | D | Codeforces Round 426 (Div. 1) {833} | PROGRAMMING | 2800 | ||
| 3663 | Minimal Segment Cover | data structures dfs and similar divide and conquer dp greedy implementation trees | Statement | E | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2200 |