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 | ||
| 1449 | Close Vertices | data structures divide and conquer trees | Statement | E | Croc Champ 2013 - Round 2 {293} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 2700 | |
| 8568 | Xenia and Tree | data structures divide and conquer trees | Statement | E | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 2200 | |
| 2324 | New Year Tree | data structures divide and conquer trees | Statement | F | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 2400 | |
| 397 | Tavas on the Path | data structures divide and conquer trees | Statement | E | Codeforces Round 299 (Div. 1) {536} | PROGRAMMING | 3100 | ||
| 1247 | Pastoral Oddities | data structures divide and conquer ds math trees | Statement | E | Codeforces Round 334 (Div. 1) {603} | PROGRAMMING | 2900 | ||
| 506 | Can Bash Save the Day? | data structures divide and conquer graphs trees | Statement | G | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | 2500 | ||
| 396 | Red-Black Cobweb | data structures divide and conquer implementation trees | Statement | D | Codeforces Round 426 (Div. 1) {833} | PROGRAMMING | 2800 | ||
| 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 | |
| 340 | Raining season | data structures divide and conquer trees | Statement | E | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 3200 | |
| 501 | Double Tree | data structures divide and conquer shortest paths trees | Statement | G | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2900 | |
| 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 | |
| 595 | Forced Online Queries Problem | data structures divide and conquer ds graphs trees | Statement | F | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2800 | |
| 811 | Sum of Prefix Sums | data structures divide and conquer geometry trees | Statement | G | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 2700 | |
| 221 | Journey | data structures divide and conquer graphs trees | Statement | F | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 3250.0 | Codeforces Round #635 Editorial | 3600 |