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 |
|---|---|---|---|---|---|---|---|---|---|
| 628 | Caterpillar | dfs and similar dp graphs trees | Statement | F | Codeforces Beta Round 48 {51} | PROGRAMMING | 2600 | ||
| 1037 | Beavermuncher-0xFF | dfs and similar dp ds greedy trees | Statement | C | Codeforces Beta Round 69 (Div. 1 Only) {77} | PROGRAMMING | Codeforces Beta Round #69 tutorial | 2300 | |
| 345 | Pairs | dfs and similar dp ds graphs implementation trees | Statement | E | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 2600 | ||
| 905 | Beautiful Road | dfs and similar dp ds graphs implementation sortings trees | Statement | D | Codeforces Beta Round 73 (Div. 1 Only) {87} | PROGRAMMING | 2300 | ||
| 725 | Maze | dfs and similar dp probabilities trees | Statement | E | Codeforces Beta Round 92 (Div. 1 Only) {123} | PROGRAMMING | 2600 | ||
| 15117 | Distance in Tree | dfs and similar dp trees | Statement | D | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 1800 | |
| 1761 | IT Restaurants | dfs and similar dp trees | Statement | E | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 1800 | ||
| 9620 | Choosing Capital for Treeland | dfs and similar dp graphs trees | Statement | D | Codeforces Round 135 (Div. 2) {219} | PROGRAMMING | User editorial for Codeforces Round #135 (Div. 2) | 1900 | |
| 1246 | World Eater Brothers | dfs and similar dp greedy trees | Statement | C | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2200 | |
| 171 | Tree and Table | dfs and similar dp implementation trees | Statement | E | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 3000 | |
| 5043 | Zero Tree | dfs and similar dp greedy trees | Statement | B | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 2000 | |
| 6184 | Book of Evil | dfs and similar divide and conquer dp trees | Statement | D | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | 2100 | ||
| 445 | Pilgrims | dfs and similar dp trees | Statement | E | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | 2800 | ||
| 6013 | A Lot of Games | dfs and similar dp games implementation strings trees | Statement | B | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2100 | |
| 5767 | Civilization | dfs and similar dp ds ternary search trees | Statement | C | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2200 | |
| 5711 | Appleman and Tree | dfs and similar dp trees | Statement | B | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2200 | |
| 4047 | Valid Sets | dfs and similar dp math trees | Statement | D | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | Codeforces Round #277(Div. 2) Editorial | 2300 | |
| 2407 | Work Group | dfs and similar dp graphs strings trees | Statement | B | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | 2000 | ||
| 1547 | Demiurges Play Again | dfs and similar dp math trees | Statement | E | Codeforces Round 300 {538} | PROGRAMMING | 2200 | ||
| 2641 | Super M | dfs and similar dp graphs trees | Statement | D | Codeforces Round 328 (Div. 2) {592} | PROGRAMMING | 2200 | ||
| 3047 | Kingdom and its Cities | dfs and similar divide and conquer dp graphs sortings trees | Statement | D | Codeforces Round 339 (Div. 1) {613} | PROGRAMMING | 2800 | ||
| 1736 | Hamiltonian Spanning Tree | dfs and similar dp graph matchings greedy trees | Statement | D | Wunder Fund Round 2016 (Div. 1 + Div. 2 combined) {618} | PROGRAMMING | Wunder Fund Round 2016 Editorials | 2200 | |
| 1000 | The Chocolate Spree | dfs and similar dp graphs trees | Statement | F | Manthan, Codefest 16 {633} | PROGRAMMING | 2500 | ||
| 7284 | Alyona and the Tree | dfs and similar dp graphs trees | Statement | C | Codeforces Round 358 (Div. 2) {682} | PROGRAMMING | 45491 | 1700 | |
| 4012 | Connecting Universities | dfs and similar dp graphs trees | Statement | B | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 2100 | ||
| 4233 | Anton and Tree | dfs and similar dp trees | Statement | E | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | 2100 | ||
| 4373 | Chloe and pleasant prizes | dfs and similar dp graphs trees | Statement | D | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | 1800 | ||
| 497 | Broken Tree | dfs and similar dp graphs greedy trees | Statement | E | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | 2900 | ||
| 10621 | Timofey and a tree | dfs and similar dp ds graphs implementation trees | Statement | A | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 1600 | |
| 1284 | Tree Folding | dfs and similar dp greedy implementation trees | Statement | E | Codeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {765} | PROGRAMMING | Codeforces Round #397 Editorial | 2200 | |
| 3147 | Bear and Tree Jumps | dfs and similar dp trees | Statement | C | VK Cup 2017 - Round 1 {771} | PROGRAMMING | 2100 | ||
| 310 | Send the Fool Further! (hard) | dfs and similar dp math trees | Statement | L | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | 2800 | ||
| 2368 | An overnight dance in discotheque | dfs and similar dp geometry greedy trees | Statement | D | Codeforces Round 418 (Div. 2) {814} | PROGRAMMING | 2000 | ||
| 1075 | Roads in the Kingdom | dfs and similar dp graphs trees | Statement | F | Codeforces Round 427 (Div. 2) {835} | PROGRAMMING | Editorial | 2400 | |
| 17014 | Journey | dfs and similar dp graphs probabilities trees | Statement | C | Codeforces Round 428 (Div. 2) {839} | PROGRAMMING | 1500 | ||
| 221 | Harry Vs Voldemort | dfs and similar dp graphs trees | Statement | G | Manthan, Codefest 17 {855} | PROGRAMMING | 3000 | ||
| 194 | Sloth | dfs and similar dp graph matchings trees | Statement | D | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 3000 | |
| 896 | Fafa and Ancient Mathematics | dfs and similar dp trees | Statement | E | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 2500 | |
| 11686 | Cut 'em all! | dfs and similar dp graphs greedy trees | Statement | C | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1500 | |
| 908 | Flow Control | dfs and similar dp greedy trees | Statement | F | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2500 | |
| 818 | Road Projects | dfs and similar dp trees | Statement | F | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2600 | |
| 3180 | Sergey and Subway | dfs and similar dp trees | Statement | E | Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) {1060} | PROGRAMMING | User editorial for Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) | 2000 | |
| 1189 | Up and Down the Tree | dfs and similar dp trees | Statement | F | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 2500 | |
| 546 | Choosing Two Paths | dfs and similar dp greedy trees | Statement | F | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2800 | |
| 8243 | Tree with Maximum Cost | dfs and similar dp trees | Statement | F | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2100 | |
| 1415 | Power Tree | dfs and similar dp ds graphs greedy trees | Statement | D | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2400 | |
| 3946 | 0-1-Tree | dfs and similar divide and conquer dp ds trees | Statement | D | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 2300 | |
| 8497 | Tree Painting | dfs and similar dp trees | Statement | E | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2000 | |
| 2790 | Tourism | dfs and similar dp ds graphs greedy trees | Statement | E | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 2200 | |
| 1891 | The Maximum Subtree | dfs and similar dp graphs trees | Statement | F | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 2300 | |
| 5863 | Three Paths on a Tree | dfs and similar dp greedy trees | Statement | F | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 2100 | |
| 10173 | Maximum White Subtree | dfs and similar dp graphs trees | Statement | F | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 1018 | Independent Set | dfs and similar dp trees | Statement | F | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 2250.0 | Codeforces Round #630 Editorial | 2500 |
| 20596 | Linova and Kingdom | dfs and similar dp greedy sortings trees | Statement | A | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 500.0 | Codeforces Round #635 Editorial | 1700 |
| 1023 | Nested Rubber Bands | dfs and similar dp trees | Statement | D | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 2000.0 | Editorial | |
| 6862 | Tree Shuffling | dfs and similar dp ds greedy trees | Statement | E | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2250.0 | 78202 | 2000 |