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 | |
| 3079 | Ring Road 2 | 2-sat dfs and similar dsu graphs | Statement | D | Codeforces Beta Round 27 (Codeforces format, Div. 2) {27} | PROGRAMMING | Solution of ABC @ Round#27 | 2300 | |
| 1226 | Chocolate | dfs and similar implementation | Statement | D | Codeforces Beta Round 31 (Div. 2, Codeforces format) {31} | PROGRAMMING | 2000 | ||
| 811 | Caterpillar | dfs and similar dp graphs trees | Statement | F | Codeforces Beta Round 48 {51} | PROGRAMMING | 2600 | ||
| 853 | Sweets Game | bitmasks dfs and similar dp games implementation | Statement | E | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | Разбор задач Codeforces Round #59 (Div. 2) | 2200 | |
| 1169 | 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 | |
| 398 | Pairs | dfs and similar dp dsu graphs implementation trees | Statement | E | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 2600 | ||
| 870 | General Mobilization | data structures dfs and similar sortings | Statement | C | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 1900 | |
| 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 | |
| 802 | Maze | dfs and similar dp probabilities trees | Statement | E | Codeforces Beta Round 92 (Div. 1 Only) {123} | PROGRAMMING | Codeforces Beta Round #92 - Analysis | 2600 | |
| 19042 | Distance in Tree | dfs and similar dp trees | Statement | D | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 1800 | |
| 2164 | 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 | |
| 9316 | Compatible Numbers | bitmasks brute force dfs and similar dp | Statement | E | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 2100 | |
| 1490 | Solitaire | dfs and similar dp | Statement | B | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1800 | |
| 2188 | IT Restaurants | dfs and similar dp trees | Statement | E | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 1800 | ||
| 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 | |
| 1362 | World Eater Brothers | dfs and similar dp greedy trees | Statement | C | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2200 | |
| 4470 | Blood Cousins Return | binary search data structures dfs and similar dp sortings | Statement | E | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | Codeforces Round #151 (Div. 2) Tutorial | 2300 | |
| 205 | Tree and Table | dfs and similar dp implementation trees | Statement | E | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 3000 | |
| 5559 | Zero Tree | dfs and similar dp greedy trees | Statement | B | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 2000 | |
| 3926 | Cow Program | dfs and similar dp graphs | Statement | B | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Editorial for Codeforces #174 | 1900 | |
| 2762 | Connected Components | data structures dfs and similar dp dsu | Statement | D | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | Чемпионат КРОК 2013 — Раунд 1 (Разбор задач) | 1900 | |
| 1776 | EKG | dfs and similar dp | Statement | B2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1600 | |
| 6878 | 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 | |
| 8750 | Xenia and Weights | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | C | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 1700 | |
| 565 | Xenia and Dominoes | bitmasks dfs and similar dp | Statement | D | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 2500 | |
| 511 | Pilgrims | dfs and similar dp trees | Statement | E | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2800 | |
| 910 | Lucky Number Representation | constructive algorithms dfs and similar dp | Statement | E | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2200 | |
| 1283 | Valera and Fools | dfs and similar dp graphs shortest paths | Statement | D | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 2300 | |
| 3005 | Inna and Dima | dfs and similar dp graphs implementation | Statement | C | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2000 | |
| 1263 | Hill Climbing | dfs and similar geometry trees | Statement | D | Codeforces Round 238 (Div. 1) {406} | PROGRAMMING | Codeforces Round #238 Tutorial | 2200 | |
| 149 | Colored Jenga | dfs and similar dp probabilities | Statement | E | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 2500 | |
| 6814 | 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 | |
| 6447 | Civilization | dfs and similar dp dsu ternary search trees | Statement | C | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2200 | |
| 6975 | Appleman and Tree | dfs and similar dp trees | Statement | B | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2200 | |
| 7273 | Gargari and Permutations | dfs and similar dp graphs implementation | Statement | D | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 2000 | |
| 2023 | Fedor and Essay | dfs and similar dp graphs hashing strings | Statement | D | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | 2100 | ||
| 4375 | Valid Sets | dfs and similar dp math trees | Statement | D | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | Codeforces Round #277(Div. 2) Editorial | 2300 | |
| 56516 | BerSU Ball | dfs and similar dp graph matchings greedy sortings two pointers | Statement | B | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 1300 | |
| 1906 | 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 | |
| 667 | Birthday | data structures dfs and similar dp trees | Statement | D | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 15148 | 2700 | |
| 14869 | Mr. Kitayuta's Colorful Graph | dfs and similar dp dsu graphs | Statement | B | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 1500 | |
| 7266 | Mr. Kitayuta, the Treasure Hunter | dfs and similar dp two pointers | Statement | C | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 2100 | |
| 3237 | Breaking Good | dfs and similar dp graphs shortest paths | Statement | E | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | 2200 | ||
| 1845 | Inversions problem | brute force dfs and similar dp meet-in-the-middle | Statement | G1 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 1800 | |
| 1521 | Drazil and Morning Exercise | dfs and similar dp dsu trees two pointers | Statement | D | Codeforces Round 292 (Div. 1) {516} | PROGRAMMING | 16468 | 2800 | |
| 8296 | 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 | ||
| 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 | ||
| 1634 | Demiurges Play Again | dfs and similar dp math trees | Statement | E | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 2200 | |
| 537 | Superhero's Job | dfs and similar dp hashing math number theory | Statement | D | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2600 | |
| 1039 | 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 | |
| 2953 | Super M | dfs and similar dp graphs trees | Statement | D | Codeforces Round 328 (Div. 2) {592} | PROGRAMMING | Codeforces Round #328 Problem Analysis | 2200 | |
| 424 | Wilbur and Strings | dfs and similar dp graphs strings | Statement | E | Codeforces Round 331 (Div. 2) {596} | PROGRAMMING | Codeforces Round #331 Editorial | 2900 | |
| 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 | |
| 1876 | 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 | |
| 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 | |
| 1148 | 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 | |
| 1372 | The Chocolate Spree | dfs and similar dp graphs trees | Statement | F | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2500 | |
| 2172 | Table Compression | dfs and similar dp dsu graphs greedy | Statement | C | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | Codeforces Round #345: editorial | 2300 | |
| 5320 | Bear and Compressing | brute force dfs and similar dp strings | Statement | B | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 1300 | |
| 1654 | Graph Coloring | dfs and similar graphs | Statement | B | CROC 2016 - Final Round [Private, For Onsite Finalists Only] {662} | PROGRAMMING | Editorial for CROC 2016 Finals and Codeforces Round #347 | 2300 | |
| 8066 | Alyona and the Tree | dfs and similar dp graphs trees | Statement | C | Codeforces Round 358 (Div. 2) {682} | PROGRAMMING | 45491 | 1700 | |
| 5314 | Kay and Snowflake | data structures dfs and similar dp trees | Statement | B | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | Codeforces Round #359 Editorial | 2000 | |
| 16448 | NP-Hard Problem | dfs and similar graphs | Statement | A | Codeforces Round 360 (Div. 1) {687} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 1500 | |
| 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 | |
| 5762 | Generate a String | dfs and similar dp | Statement | E | Educational Codeforces Round 16 {710} | PROGRAMMING | Editorial of Educational Codeforces Round 16 | 2100 | |
| 5089 | 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 | |
| 5895 | Arpa's weak amphitheater and Mehrdad's valuable Hoses | dfs and similar dp dsu | Statement | B | Codeforces Round 383 (Div. 1) {741} | PROGRAMMING | Codeforces Round #383 editorial | 1700 | |
| 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 | |
| 3165 | New Year and Fireworks | brute force data structures dfs and similar dp implementation | Statement | D | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 1900 | |
| 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 | |
| 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 | |
| 1336 | 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 | |
| 3891 | Mahmoud and a Dictionary | data structures dfs and similar dp dsu graphs | Statement | D | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 2000 | |
| 3453 | 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 | |
| 3542 | 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 | |
| 2836 | Berzerk | dfs and similar dp games | Statement | A | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | Codeforces Round #406 Editorial | 2100 | |
| 168 | Rap God | data structures dfs and similar hashing strings trees | Statement | D | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | Codeforces Round #406 Editorial | 3300 | |
| 304 | Problem of offices | constructive algorithms dfs and similar dp trees | Statement | E | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 2800 | |
| 7146 | Police Stations | constructive algorithms dfs and similar dp graphs shortest paths trees | Statement | D | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 2100 | |
| 368 | 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 | |
| 1552 | 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 | |
| 215 | Fake bullions | combinatorics dfs and similar dp graphs number theory | Statement | F | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 3400 | |
| 2576 | 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 | |
| 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 | |
| 2803 | Leha and another game about graph | constructive algorithms data structures dfs and similar dp graphs | Statement | B | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 2100 | |
| 281 | Harry Vs Voldemort | dfs and similar dp graphs trees | Statement | G | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 3000 | |
| 278 | The Overdosing Ubiquity | brute force dfs and similar graphs | Statement | D | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | Tutorial | 2800 | |
| 236 | Sloth | dfs and similar dp graph matchings trees | Statement | D | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 3000 | |
| 2446 | Coprocessor | dfs and similar dp graphs greedy | Statement | E | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 2100 | |
| 13949 | The Way to Home | dfs and similar dp greedy implementation | Statement | A | Testing Round 14 (Unrated) {910} | PROGRAMMING | 1100 | ||
| 3984 | MADMAX | dfs and similar dp games graphs | Statement | B | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 1800 | |
| 12184 | Substring | dfs and similar dp graphs | Statement | D | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 1700 | |
| 977 | Fafa and Ancient Mathematics | dfs and similar dp trees | Statement | E | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 2500 | |
| 3407 | Sleepy Game | dfs and similar dp games graphs | Statement | B | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 2100 | |
| 2264 | 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 | |
| 2994 | 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 | |
| 15741 | Cut 'em all! | dfs and similar dp graphs greedy trees | Statement | C | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1500 | |
| 1055 | 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 | |
| 6460 | We Need More Bosses | dfs and similar graphs trees | Statement | E | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2100 | |
| 1024 | Road Projects | dfs and similar dp trees | Statement | F | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2600 | |
| 787 | Hidden Bipartite Graph | binary search constructive algorithms dfs and similar graphs interactive | Statement | E | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 2700 | |
| 18975 | Valid BFS? | dfs and similar graphs shortest paths trees | Statement | D | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1700 | |
| 1094 | Maximum Matching | bitmasks brute force dfs and similar dp graphs | Statement | E | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2400 | |
| 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 | |
| 3491 | 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 | |
| 1444 | Three Pieces | dfs and similar dp shortest paths | Statement | D | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 2200 | |
| 1324 | 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 | |
| 592 | Choosing Two Paths | dfs and similar dp greedy trees | Statement | F | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2800 | |
| 10716 | 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 | |
| 1033 | Cookies | binary search data structures dfs and similar dp games trees | Statement | F | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 2300 | |
| 5406 | 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 | |
| 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 | |
| 630 | Tree Cutting (Hard Version) | combinatorics dfs and similar dp trees | Statement | F2 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 2700 | |
| 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 | |
| 9395 | Connect | brute force dfs and similar dsu | Statement | C | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) {1130} | PROGRAMMING | 65520 | 1400 | |
| 3617 | Gourmet choice | dfs and similar dp dsu graphs greedy | Statement | D | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2000 | |
| 1957 | Knapsack | dfs and similar dp greedy | Statement | E | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2400 | |
| 16570 | Edgy Trees | dfs and similar dsu graphs math trees | Statement | C | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 1500 | |
| 3718 | Lynyrd Skynyrd | data structures dfs and similar dp math trees | Statement | B | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2300 | |
| 5521 | Serval and Rooted Tree | binary search dfs and similar dp greedy trees | Statement | D | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1800 | |
| 4642 | 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 | |
| 4403 | Nauuo and Circle | combinatorics dfs and similar dp trees | Statement | B | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2000 | |
| 4517 | 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 | |
| 2279 | Short Colorful Strip | combinatorics dfs and similar dp | Statement | F1 | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 2200 | |
| 1001 | Complete Mirror | constructive algorithms dfs and similar dp hashing implementation trees | Statement | D | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2500 | |
| 11193 | Tree Painting | dfs and similar dp trees | Statement | E | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2000 | |
| 1162 | Graph Traveler | brute force data structures dfs and similar dp graphs implementation math number theory | Statement | F | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2500 | |
| 3289 | Bits And Pieces | bitmasks dfs and similar dp greedy | Statement | F | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2600 | |
| 7163 | Treasure Island | dfs and similar dp flows hashing | Statement | D | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1800 | |
| 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 | |
| 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 | |
| 1943 | Sum Balance | bitmasks dfs and similar dp graphs | Statement | C | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 2400 | |
| 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 | |
| 2041 | 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 | |
| 8588 | 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 | |
| 2250 | 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 |
| 6810 | 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 | |
| 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 |
| 1080 | Autocompletion | data structures dfs and similar dp | Statement | G | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 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 | ||
| 1127 | Independent Set | dfs and similar dp trees | Statement | F | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 2250.0 | Codeforces Round #630 Editorial | 2500 |
| 24558 | 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 |
| 1123 | Nested Rubber Bands | dfs and similar dp trees | Statement | D | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 2000.0 | Editorial | |
| 1976 | Quantifier Question | dfs and similar dp graphs math | Statement | C | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1500.0 | Codeforces Round #639 Editorial | 2600 |
| 3675 | Graph Coloring | dfs and similar dp graphs | Statement | E | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2100 | |
| 7484 | Tree Shuffling | dfs and similar dp dsu greedy trees | Statement | E | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2250.0 | 78202 | 2000 |
| 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 |
| 715 | BareLee | dfs and similar dp games | Statement | F | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 3000.0 | Codeforces Round #652 (Div. 2) Editorial | 2700 |
| 821 | 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 |
| 896 | Graph | *special dfs and similar dp math | Statement | A | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | T | ||
| 10402 | 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 |
| 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 | ||
| 674 | Omkar and Pies | bitmasks dfs and similar dp math | Statement | G | Codeforces Global Round 10 {1392} | PROGRAMMING | 3000.0 | Codeforces Global Round 10 — 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 | ||
| 8159 | Tree Tag | dfs and similar dp games trees | Statement | B | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 1000.0 | Codeforces Round #668 Editorial | |
| 1885 | Egor in the Republic of Dagestan | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | E | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2500.0 | Codeforces Round #669 Editorial | |
| 166 | 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 | |
| 2216 | 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 | |
| 5611 | Moving to the Capital | dfs and similar dp graphs shortest paths | Statement | G | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 7785 | Strange Beauty | dfs and similar dp math number theory | Statement | G | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 9221 | Journey | dfs and similar dp dsu implementation two pointers | Statement | D | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 1053 | Christmas Game | data structures dfs and similar dp games math trees | Statement | F | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 3000.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 2501 | Bananas in a Microwave | dfs and similar dp greedy shortest paths | Statement | D | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 2500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 1581 | Diameter Cuts | dfs and similar dp trees | Statement | F | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 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 | |
| 18868 | Parsa's Humongous Tree | brute force dfs and similar dp greedy trees | Statement | A | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 750.0 | Codeforces Round #722 Editorial | |
| 13768 | Little Alawn's Puzzle | combinatorics dfs and similar dp dsu graphs math | Statement | C | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 699 | Falling Sand (Hard Version) | dfs and similar dp graphs greedy | Statement | F2 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1250.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 | ||
| 16335 | Air Conditioners | dfs and similar dp implementation shortest paths sortings two pointers | Statement | E | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 2167 | Equidistant Vertices | combinatorics dfs and similar dp trees | Statement | F | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 1370 | You | dfs and similar dp math number theory | Statement | E | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #735 (Div. 2) | 2600 |
| 4928 | Nearest Beautiful Number (hard version) | bitmasks brute force constructive algorithms dfs and similar dp greedy | Statement | F2 | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 2100 | |
| 2866 | Divisible by Twenty-Five | brute force dfs and similar dp | Statement | D | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — 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 | |
| 9321 | The Number of Imposters | constructive algorithms dfs and similar dp dsu graphs | Statement | D | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1750.0 | 95525 | 1700 |
| 2489 | Staircases | brute force combinatorics data structures dfs and similar dp | Statement | E | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 25590 | Computer Game | dfs and similar dp implementation | Statement | A | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 7350 | Game Master | data structures dfs and similar dp graphs greedy two pointers | Statement | C | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 702 | Mashtali: a Space Oddysey | constructive algorithms dfs and similar graphs implementation | Statement | F | Codeforces Global Round 17 {1610} | PROGRAMMING | 2750.0 | Codeforces Global Round 17 Editorial | |
| 4309 | Escape The Maze (hard version) | dfs and similar dp greedy shortest paths trees two pointers | Statement | E2 | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 2000 | |
| 424 | Just Add an Edge | dfs and similar dp graphs | Statement | G | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 3500.0 | Good Bye 2021 -- Editorial | 3500 |
| 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) | |
| 2158 | Towers | constructive algorithms dfs and similar dp greedy trees | Statement | F | Codeforces Global Round 19 {1637} | PROGRAMMING | 3250.0 | Tutorial | |
| 4428 | Weight the Tree | constructive algorithms dfs and similar dp implementation trees | Statement | D | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 2000.0 | Codeforces Round #774 (Div. 2) Editorial | 2000 |
| 2918 | Counting Shortcuts | dfs and similar dp graphs shortest paths | Statement | G | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 615 | Sum of Matchings | dfs and similar greedy implementation math | Statement | E | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 800 | Edge Elimination | constructive algorithms dfs and similar dp trees | Statement | D | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 2000.0 | Codeforces Round #783 Editorial | 2900 |
| 1936 | Hemose on the Tree | bitmasks constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2750.0 | Tutorial | 2200 |
| 2891 | Remove Directed Edges | dfs and similar dp graphs | Statement | G | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 6238 | Vlad and Unfinished Business | dfs and similar dp greedy trees | Statement | F | 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 | ||
| 5806 | Toss a Coin to Your Graph... | binary search dfs and similar dp graphs | Statement | D | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 1750.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 895 | Lenient Vertex Cover | data structures dfs and similar divide and conquer dsu graphs | Statement | F | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 10734 | Required Length | brute force dfs and similar dp hashing shortest paths | Statement | D | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 1700 | |
| 2290 | Unique Occurrences | data structures dfs and similar divide and conquer dp dsu trees | Statement | F | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 2300 | |
| 13412 | Infected Tree | constructive algorithms dfs and similar dp greedy trees | Statement | C | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 1130 | K-Set Tree | combinatorics dfs and similar dp math trees | Statement | F | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 2750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 9565 | Fake Plastic Trees | dfs and similar dp greedy trees | Statement | B | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 1000.0 | Codeforces Round #800 Editorial | 1700 |
| 2449 | Tree Queries (Easy Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D1 | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 2284 | Tree Queries (Hard Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D2 | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 1449 | Coloring | brute force combinatorics constructive algorithms dfs and similar dp dsu graphs implementation | Statement | E | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 5737 | Passable Paths (hard version) | bitmasks data structures dfs and similar dp sortings trees | Statement | G2 | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 549 | Anti-Increasing Addicts | constructive algorithms dfs and similar dp greedy | Statement | G | Codeforces Global Round 22 {1738} | PROGRAMMING | 3000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 5029 | Hanging Hearts | constructive algorithms data structures dfs and similar dp greedy trees | Statement | E | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2000.0 | Tutorial | 1800 |
| 5102 | Paths on the Tree | dfs and similar dp greedy sortings trees | Statement | D | Codeforces Global Round 23 {1746} | PROGRAMMING | 1500.0 | Codeforces Global Round 23 Editorial | |
| 14967 | Hamiltonian Wall | dfs and similar dp implementation | Statement | C | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 3205 | Hossam and (sub-)palindromic tree | brute force dfs and similar dp trees | Statement | D | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 2250.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 3947 | Two Chess Pieces | dfs and similar dp greedy trees | Statement | E | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 2000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 4660 | Score of a Tree | bitmasks combinatorics dfs and similar dp probabilities trees | Statement | D | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2000.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 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 | |
| 1371 | Blocking Chips | binary search dfs and similar dp greedy | Statement | F | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 4627 | Li Hua and Tree | brute force data structures dfs and similar dp implementation trees | Statement | D | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1750.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 382 | Tree Cutting | bitmasks dfs and similar dp | Statement | H | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 3500.0 | Codeforces Round #854 Editorial | |
| 8917 | A Wide, Wide Graph | dfs and similar dp dsu greedy trees | Statement | D | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 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 | ||
| 1679 | LuoTianyi and XOR-Tree | data structures dfs and similar dp dsu greedy trees | Statement | C | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 1750.0 | CodeForces Round 872(Div. 1&2) Editorial | 2500 |
| 33229 | Gold Rush | brute force dfs and similar dp implementation | Statement | D | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1000 | |
| 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 | |
| 6364 | Ksyusha and Chinchilla | dfs and similar dp dsu greedy implementation trees | Statement | G | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 2104 | Railguns | dfs and similar dp graphs implementation | Statement | F | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 21586 | Apple Tree | combinatorics dfs and similar dp trees | Statement | D | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 2105 | Omsk Metro (hard version) | data structures dfs and similar divide and conquer dp implementation math trees | Statement | F2 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 6329 | Omsk Metro (simple version) | data structures dfs and similar dp greedy math trees | Statement | F1 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 13247 | Nastya and Potions | dfs and similar dp graphs greedy shortest paths sortings | Statement | E | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 6411 | PermuTree (easy version) | dfs and similar dp trees | Statement | E1 | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 1500.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 3181 | Speedrun | brute force data structures dfs and similar dp graphs sortings | Statement | E | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 1750.0 | ||
| 3420 | Completely Searching for Inversions | dfs and similar dp graphs | Statement | C | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — 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 | |
| 9504 | Minimum Maximum Distance | dfs and similar dp graphs shortest paths trees | Statement | F | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 7063 | Tree XOR | bitmasks dfs and similar dp greedy trees | Statement | D | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 276 | Cacti Symphony | combinatorics dfs and similar dp graphs | Statement | E | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 2750.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 2626 | Transitive Graph | constructive algorithms dfs and similar dp graphs implementation | Statement | E | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 2250.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 14968 | Anji's Binary Tree | dfs and similar dp shortest paths trees | Statement | C | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 1250.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 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 | ||
| 2385 | Light Bulbs (Easy Version) | brute force combinatorics dfs and similar dp dsu graphs math | Statement | G1 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 1805 | Light Bulbs (Hard Version) | combinatorics data structures dfs and similar dp dsu graphs hashing | Statement | G2 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 2632 | Happy Life in University | brute force data structures dfs and similar dp implementation trees | Statement | E | Good Bye 2023 {1916} | PROGRAMMING | 2000.0 | ||
| 5114 | Count Paths | data structures dfs and similar divide and conquer dp dsu trees | Statement | E | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial |