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 |
|---|---|---|---|---|---|---|---|---|---|
| 5265 | 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 | |
| 2065 | Scheme | dfs and similar graphs trees | Statement | E | Codeforces Beta Round 22 (Div. 2 Only) {22} | PROGRAMMING | Codeforces Beta Round #22 Tutorial | 2400 | |
| 15455 | Roads not only in Berland | dsu graphs trees | Statement | D | Codeforces Beta Round 25 (Div. 2 Only) {25} | PROGRAMMING | Codeforces Beta Round #25 Solution Analysis | 1900 | |
| 243 | 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 | |
| 811 | Caterpillar | dfs and similar dp graphs trees | Statement | F | Codeforces Beta Round 48 {51} | PROGRAMMING | 2600 | ||
| 7613 | Eternal Victory | dfs and similar graphs greedy shortest paths trees | Statement | D | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 1900 | |
| 2133 | Gift | dsu graphs sortings trees | Statement | A | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 2300 | |
| 398 | Pairs | dfs and similar dp dsu graphs implementation trees | Statement | E | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 2600 | ||
| 1051 | 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 | |
| 428 | Leaders | dfs and similar dsu graphs trees | Statement | E | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2800 | |
| 43060 | Party | dfs and similar graphs trees | Statement | A | Codeforces Beta Round 87 (Div. 1 Only) {115} | PROGRAMMING | Tutorial | 1300 | |
| 565 | Garden | bitmasks dp graphs trees | Statement | E | Codeforces Round 108 (Div. 2) {152} | PROGRAMMING | Разбор задач Codeforces Round #108 (Div. 2) | 2400 | |
| 4670 | Cutting Figure | constructive algorithms graphs trees | Statement | A | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 1700 | |
| 12413 | 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 | |
| 2310 | Cactus | data structures dfs and similar dp graphs trees | Statement | E | Codeforces Round 143 (Div. 2) {231} | PROGRAMMING | Tutorial Codeforces Round #143 | 2400 | |
| 617 | T-decomposition | dfs and similar graphs greedy trees | Statement | D | Codeforces Round 147 (Div. 2) {237} | PROGRAMMING | Codeforces Round #147 (Div. 2) Разбор Задач | 2200 | |
| 1662 | Black and White Tree | constructive algorithms dsu graphs greedy trees | Statement | D | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | Codeforces Round #158 (Div. 2) Tutorial | 2200 | |
| 1850 | Little Girl and Problem on Trees | data structures graphs trees | Statement | E | Codeforces Round 169 (Div. 2) {276} | PROGRAMMING | Codeforces Round #169 — Unofficial Editorial | 2300 | |
| 546 | Balance | constructive algorithms dfs and similar graphs trees | Statement | C | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Analysis | 2700 | |
| 6811 | Water Tree | data structures dfs and similar graphs trees | Statement | D | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2100 | |
| 910 | 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 | |
| 12002 | Valera and Elections | dfs and similar graphs trees | Statement | C | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 1700 | |
| 572 | Sereja and Tree | graphs implementation | Statement | B | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 2500 | |
| 726 | 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 | |
| 1796 | On Changing Tree | data structures graphs trees | Statement | C | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 1500.0 | Codeforces Round #232 Editorial (restored) | |
| 545 | Big Problems for Organizers | data structures graphs trees | Statement | D | RCC 2014 Warmup (Div. 1) {418} | PROGRAMMING | RCC 2014 WarmUp Analysis | 2700 | |
| 2881 | Dungeons and Candies | dsu graphs greedy trees | Statement | C | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 1800 | |
| 2611 | Information Graph | dfs and similar dsu graphs trees | Statement | E | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 2400 | |
| 2822 | Tourists | data structures dfs and similar graphs trees | Statement | E | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 3100 | |
| 3274 | New Year Santa Network | combinatorics dfs and similar graphs trees | Statement | D | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 1900 | |
| 18755 | Reposts | *special dfs and similar dp graphs trees | Statement | A | VK Cup 2015 - Qualification Round 1 {522} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 1 | 1700 | |
| 2683 | 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 | ||
| 5507 | Paths and Trees | graphs greedy shortest paths | Statement | E | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 2100 | |
| 2946 | Case of Computer Network | dfs and similar graphs trees | Statement | E | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2800 | |
| 1211 | Ann and Half-Palindrome | data structures dp graphs string suffix structures strings trees | Statement | E | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 2700 | |
| 8973 | 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 | |
| 1237 | Bribes | dfs and similar graphs trees | Statement | B | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2300 | |
| 55100 | Kefa and Park | dfs and similar graphs trees | Statement | C | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1500 | |
| 2953 | Super M | dfs and similar dp graphs trees | Statement | D | Codeforces Round 328 (Div. 2) {592} | PROGRAMMING | Codeforces Round #328 Problem Analysis | 2200 | |
| 1421 | Happy Tree Party | data structures dfs and similar graphs math trees | Statement | D | Codeforces Round 329 (Div. 2) {593} | PROGRAMMING | 2300 | ||
| 10186 | Minimum spanning tree for each edge | data structures dfs and similar dsu graphs trees | Statement | E | Educational Codeforces Round 3 {609} | PROGRAMMING | Editorial | 2100 | |
| 4005 | 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 | |
| 979 | 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 | |
| 251 | 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 | |
| 1279 | Magic Matrix | brute force divide and conquer graphs matrices trees | Statement | F | Educational Codeforces Round 9 {632} | PROGRAMMING | 43493 | 2400 | |
| 1372 | The Chocolate Spree | dfs and similar dp graphs trees | Statement | F | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2500 | |
| 2244 | Road Improvement | *special dfs and similar graphs greedy trees | Statement | C | VK Cup 2016 - Qualification Round 2 {638} | PROGRAMMING | 2100 | ||
| 6976 | Bear and Forgotten Tree 3 | constructive algorithms graphs trees | Statement | B | VK Cup 2016 - Round 1 {639} | PROGRAMMING | Tutorial | 1600 | |
| 450 | Bear and Chemistry | data structures dfs and similar graphs trees | Statement | F | VK Cup 2016 - Round 1 {639} | PROGRAMMING | Tutorial | 3300 | |
| 2840 | Pursuit For Artifacts | dfs and similar dsu graphs trees | Statement | E | Educational Codeforces Round 10 {652} | PROGRAMMING | Editorial of Educational Codeforces Round 10 | 2300 | |
| 1735 | 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 | |
| 1874 | Gifts by the List | constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 357 (Div. 2) {681} | PROGRAMMING | 45425 | 2100 | |
| 8066 | Alyona and the Tree | dfs and similar dp graphs trees | Statement | C | Codeforces Round 358 (Div. 2) {682} | PROGRAMMING | 45491 | 1700 | |
| 4989 | Brain Network (medium) | dfs and similar graphs trees | Statement | C2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1600 | |
| 6167 | Fix a Tree | constructive algorithms dfs and similar dsu graphs trees | Statement | B | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | 46148 | 1700 | |
| 4631 | Connecting Universities | dfs and similar dp graphs trees | Statement | B | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 46283 | 2100 | |
| 4334 | Centroids | data structures dfs and similar dp graphs greedy trees | Statement | C | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | Editorial | 2500 | |
| 1500 | Xor-matic Number of the Graph | bitmasks graphs math number theory trees | Statement | G | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 2600 | |
| 1295 | Drivers Dissatisfaction | data structures dsu graphs trees | Statement | F | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | Codeforces Round #378 (Div. 2) editorial | 2500 | |
| 5098 | Alyona and a tree | binary search data structures dfs and similar graphs trees | Statement | B | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 2000 | |
| 4706 | Chloe and pleasant prizes | dfs and similar dp graphs trees | Statement | D | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 1800 | |
| 1634 | New Roads | constructive algorithms graphs trees | Statement | G | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | Codeforces Round #386 (Div.2) Editorial | 2100 | |
| 711 | 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 | |
| 14941 | 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 | |
| 646 | 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 | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 2500 | |
| 552 | 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 | |
| 2367 | 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 | |
| 478 | Tree nesting | combinatorics graphs trees | Statement | F | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 2900 | |
| 11854 | 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 | |
| 644 | Timofey and a flat tree | data structures graphs hashing shortest paths trees | Statement | D | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 2800 | |
| 4630 | Garland | dfs and similar graphs greedy trees | Statement | C | Codeforces Round 398 (Div. 2) {767} | PROGRAMMING | Codeforces Round #398 (Div. 2) Editorial | 2000 | |
| 511 | Sherlock's bet to Moriarty | constructive algorithms data structures divide and conquer geometry graphs implementation trees | Statement | F | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 2700 | |
| 10001 | Andryusha and Colored Balloons | dfs and similar graphs greedy trees | Statement | C | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 1500 | |
| 750 | ALT | data structures flows graphs trees | Statement | E | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | Codeforces Round #406 Editorial | 3200 | |
| 7146 | Police Stations | constructive algorithms dfs and similar dp graphs shortest paths trees | Statement | D | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 2100 | |
| 6515 | 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 | |
| 348 | 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 | |
| 1465 | Tree Queries | dfs and similar graphs trees | Statement | G | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 2600 | |
| 1368 | 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 | |
| 977 | Singer House | combinatorics dp graphs trees | Statement | D | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | Codeforces Round #424 Editorial | 2800 | |
| 338 | Perpetual Motion Machine | constructive algorithms dp graphs implementation math trees | Statement | E | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | Codeforces Round #424 Editorial | 3100 | |
| 4434 | 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 | |
| 1233 | Roads in the Kingdom | dfs and similar dp graphs trees | Statement | F | Codeforces Round 427 (Div. 2) {835} | PROGRAMMING | Editorial | 2400 | |
| 20001 | Journey | dfs and similar dp graphs probabilities trees | Statement | C | Codeforces Round 428 (Div. 2) {839} | PROGRAMMING | Codeforces Round #428 editorial | 1500 | |
| 3753 | 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 | |
| 500 | 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 | |
| 407 | 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 | |
| 731 | Dating | brute force dfs and similar graphs trees | Statement | I | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2500 | |
| 281 | Harry Vs Voldemort | dfs and similar dp graphs trees | Statement | G | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 3000 | |
| 2111 | Desk Disorder | combinatorics dfs and similar dsu graphs trees | Statement | E | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 2100 | |
| 25448 | 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 | |
| 674 | Cities Excursions | dfs and similar graphs trees | Statement | F | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | Codeforces Round #436 (Div.2) Разбор | 2700 | |
| 564 | Policeman and a Tree | dp graphs trees | Statement | E | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 2600 | |
| 1312 | 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 | |
| 172 | Restore the Tree | graphs greedy trees | Statement | E | Codeforces Round 440 (Div. 1, based on Technocup 2018 Elimination Round 2) {871} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 2800 | |
| 2261 | Tree Destruction | constructive algorithms dfs and similar graphs greedy trees | Statement | F | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | T | 2500 | |
| 3035 | Imbalance Value of a Tree | data structures dsu graphs trees | Statement | F | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 2500 | |
| 126 | Public Service | constructive algorithms graphs trees | Statement | F | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 2900 | |
| 8369 | 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 | |
| 744 | 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 | |
| 1578 | 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 | |
| 215 | Cactus to Tree | dp graphs trees | Statement | F | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2900 | |
| 15741 | Cut 'em all! | dfs and similar dp graphs greedy trees | Statement | C | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1500 | |
| 6460 | We Need More Bosses | dfs and similar graphs trees | Statement | E | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2100 | |
| 11569 | Military Problem | dfs and similar graphs trees | Statement | E | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1600 | |
| 2560 | Mars rover | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 2100 | |
| 259 | Tree | fft graphs trees | Statement | F | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 3400 | |
| 1008 | 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 | |
| 18975 | Valid BFS? | dfs and similar graphs shortest paths trees | Statement | D | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1700 | |
| 1466 | Leaf Sets | data structures dfs and similar dsu graphs greedy sortings trees | Statement | F | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2400 | |
| 827 | Hyperspace Highways | dfs and similar graphs trees | Statement | C | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | Tutorial (PDF) | 2500 | |
| 3723 | The Shortest Statement | graphs shortest paths trees | Statement | F | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 2300 | |
| 6713 | 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 | |
| 1161 | Construct a tree | binary search constructive algorithms dfs and similar graphs greedy trees | Statement | C | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2300 | |
| 1091 | 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 | |
| 1767 | 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 | |
| 3797 | 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 | |
| 16570 | Edgy Trees | dfs and similar dsu graphs math trees | Statement | C | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 1500 | |
| 2542 | 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 | |
| 1956 | Ehab and the Big Finale | constructive algorithms divide and conquer graphs implementation interactive trees | Statement | F | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 2300 | |
| 13500 | Cover it! | dfs and similar dsu graphs shortest paths trees | Statement | E | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1700 | |
| 1860 | Daleks' Invasion (easy) | graphs trees | Statement | E1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2000 | |
| 1056 | 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 | |
| 664 | Daleks' Invasion (hard) | data structures dsu graphs trees | Statement | E3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2500 | |
| 1362 | 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 | |
| 9436 | Path Queries | divide and conquer dsu graphs sortings trees | Statement | G | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2000 | |
| 2859 | Petya and Construction Set | constructive algorithms graphs math sortings trees | Statement | E | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2000 | |
| 716 | Forced Online Queries Problem | data structures divide and conquer dsu graphs trees | Statement | F | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2800 | |
| 2999 | 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 | |
| 1639 | Arson In Berland Forest | binary search graphs graphs shortest paths | Statement | E | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2200 | |
| 2051 | 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 | |
| 9213 | 0-1 MST | dfs and similar dsu graphs sortings | Statement | B | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 1900 | |
| 8293 | Paint the Tree | brute force constructive algorithms dp graphs implementation trees | Statement | D | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1700 | |
| 9529 | Shichikuji and Power Grid | dsu graphs greedy shortest paths trees | Statement | D | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1900 | |
| 2244 | Cheap Robot | binary search dsu graphs shortest paths trees | Statement | F | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 2600 | |
| 949 | 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 | |
| 4320 | Segment Tree | data structures dsu graphs trees | Statement | D | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2100 | |
| 3038 | Jeremy Bearimy | dfs and similar graphs greedy trees | Statement | C | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2000 | |
| 9405 | Christmas Trees | graphs greedy shortest paths | Statement | D | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1800 | |
| 412 | New Year and Social Network | data structures graph matchings graphs math trees | Statement | F | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 3100 | |
| 2000 | Delete a Segment | brute force constructive algorithms data structures dp graphs sortings trees two pointers | Statement | E | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 2300 | |
| 5454 | 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 | |
| 966 | Chaotic V. | dp graphs greedy math number theory trees | Statement | D | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 1750.0 | Codeforces Round #614 Editorial | 2700 |
| 528 | 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 |
| 5354 | 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 |
| 12957 | Maximum White Subtree | dfs and similar dp graphs trees | Statement | F | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 11649 | Tree Queries | dfs and similar graphs trees | Statement | E | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 2100 | |
| 278 | Journey | data structures divide and conquer graphs trees | Statement | F | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 3250.0 | Codeforces Round #635 Editorial | 3600 |
| 1068 | 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 | |
| 984 | 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 |
| 4951 | 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 |
| 675 | Shifting Dominoes | data structures geometry graphs trees | Statement | G | Codeforces Global Round 8 {1368} | PROGRAMMING | 3500.0 | Codeforces Global Round 8: editorial | |
| 9216 | TediousLee | dp graphs greedy math matrices trees | Statement | D | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2000.0 | Codeforces Round #652 (Div. 2) Editorial | 1900 |
| 1779 | 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 | |
| 1662 | 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 | |
| 661 | String Transformation 2 | dp graphs trees | Statement | C | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1750.0 | Codeforces Round #659 Editorial | |
| 11243 | String Transformation 1 | dsu graphs greedy sortings strings trees | Statement | A | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 6902 | 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 |
| 492 | Directing Edges | dfs and similar dp graphs greedy trees | Statement | G | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 1921 | 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 | |
| 233 | 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 | ||
| 393 | 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 | ||
| 11721 | 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 | |
| 2693 | 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 |
| 213 | Dušan's Railway | graphs trees | Statement | C | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 14327 | Minimal Height Tree | graphs greedy shortest paths trees | Statement | D | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 6596 | 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 | ||
| 1530 | BFS Trees | combinatorics dfs and similar graphs math shortest paths trees | Statement | D | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2000.0 | Codeforces Round #706 Editorial | |
| 420 | Squares | constructive algorithms data structures graphs trees | Statement | F | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 3250.0 | Codeforces Round #706 Editorial | |
| 2068 | Phoenix and Earthquake | constructive algorithms dfs and similar dsu graphs greedy trees | Statement | F | Codeforces Global Round 14 {1515} | PROGRAMMING | 3250.0 | Editorial | |
| 893 | Off by One | constructive algorithms dfs and similar geometry graphs sortings trees | Statement | E | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 2289 | Nastia Plays with a Tree | constructive algorithms data structures dfs and similar dp flows graphs greedy implementation trees | Statement | D | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2250.0 | 90477 | |
| 255 | Lost Nodes | dp graphs interactive sortings trees | Statement | H | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 3500.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 3521 | How Many Paths? | dfs and similar dp graphs trees | Statement | G | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 895 | Jumping Around | data structures divide and conquer dp dsu graphs shortest paths trees | Statement | F | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 1043 | Good Graph | data structures dsu graphs trees | Statement | F | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 2700 | |
| 15973 | Mocha and Diana (Easy Version) | brute force constructive algorithms dsu graphs greedy trees | Statement | D1 | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1500.0 | Tutorial (en) | 1400 |
| 3048 | Mocha and Diana (Hard Version) | brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers | Statement | D2 | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1500.0 | Tutorial (en) | 2500 |
| 4440 | Buds Re-hanging | dfs and similar graphs greedy trees | Statement | E | Codeforces Global Round 16 {1566} | PROGRAMMING | 2000.0 | Codeforces Global Round 16 Editorial | |
| 302 | Poachers | dp games graphs trees | Statement | G | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 3500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 9105 | Bakry and Partitioning | bitmasks constructive algorithms dfs and similar dp graphs trees | Statement | C | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1500.0 | 95583 | |
| 3243 | Treelabeling | bitmasks constructive algorithms dfs and similar games graphs greedy trees | Statement | D | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2000.0 | tutorial | 2100 |
| 8370 | Social Network | dsu graphs greedy implementation trees | Statement | D | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 2000.0 | Deltix Round, Autumn 2021. Editorial | 1600 |
| 2129 | X(or)-mas Tree | 2-sat bitmasks dfs and similar graphs trees | Statement | D | Codeforces Global Round 18 {1615} | PROGRAMMING | 2250.0 | Global Round 18 Editorial | |
| 1008 | Christmas Chocolates | dfs and similar dp games graphs implementation math number theory shortest paths trees | Statement | E | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 1148 | Cats on the Upgrade (easy version) | data structures dfs and similar divide and conquer dp graphs trees | Statement | E1 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 659 | Cats on the Upgrade (hard version) | data structures dfs and similar graphs trees | Statement | E2 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 504 | Air Reform | data structures dfs and similar divide and conquer dsu graphs implementation trees | Statement | E | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2500.0 | Codeforces Round #775 Editorial | |
| 454 | Snowy Mountain | data structures graphs greedy shortest paths trees | Statement | G | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2900 |
| 14743 | Vertical Paths | graphs implementation trees | Statement | D | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 23784 | White-Black Balanced Subtrees | dfs and similar dp graphs trees | Statement | G | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 1127 | Tree Recovery | bitmasks brute force constructive algorithms dfs and similar dsu graphs trees | Statement | F | Codeforces Global Round 21 {1696} | PROGRAMMING | 2500.0 | Editorial of Codeforces Global Round 21 | |
| 1893 | DFS Trees | data structures dfs and similar dsu graphs greedy trees | Statement | C | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1250.0 | 104930 | |
| 4145 | Edge Split | brute force constructive algorithms dfs and similar graphs probabilities trees | Statement | D | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 2000.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 3740 | Permutation Addicts | constructive algorithms dfs and similar dsu graphs trees | Statement | D | Codeforces Global Round 22 {1738} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 1373 | Connectivity Addicts | constructive algorithms dsu graphs greedy interactive shortest paths sortings trees | Statement | F | Codeforces Global Round 22 {1738} | PROGRAMMING | 2750.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 6216 | Reset K Edges | binary search data structures dfs and similar graphs greedy trees | Statement | D | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 18260 | Masha and a Beautiful Tree | dfs and similar divide and conquer graphs sortings trees | Statement | D | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 10240 | SlavicG's Favorite Problem | bitmasks brute force constructive algorithms data structures dfs and similar graphs greedy | Statement | G | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 1249 | Algebra Flash | bitmasks brute force dp graphs meet-in-the-middle trees | Statement | E | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 862 | Maximizing Root | dfs and similar dp graphs math trees | Statement | F | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 2750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 1146 | XOR, Tree, and Queries | constructive algorithms dfs and similar dsu graphs trees | Statement | F | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 3000.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 3983 | Timofey and Black-White Tree | brute force dfs and similar divide and conquer graphs greedy math shortest paths trees | Statement | F | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 1902 | There Should Be a Lot of Maximums | data structures dfs and similar dsu graphs trees | Statement | E | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 3896 | Monsters | brute force data structures dfs and similar dsu graphs implementation trees | Statement | E | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 3593 | Sum Graph | constructive algorithms graphs implementation interactive math shortest paths trees | Statement | B | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #865 | 2000 |
| 5074 | Fish Graph | brute force constructive algorithms dfs and similar graphs trees | Statement | B | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 1000.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 7599 | Gardening Friends | brute force dfs and similar dp graphs trees | Statement | F | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 1283 | Random Walk | dp graphs math probabilities trees | Statement | F | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2500.0 | 115465 | |
| 20182 | Copil Copac Draws Trees | dfs and similar dp graphs trees | Statement | A | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 500.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 4018 | Vlad and the Mountains | data structures dsu graphs implementation sortings trees two pointers | Statement | G | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 519 | Teleportation in Byteland | data structures divide and conquer graphs shortest paths trees | Statement | F | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 3000.0 | Video solutions from Geothermal. | |
| 373 | Flower-like Pseudotree | constructive algorithms graphs implementation trees | Statement | D | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 1750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 121 | Standard Graph Problem | data structures graphs greedy trees | Statement | H | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 4000.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 2712 | Autosynthesis | 2-sat constructive algorithms dfs and similar dp flows graphs trees | Statement | C | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 1250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 1565 | Interactive Game with Coloring | brute force constructive algorithms graphs implementation interactive math trees | Statement | E | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 2400 | |
| 9504 | Minimum Maximum Distance | dfs and similar dp graphs shortest paths trees | Statement | F | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 900 | Game of Stacks | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 2000.0 | Codeforces Round 906 Editorial | |
| 150 | Doremy's Swapping Trees | dfs and similar graphs trees | Statement | E | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 3500.0 | Codeforces Round 906 Editorial | |
| 9487 | Alex's whims | constructive algorithms graphs shortest paths trees | Statement | F | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 1972 | Compressed Tree | dfs and similar dp graphs greedy trees | Statement | E | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 495 | Beautiful Tree | data structures dfs and similar graphs trees | Statement | F | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 3500.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 1095 | Caterpillar on a Tree | binary search dfs and similar graphs greedy implementation trees | Statement | F | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 3000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 641 | Smooth Sailing (Hard Version) | binary search data structures dsu graphs trees | Statement | F2 | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 4506 | Vlad and Trouble at MIT | dfs and similar dp flows graphs greedy implementation trees | Statement | G | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 5360 | Microcycle | data structures dfs and similar dsu graphs greedy trees | Statement | F | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 2065 | Sasha and the Happy Tree Cutting | bitmasks brute force dp fft graphs greedy trees | Statement | E | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 2500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 304 | Evidence Board | *special constructive algorithms dfs and similar graphs trees | Statement | B | XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {1939} | PROGRAMMING | |||
| 43 | Burenka and Pether | *special data structures dfs and similar divide and conquer dsu graphs sortings trees | Statement | C | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 533 | Amanda the Amoeba | graphs implementation trees two pointers | Statement | J | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 103 | Growing Trees | constructive algorithms flows graphs greedy | Statement | I | Codeforces Global Round 25 {1951} | PROGRAMMING | 4000.0 | Codeforces Global Round 25 Editorial | |
| 50 | Equal Trees | *special graphs meet-in-the-middle | Statement | I | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 3100 | |
| 867 | Min-Fund Prison (Medium) | brute force dfs and similar dp graphs trees | Statement | G2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2200 | |
| 538 | Min-Fund Prison (Hard) | bitmasks dfs and similar dp graphs trees | Statement | G3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2400 | |
| 1689 | Yasya and the Mysterious Tree | bitmasks data structures dfs and similar graphs strings trees | Statement | G | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 1214 | Turtle and Intersected Segments | data structures dsu graphs greedy | Statement | E | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 2500.0 | Simplified Chinese Tutorial | |
| 23267 | Substring and Subsequence | bitmasks brute force dp graphs greedy hashing strings trees | Statement | B | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 9292 | Iris and Game on the Tree | games graphs greedy trees | Statement | A | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 750.0 | Tutorial | |
| 7392 | Connect the Dots | brute force dfs and similar dp dsu graphs math trees | Statement | D | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 1500.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 1918 | Digital Village (Easy Version) | brute force data structures dp dsu graphs greedy implementation math shortest paths trees | Statement | E1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 1198 | Digital Village (Hard Version) | data structures dp dsu graphs math trees | Statement | E2 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 1047 | Choose Your Queries | dfs and similar dp graphs greedy trees | Statement | F | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 3906 | Cool Graph | constructive algorithms data structures dfs and similar dsu graphs trees | Statement | D | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2250.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 6175 | Genokraken | binary search constructive algorithms data structures graphs interactive trees two pointers | Statement | D | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 1750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 2656 | Control of Randomness | combinatorics dfs and similar graphs greedy math probabilities trees | Statement | E | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2250.0 | Codeforces Round #992 (Div.2) Editorial | |
| 3796 | Medium Demon Problem (hard version) | dfs and similar dp dsu graphs implementation trees | Statement | G2 | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 395 | Managing Cluster | dp graphs math trees | Statement | M | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 4503 | Resourceful Caterpillar Sequence | dfs and similar dp games graphs implementation trees | Statement | E | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 1905 | Another Exercise on Graphs (hard version) | binary search brute force dsu graphs shortest paths sortings trees | Statement | E2 | Hello 2025 {2057} | PROGRAMMING | 2000.0 |