Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
1 2 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 5416 | Two Paths | dfs and similar dp graphs shortest paths trees two pointers | Statement | D | Codeforces Beta Round 14 (Div. 2) {14} | PROGRAMMING | Codeforces Beta Round #14 tutorial | 2100 | |
| 2172 | Scheme | dfs and similar graphs trees | Statement | E | Codeforces Beta Round 22 (Div. 2 Only) {22} | PROGRAMMING | Codeforces Beta Round #22 Tutorial | 2400 | |
| 3041 | Ant on the Tree | constructive algorithms dfs and similar trees | Statement | D | Codeforces Beta Round 29 (Div. 2, Codeforces format) {29} | PROGRAMMING | My solution @ Round #29, [without Problem E] | 1900 | |
| 9029 | Fire Again | brute force dfs and similar shortest paths | Statement | C | Codeforces Beta Round 35 (Div. 2) {35} | PROGRAMMING | 1600 | ||
| 284 | Baldman and the military | dfs and similar graphs trees | Statement | E | Codeforces Beta Round 41 {42} | PROGRAMMING | Solution of task е, Codeforces beta round #41 | 2700 | |
| 860 | Caterpillar | dfs and similar dp graphs trees | Statement | F | Codeforces Beta Round 48 {51} | PROGRAMMING | 2600 | ||
| 7792 | Eternal Victory | dfs and similar graphs greedy shortest paths trees | Statement | D | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 1900 | |
| 1253 | Beavermuncher-0xFF | dfs and similar dp dsu greedy trees | Statement | C | Codeforces Beta Round 69 (Div. 1 Only) {77} | PROGRAMMING | Codeforces Beta Round #69 tutorial | 2300 | |
| 460 | Pairs | dfs and similar dp dsu graphs implementation trees | Statement | E | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 2600 | ||
| 642 | Petya and Tree | binary search dfs and similar probabilities sortings trees | Statement | C | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Yandex.Algorithm 2011 - Round 1. Problem C. Tutorial | 2200 | |
| 1100 | Beautiful Road | dfs and similar dp dsu graphs implementation sortings trees | Statement | D | Codeforces Beta Round 73 (Div. 1 Only) {87} | PROGRAMMING | CodeForces Beta Round #73 div. 1 analysis (particulary with div. 2) | 2300 | |
| 454 | Leaders | dfs and similar dsu graphs trees | Statement | E | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2800 | |
| 11085 | Cthulhu | dfs and similar dsu graphs | Statement | B | Codeforces Beta Round 80 (Div. 1 Only) {103} | PROGRAMMING | Tutorial | 1600 | |
| 45148 | Party | dfs and similar graphs trees | Statement | A | Codeforces Beta Round 87 (Div. 1 Only) {115} | PROGRAMMING | Tutorial | 1300 | |
| 844 | Maze | dfs and similar dp probabilities trees | Statement | E | Codeforces Beta Round 92 (Div. 1 Only) {123} | PROGRAMMING | Codeforces Beta Round #92 - Analysis | 2600 | |
| 20153 | Distance in Tree | dfs and similar dp trees | Statement | D | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 1800 | |
| 2322 | e-Government | data structures dfs and similar dp strings trees | Statement | E | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 2800 | |
| 1703 | Archaeology | data structures dfs and similar trees | Statement | E | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 3000 | |
| 9808 | Fools and Roads | data structures dfs and similar trees | Statement | C | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 2100 | |
| 9511 | Blood Cousins | binary search data structures dfs and similar trees | Statement | E | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 2400 | |
| 2273 | IT Restaurants | dfs and similar dp trees | Statement | E | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 1800 | ||
| 13064 | 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 | |
| 2382 | Cactus | data structures dfs and similar dp graphs trees | Statement | E | Codeforces Round 143 (Div. 2) {231} | PROGRAMMING | Tutorial Codeforces Round #143 | 2400 | |
| 645 | T-decomposition | dfs and similar graphs greedy trees | Statement | D | Codeforces Round 147 (Div. 2) {237} | PROGRAMMING | Codeforces Round #147 (Div. 2) Разбор Задач | 2200 | |
| 1396 | World Eater Brothers | dfs and similar dp greedy trees | Statement | C | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2200 | |
| 211 | Tree and Table | dfs and similar dp implementation trees | Statement | E | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 3000 | |
| 1402 | Little Elephant and Tree | data structures dfs and similar trees | Statement | E | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2400 | |
| 5697 | Zero Tree | dfs and similar dp greedy trees | Statement | B | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 2000 | |
| 861 | Polo the Penguin and Trees | combinatorics dfs and similar trees | Statement | D | Codeforces Round 177 (Div. 1) {288} | PROGRAMMING | Codeforces Round #177, editorial | 2300 | |
| 584 | Balance | constructive algorithms dfs and similar graphs trees | Statement | C | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Analysis | 2700 | |
| 9787 | Ciel the Commander | constructive algorithms dfs and similar divide and conquer greedy trees | Statement | C | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 2500 | |
| 7702 | Biridian Forest | dfs and similar shortest paths | Statement | B | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | Codeforces Round #192 Editorial | 1700 | |
| 7086 | Book of Evil | dfs and similar divide and conquer dp trees | Statement | D | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2100 | |
| 7233 | Water Tree | data structures dfs and similar graphs trees | Statement | D | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2100 | |
| 985 | Pumping Stations | brute force dfs and similar divide and conquer flows graphs greedy trees | Statement | E | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2800 | |
| 2317 | Apple Tree | dfs and similar number theory trees | Statement | B | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2400 | |
| 648 | Pilgrims | dfs and similar dp trees | Statement | E | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2800 | |
| 12283 | Valera and Elections | dfs and similar graphs trees | Statement | C | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 1700 | |
| 1189 | Choosing Subtree is Fun | binary search data structures dfs and similar trees two pointers | Statement | D | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 2600 | |
| 9351 | Tree and Queries | data structures dfs and similar trees | Statement | D | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 2400 | |
| 753 | Ksenia and Pawns | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 2300 | |
| 7865 | Propagating tree | data structures dfs and similar trees | Statement | C | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2400 | |
| 1317 | Hill Climbing | dfs and similar geometry trees | Statement | D | Codeforces Round 238 (Div. 1) {406} | PROGRAMMING | Codeforces Round #238 Tutorial | 2200 | |
| 12461 | Xor-tree | dfs and similar trees | Statement | A | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 1500 | |
| 7128 | 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 | |
| 6627 | Civilization | dfs and similar dp dsu ternary search trees | Statement | C | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2200 | |
| 7329 | Appleman and Tree | dfs and similar dp trees | Statement | B | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2200 | |
| 1786 | Caisa and Tree | brute force dfs and similar math number theory trees | Statement | E | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 2400 | |
| 2708 | Information Graph | dfs and similar dsu graphs trees | Statement | E | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 2400 | |
| 6742 | Design Tutorial: Inverse the Problem | dfs and similar dsu shortest paths trees | Statement | D | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 1900 | |
| 4437 | Valid Sets | dfs and similar dp math trees | Statement | D | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | Codeforces Round #277(Div. 2) Editorial | 2300 | |
| 3046 | Tourists | data structures dfs and similar graphs trees | Statement | E | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 3100 | |
| 1956 | Treeland Tour | data structures dfs and similar dp trees | Statement | F | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 2500 | |
| 713 | Birthday | data structures dfs and similar dp trees | Statement | D | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 15148 | 2700 | |
| 3311 | New Year Santa Network | combinatorics dfs and similar graphs trees | Statement | D | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 1900 | |
| 1100 | Misha and LCP on Tree | binary search dfs and similar hashing string suffix structures trees | Statement | E | Codeforces Round 285 (Div. 1) {504} | PROGRAMMING | 15743 | 3000 | |
| 1579 | Drazil and Morning Exercise | dfs and similar dp dsu trees two pointers | Statement | D | Codeforces Round 292 (Div. 1) {516} | PROGRAMMING | 16468 | 2800 | |
| 8908 | A and B and Lecture Rooms | binary search data structures dfs and similar dp trees | Statement | E | Codeforces Round 294 (Div. 2) {519} | PROGRAMMING | 2300 | ||
| 19339 | Reposts | *special dfs and similar dp graphs trees | Statement | A | VK Cup 2015 - Qualification Round 1 {522} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 1 | 1700 | |
| 2725 | 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 | ||
| 680 | Berland Miners | binary search data structures dfs and similar greedy trees | Statement | A | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | 3000 | ||
| 1673 | Demiurges Play Again | dfs and similar dp math trees | Statement | E | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 2200 | |
| 3146 | Case of Computer Network | dfs and similar graphs trees | Statement | E | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2800 | |
| 1093 | Matching Names | dfs and similar strings trees | Statement | A | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 2300 | |
| 990 | Logistical Questions | dfs and similar divide and conquer trees | Statement | C | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 3000 | |
| 9380 | Tree Requests | binary search bitmasks constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 2400 | |
| 1056 | Bear and Drawing | constructive algorithms dfs and similar trees | Statement | C | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1) {573} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 2600 | |
| 1295 | Bribes | dfs and similar graphs trees | Statement | B | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2300 | |
| 1947 | Invariance of Tree | constructive algorithms dfs and similar greedy trees | Statement | B | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 2300 | |
| 58436 | Kefa and Park | dfs and similar graphs trees | Statement | C | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1500 | |
| 3014 | Super M | dfs and similar dp graphs trees | Statement | D | Codeforces Round 328 (Div. 2) {592} | PROGRAMMING | Codeforces Round #328 Problem Analysis | 2200 | |
| 1462 | Happy Tree Party | data structures dfs and similar graphs math trees | Statement | D | Codeforces Round 329 (Div. 2) {593} | PROGRAMMING | 2300 | ||
| 19344 | Lomsat gelral | data structures dfs and similar dsu trees | Statement | E | Educational Codeforces Round 2 {600} | PROGRAMMING | Editorial | 2300 | |
| 1281 | Acyclic Organic Compounds | data structures dfs and similar dsu hashing strings trees | Statement | D | Codeforces Round 333 (Div. 1) {601} | PROGRAMMING | Codeforces Round #333 — editorial | 2400 | |
| 10804 | Minimum spanning tree for each edge | data structures dfs and similar dsu graphs trees | Statement | E | Educational Codeforces Round 3 {609} | PROGRAMMING | Editorial | 2100 | |
| 4291 | Kingdom and its Cities | dfs and similar divide and conquer dp graphs sortings trees | Statement | D | Codeforces Round 339 (Div. 1) {613} | PROGRAMMING | Tutorial | 2800 | |
| 2056 | 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 | |
| 2531 | Ants in Leaves | dfs and similar greedy sortings trees | Statement | E | Educational Codeforces Round 7 {622} | PROGRAMMING | Editorial of Educational Codeforces Round 7 | 2300 | |
| 1037 | Preorder Test | binary search dfs and similar dp graphs greedy trees | Statement | D | 8VC Venture Cup 2016 - Final Round {627} | PROGRAMMING | 8VC Venture Cup 2016 — Final Round Editorial | 2600 | |
| 271 | Island Puzzle | dfs and similar dsu graphs trees | Statement | F | 8VC Venture Cup 2016 - Final Round {627} | PROGRAMMING | 8VC Venture Cup 2016 — Final Round Editorial | 3400 | |
| 1205 | Famil Door and Roads | combinatorics data structures dfs and similar dp probabilities trees | Statement | E | Codeforces Round 343 (Div. 2) {629} | PROGRAMMING | Editorial of Codeforces Round #343 (Div.2) | 2400 | |
| 1441 | The Chocolate Spree | dfs and similar dp graphs trees | Statement | F | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2500 | |
| 973 | Yash And Trees | bitmasks data structures dfs and similar math number theory | Statement | G | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2700 | |
| 2422 | Road Improvement | *special dfs and similar graphs greedy trees | Statement | C | VK Cup 2016 - Qualification Round 2 {638} | PROGRAMMING | 2100 | ||
| 630 | Bear and Chemistry | data structures dfs and similar graphs trees | Statement | F | VK Cup 2016 - Round 1 {639} | PROGRAMMING | Tutorial | 3300 | |
| 1087 | Clockwork Bomb | data structures dfs and similar dsu greedy trees | Statement | E | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | Codeforces Round #345: editorial | 3100 | |
| 3038 | Pursuit For Artifacts | dfs and similar dsu graphs trees | Statement | E | Educational Codeforces Round 10 {652} | PROGRAMMING | Editorial of Educational Codeforces Round 10 | 2300 | |
| 1776 | Bear and Forgotten Tree 2 | dfs and similar dsu graphs trees | Statement | E | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 2400 | |
| 1915 | Gifts by the List | constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 357 (Div. 2) {681} | PROGRAMMING | 45425 | 2100 | |
| 8222 | Alyona and the Tree | dfs and similar dp graphs trees | Statement | C | Codeforces Round 358 (Div. 2) {682} | PROGRAMMING | 45491 | 1700 | |
| 5601 | Kay and Snowflake | data structures dfs and similar dp trees | Statement | B | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | Codeforces Round #359 Editorial | 2000 | |
| 5139 | Brain Network (medium) | dfs and similar graphs trees | Statement | C2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1600 | |
| 3867 | Puzzles | dfs and similar math probabilities trees | Statement | B | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 1800 | |
| 6253 | Fix a Tree | constructive algorithms dfs and similar dsu graphs trees | Statement | B | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | 46148 | 1700 | |
| 4708 | Connecting Universities | dfs and similar dp graphs trees | Statement | B | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 46283 | 2100 | |
| 4561 | Centroids | data structures dfs and similar dp graphs greedy trees | Statement | C | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | Editorial | 2500 | |
| 2760 | Digit Tree | dfs and similar divide and conquer dsu trees | Statement | C | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | Codeforces Round #372 Editorial | 2800 | |
| 3377 | Generating Sets | binary search data structures dfs and similar greedy strings trees | Statement | D | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | Tutorial | 1900 | |
| 5496 | Anton and Tree | dfs and similar dp trees | Statement | E | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 2100 | |
| 5243 | Alyona and a tree | binary search data structures dfs and similar graphs trees | Statement | B | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 2000 | |
| 3862 | Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths | data structures dfs and similar trees | Statement | D | Codeforces Round 383 (Div. 1) {741} | PROGRAMMING | Codeforces Round #383 editorial | 2700 | |
| 4767 | Chloe and pleasant prizes | dfs and similar dp graphs trees | Statement | D | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 1800 | |
| 744 | Santa Clauses and a Soccer Championship | constructive algorithms dfs and similar graphs trees | Statement | F | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 2500 | |
| 15445 | PolandBall and Forest | dfs and similar dsu graphs interactive trees | Statement | C | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 1300 | |
| 636 | Broken Tree | dfs and similar dp graphs greedy trees | Statement | E | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 2900 | |
| 2426 | Dasha and Puzzle | constructive algorithms dfs and similar graphs greedy trees | Statement | E | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | Codeforces Round #394 (Div. 2) [Editorial] | 2000 | |
| 12287 | Timofey and a tree | dfs and similar dp dsu graphs implementation trees | Statement | A | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 1600 | |
| 1359 | 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 | |
| 3603 | Mahmoud and a xor trip | bitmasks constructive algorithms data structures dfs and similar dp math trees | Statement | E | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 2200 | |
| 4707 | Garland | dfs and similar graphs greedy trees | Statement | C | Codeforces Round 398 (Div. 2) {767} | PROGRAMMING | Codeforces Round #398 (Div. 2) Editorial | 2000 | |
| 3628 | Bear and Tree Jumps | dfs and similar dp trees | Statement | C | VK Cup 2017 - Round 1 {771} | PROGRAMMING | VK Cup 2017 Round 1 and CF Round 405 — Editorial | 2100 | |
| 1024 | Peterson Polyglot | brute force dfs and similar dsu hashing strings trees | Statement | C | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | Codeforces Round #402, Editorial | 2600 | |
| 10282 | Andryusha and Colored Balloons | dfs and similar graphs greedy trees | Statement | C | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 1500 | |
| 197 | Rap God | data structures dfs and similar hashing strings trees | Statement | D | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | Codeforces Round #406 Editorial | 3300 | |
| 336 | Problem of offices | constructive algorithms dfs and similar dp trees | Statement | E | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 2800 | |
| 7859 | Police Stations | constructive algorithms dfs and similar dp graphs shortest paths trees | Statement | D | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 2100 | |
| 6674 | Send the Fool Further! (easy) | dfs and similar graphs trees | Statement | J1 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 1400 | |
| 6421 | Send the Fool Further! (easy) | dfs and similar graphs trees | Statement | J | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 1500 | |
| 406 | Send the Fool Further! (hard) | dfs and similar dp math trees | Statement | J3 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2400 | |
| 364 | Send the Fool Further! (hard) | dfs and similar dp math trees | Statement | L | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2800 | |
| 1634 | Expected diameter of a tree | binary search brute force dfs and similar dp sortings trees | Statement | D | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 2600 | |
| 383 | Sagheer and Kindergarten | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 417 (Div. 2) {812} | PROGRAMMING | [Editorial] Codeforces Round #417 (Div. 2) | 2700 | |
| 2625 | An overnight dance in discotheque | dfs and similar dp geometry greedy trees | Statement | D | Codeforces Round 418 (Div. 2) {814} | PROGRAMMING | Codeforces Round #418 (Div. 2) Editorial | 2000 | |
| 400 | Madness | constructive algorithms dfs and similar trees | Statement | F | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | Codeforces Round #422 (Div. 2) Editorial | 2700 | |
| 1548 | Tree Queries | dfs and similar graphs trees | Statement | G | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 2600 | |
| 1517 | Best Edge Weight | data structures dfs and similar graphs trees | Statement | D | Codeforces Round 423 (Div. 1, rated, based on VK Cup Finals) {827} | PROGRAMMING | Codeforces Round #423 Analysis | 2700 | |
| 4739 | Misha, Grisha and Underground | dfs and similar graphs trees | Statement | D | Codeforces Round 425 (Div. 2) {832} | PROGRAMMING | Codeforces Round #425 (Div.2) Editorial | 1900 | |
| 1329 | Roads in the Kingdom | dfs and similar dp graphs trees | Statement | F | Codeforces Round 427 (Div. 2) {835} | PROGRAMMING | Editorial | 2400 | |
| 1152 | Diverging Directions | data structures dfs and similar trees | Statement | B | IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules) {838} | PROGRAMMING | 53736 | 2100 | |
| 20919 | Journey | dfs and similar dp graphs probabilities trees | Statement | C | Codeforces Round 428 (Div. 2) {839} | PROGRAMMING | Codeforces Round #428 editorial | 1500 | |
| 3819 | Ilya And The Tree | dfs and similar graphs math number theory trees | Statement | C | Codeforces Round 430 (Div. 2) {842} | PROGRAMMING | Tutorial Codeforces Round #430 (Div. 2) | 2000 | |
| 526 | Nikita and game | binary search dfs and similar divide and conquer graphs trees | Statement | E | Codeforces Round 430 (Div. 2) {842} | PROGRAMMING | Tutorial Codeforces Round #430 (Div. 2) | 3000 | |
| 416 | Upgrading Tree | constructive algorithms dfs and similar graphs math trees | Statement | C | AIM Tech Round 4 (Div. 1) {843} | PROGRAMMING | AIM Tech Round 4 -- Editorial | 2900 | |
| 1064 | Chemistry in Berland | dfs and similar greedy trees | Statement | E | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 2400 | |
| 363 | Berland SU Computer Network | dfs and similar hashing trees | Statement | L | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2500 | ||
| 788 | Dating | brute force dfs and similar graphs trees | Statement | I | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2500 | |
| 454 | Harry Vs Voldemort | dfs and similar dp graphs trees | Statement | G | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 3000 | |
| 2158 | Desk Disorder | combinatorics dfs and similar dsu graphs trees | Statement | E | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 2100 | |
| 554 | Arkady and a Nobody-men | data structures dfs and similar trees | Statement | E | Codeforces Round 434 (Div. 1, based on Technocup 2018 Elimination Round 1) {860} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 2600 | |
| 27270 | Mahmoud and Ehab and the bipartiteness | dfs and similar graphs trees | Statement | B | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 1400 | |
| 706 | Cities Excursions | dfs and similar graphs trees | Statement | F | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | Codeforces Round #436 (Div.2) Разбор | 2700 | |
| 1342 | Points, Lines and Ready-made Titles | dfs and similar dsu graphs trees | Statement | E | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 2400 | |
| 488 | Sloth | dfs and similar dp graph matchings trees | Statement | D | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 3000 | |
| 2382 | Tree Destruction | constructive algorithms dfs and similar graphs greedy trees | Statement | F | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | T | 2500 | |
| 8597 | Peculiar apple-tree | dfs and similar graphs trees | Statement | A | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 1500 | |
| 1006 | Fafa and Ancient Mathematics | dfs and similar dp trees | Statement | E | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 2500 | |
| 261 | Iqea | data structures dfs and similar divide and conquer dsu shortest paths trees | Statement | E | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 3300 | |
| 767 | Maximum Control (medium) | data structures dfs and similar graphs greedy trees | Statement | B2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2400 | |
| 2357 | Alternating Tree | combinatorics dfs and similar divide and conquer dp probabilities trees | Statement | E | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 2200 | |
| 1672 | Simple Cycles Edges | dfs and similar graphs trees | Statement | F | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2400 | |
| 3049 | Destruction of a Tree | constructive algorithms dfs and similar dp greedy trees | Statement | B | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 2100 | |
| 7492 | Kuro and Walking Route | dfs and similar trees | Statement | C | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | Codeforces Round #482 (Div. 2) Editorial | 1600 | |
| 16708 | Cut 'em all! | dfs and similar dp graphs greedy trees | Statement | C | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1500 | |
| 1143 | 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 | |
| 7011 | We Need More Bosses | dfs and similar graphs trees | Statement | E | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2100 | |
| 11986 | Military Problem | dfs and similar graphs trees | Statement | E | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1600 | |
| 2627 | Mars rover | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 2100 | |
| 1096 | Road Projects | dfs and similar dp trees | Statement | F | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2600 | |
| 1074 | Mobile Phone Network | dfs and similar dsu graphs trees | Statement | F | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 2600 | |
| 19984 | Valid BFS? | dfs and similar graphs shortest paths trees | Statement | D | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1700 | |
| 1606 | Leaf Sets | data structures dfs and similar dsu graphs greedy sortings trees | Statement | F | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2400 | |
| 1722 | Intersecting Subtrees | dfs and similar interactive trees | Statement | B | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 1900 | |
| 865 | Hyperspace Highways | dfs and similar graphs trees | Statement | C | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | Tutorial (PDF) | 2500 | |
| 6830 | Decorate Apple Tree | constructive algorithms dfs and similar dp graphs greedy sortings trees | Statement | D | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 1600 | |
| 7691 | Bmail Computer Network | *special dfs and similar trees | Statement | A | Mail.Ru Cup 2018 - Practice Round {1057} | PROGRAMMING | 1700 | ||
| 3564 | 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 | |
| 2141 | Company | binary search data structures dfs and similar greedy trees | Statement | E | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 2300 | |
| 1408 | 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 | |
| 668 | Choosing Two Paths | dfs and similar dp greedy trees | Statement | F | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2800 | |
| 11535 | 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 | |
| 2228 | Minimal Diameter Forest | constructive algorithms dfs and similar greedy trees | Statement | E | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2500 | |
| 9692 | Sum in the tree | constructive algorithms dfs and similar greedy trees | Statement | A | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 1600 | |
| 1182 | Construct a tree | binary search constructive algorithms dfs and similar graphs greedy trees | Statement | C | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2300 | |
| 1083 | Cookies | binary search data structures dfs and similar dp games trees | Statement | F | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 2300 | |
| 5564 | GCD Counting | data structures dfs and similar dp number theory trees | Statement | D | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2000 | |
| 1180 | Tree | data structures dfs and similar dp graphs trees | Statement | E | CodeCraft-19 and Codeforces Round 537 (Div. 2) {1111} | PROGRAMMING | CodeCraft-19 and Codeforces Round #537 (Div. 2) Editorial | 2800 | |
| 6850 | Tree Cutting (Easy Version) | dfs and similar trees | Statement | F1 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1800 | |
| 707 | Tree Cutting (Hard Version) | combinatorics dfs and similar dp trees | Statement | F2 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 2700 | |
| 1806 | Power Tree | dfs and similar dp dsu graphs greedy trees | Statement | D | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2400 | |
| 3877 | Spanning Tree with One Fixed Degree | constructive algorithms dfs and similar dsu graphs greedy | Statement | F2 | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 2200 | |
| 17455 | Edgy Trees | dfs and similar dsu graphs math trees | Statement | C | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 1500 | |
| 2562 | Privatization of Roads in Treeland | binary search constructive algorithms dfs and similar graphs greedy trees | Statement | G | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2500 | |
| 4001 | Lynyrd Skynyrd | data structures dfs and similar dp math trees | Statement | B | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2300 | |
| 18635 | Queen | dfs and similar trees | Statement | C | Codeforces Round 549 (Div. 2) {1143} | PROGRAMMING | Codeforces Round #549 Editorial | 1400 | |
| 5660 | Serval and Rooted Tree | binary search dfs and similar dp greedy trees | Statement | D | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1800 | |
| 4892 | 0-1-Tree | dfs and similar divide and conquer dp dsu trees | Statement | D | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 2300 | |
| 4455 | Nauuo and Circle | combinatorics dfs and similar dp trees | Statement | B | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2000 | |
| 4749 | 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 | |
| 14005 | Cover it! | dfs and similar dsu graphs shortest paths trees | Statement | E | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1700 | |
| 1042 | Complete Mirror | constructive algorithms dfs and similar dp hashing implementation trees | Statement | D | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2500 | |
| 1110 | Daleks' Invasion (medium) | dfs and similar graphs shortest paths trees | Statement | E2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2200 | |
| 11918 | Tree Painting | dfs and similar dp trees | Statement | E | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2000 | |
| 1327 | Add on a Tree: Revolution | constructive algorithms dfs and similar implementation trees | Statement | A2 | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 2500 | |
| 1612 | Dynamic Diameter | *special data structures dfs and similar divide and conquer trees | Statement | B | CEOI 2019 day 1 online mirror (unrated, IOI format) {1192} | PROGRAMMING | E | ||
| 1306 | Indie Album | data structures dfs and similar hashing string suffix structures strings trees | Statement | G | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 2600 | |
| 1421 | Koala and Notebook | data structures dfs and similar graphs shortest paths strings trees | Statement | F | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2600 | |
| 518 | Tiles Placement | constructive algorithms dfs and similar trees | Statement | H | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2700 | |
| 3055 | Tourism | dfs and similar dp dsu graphs greedy trees | Statement | E | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 2200 | |
| 2231 | 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 | |
| 9624 | 0-1 MST | dfs and similar dsu graphs sortings | Statement | B | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 1900 | |
| 483 | Send Tree to Charlie | combinatorics dfs and similar dsu trees | Statement | E | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 3200 | |
| 982 | Economic Difficulties | data structures dfs and similar dp flows graphs trees | Statement | F | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 2500 | |
| 2078 | Tests for problem D | constructive algorithms dfs and similar divide and conquer trees | Statement | E | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2200 | |
| 3095 | Jeremy Bearimy | dfs and similar graphs greedy trees | Statement | C | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2000 | |
| 8768 | Dr. Evil Underscores | bitmasks brute force dfs and similar divide and conquer dp greedy strings trees | Statement | D | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1800 | |
| 5699 | Numbers on Tree | constructive algorithms data structures dfs and similar graphs greedy trees | Statement | B | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2000 | |
| 2395 | Xenon's Attack on the Gangs | combinatorics dfs and similar dp greedy trees | Statement | C | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 1250.0 | Codeforces Round #614 Editorial | 2300 |
| 7186 | 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 | |
| 3138 | Berland Beauty | constructive algorithms dfs and similar greedy sortings trees | Statement | F | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 2400 | |
| 219 | Modernization of Treeland | *special dfs and similar trees | Statement | E | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 697 | Around the World | bitmasks combinatorics dfs and similar dp graphs graphs math trees | Statement | D | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1750.0 | Codeforces Round #618 Editorial | 2900 |
| 6072 | 1-Trees and Queries | data structures dfs and similar shortest paths trees | Statement | E | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 2000.0 | Codeforces Round #620 (Div. 2) Editorial | 2000 |
| 5403 | Kuroni and the Celebration | constructive algorithms dfs and similar graphs interactive trees | Statement | D | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 1750.0 | Ozon Tech Challenge 2020 Editorial | 1900 |
| 692 | Cow and Vacation | dfs and similar dsu trees | Statement | F | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 3000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 3200 |
| 2904 | Construct the Binary Tree | brute force constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 2400 | |
| 13686 | Maximum White Subtree | dfs and similar dp graphs trees | Statement | F | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 17913 | Ehab and Path-etic MEXs | constructive algorithms dfs and similar greedy trees | Statement | C | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 1250.0 | 74235 | 1500 |
| 12391 | Tree Queries | dfs and similar graphs trees | Statement | E | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 2100 | |
| 1199 | Independent Set | dfs and similar dp trees | Statement | F | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 2250.0 | Codeforces Round #630 Editorial | 2500 |
| 25590 | 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 |
| 1161 | Nested Rubber Bands | dfs and similar dp trees | Statement | D | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 2000.0 | Editorial | |
| 1099 | Nastya and Time Machine | constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 1750.0 | Codeforces Round #637 Editorial | |
| 1054 | James and the Chase | dfs and similar graphs probabilities trees | Statement | E | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 3000.0 | Codeforces Round #647 Editorial | 3000 |
| 7602 | Tree Shuffling | dfs and similar dp dsu greedy trees | Statement | E | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2250.0 | 78202 | 2000 |
| 5113 | Ehab's Last Corollary | constructive algorithms data structures dfs and similar dp graphs implementation trees | Statement | D | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 2000.0 | Codeforces round #649 editorial | 2100 |
| 1849 | The Hidden Pair (Easy Version) | binary search dfs and similar graphs interactive shortest paths trees | Statement | F1 | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #651 | |
| 1740 | The Hidden Pair (Hard Version) | binary search dfs and similar graphs interactive shortest paths trees | Statement | F2 | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #651 | |
| 2284 | Tree Modification | dfs and similar greedy trees | Statement | G | Codeforces Global Round 9 {1375} | PROGRAMMING | 2250.0 | 79731 | |
| 832 | The Majestic Brown Tree Snake | dfs and similar dp greedy trees two pointers | Statement | D | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 2500.0 | Codeforces Round #658 Editorial | 3000 |
| 2953 | Removing Leaves | data structures dfs and similar divide and conquer greedy implementation trees | Statement | F | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2300 | |
| 10493 | Uncle Bogdan and Country Happiness | dfs and similar dp greedy math trees | Statement | C | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1500.0 | Codeforces Round #660 Editorial | 1800 |
| 6981 | Captain Flint and Treasure | data structures dfs and similar dp graphs greedy implementation trees | Statement | D | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 2000.0 | Codeforces Round #660 Editorial | 2000 |
| 560 | Directing Edges | dfs and similar dp graphs greedy trees | Statement | G | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 2061 | Pairs of Pairs | constructive algorithms dfs and similar graphs trees | Statement | E | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 2750.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 441 | Distance Matching | binary search constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 2500.0 | Codeforces Round #666 — Editorial | |
| 2576 | Weights Division (hard version) | binary search data structures dfs and similar greedy trees two pointers | Statement | E2 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 6417 | Weights Division (easy version) | data structures dfs and similar greedy trees | Statement | E1 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 10765 | Maximum Distributed Tree | constructive algorithms dfs and similar greedy math number theory sortings trees | Statement | D | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1750.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 271 | Star Trek | *special combinatorics dfs and similar dp games graphs matrices trees | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 438 | Spring cleaning | *special data structures dfs and similar graphs trees | Statement | B | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 8316 | Tree Tag | dfs and similar dp games trees | Statement | B | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 1000.0 | Codeforces Round #668 Editorial | |
| 12011 | Link Cut Centroids | constructive algorithms dfs and similar graphs trees | Statement | C | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 1500.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 2876 | Graph and Queries | data structures dfs and similar dsu graphs trees | Statement | D | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2000.0 | Codeforces Round #673 Editorial | 2600 |
| 32114 | Districts Connection | constructive algorithms dfs and similar trees | Statement | D | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 6564 | Bandit in a City | binary search dfs and similar greedy trees | Statement | D | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 2000.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 171 | Finding the Vertex | brute force dfs and similar dp interactive trees | Statement | E | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 3000.0 | Codeforces Round #680 Editorial | |
| 2256 | Dog Snacks | binary search dfs and similar dp greedy trees | Statement | E | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 2500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 6818 | Number of Simple Paths | combinatorics data structures dfs and similar dsu graphs trees | Statement | E | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 1840 | Distinctive Roots in a Tree | data structures dfs and similar trees | Statement | E | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 2500.0 | Codeforces Round #695 (Div. 2) Editorial | 2500 |
| 22044 | Permutation Transformation | dfs and similar divide and conquer implementation | Statement | D | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial |