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 3 4 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 980 | Peterson Polyglot | brute force dfs and similar dsu hashing strings trees | Statement | C | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | Codeforces Round #402, Editorial | 2600 | |
| 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 | |
| 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 | |
| 3380 | Paths in a Complete Binary Tree | bitmasks trees | Statement | D | Educational Codeforces Round 18 {792} | PROGRAMMING | Educational Codeforces Round 18 - Editorial | 1800 | |
| 304 | Problem of offices | constructive algorithms dfs and similar dp trees | Statement | E | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 2800 | |
| 3224 | Bank Hacking | constructive algorithms data structures dp trees | Statement | C | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 1900 | |
| 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 | |
| 733 | Send the Fool Further! (medium) | dp trees | Statement | J2 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2100 | |
| 726 | Send the Fool Further! (medium) | dp trees | Statement | K | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 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 | |
| 853 | Surprise me! | divide and conquer math number theory trees | Statement | E | Codeforces Round 415 (Div. 1) {809} | PROGRAMMING | 52099 | 3000 | |
| 1316 | Sagheer and Apple Tree | games trees | Statement | E | Codeforces Round 417 (Div. 2) {812} | PROGRAMMING | [Editorial] Codeforces Round #417 (Div. 2) | 2200 | |
| 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 | |
| 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 | |
| 3282 | Karen and Supermarket | brute force dp trees | Statement | C | Codeforces Round 419 (Div. 1) {815} | PROGRAMMING | Codeforces Round #419 Editorial | 2500 | |
| 3695 | Choosing The Commander | bitmasks data structures trees | Statement | E | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 2100 | |
| 3340 | MEX Queries | binary search data structures trees | Statement | F | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 2400 | |
| 6045 | Okabe and Banana Trees | brute force math | Statement | B | Codeforces Round 420 (Div. 2) {821} | PROGRAMMING | Tutorial | 1300 | |
| 7905 | Okabe and Boxes | data structures greedy trees | Statement | C | Codeforces Round 420 (Div. 2) {821} | PROGRAMMING | Tutorial | 1600 | |
| 373 | Madness | constructive algorithms dfs and similar trees | Statement | F | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | Codeforces Round #422 (Div. 2) Editorial | 2700 | |
| 1465 | Tree Queries | dfs and similar graphs trees | Statement | G | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 2600 | |
| 3686 | High Load | constructive algorithms greedy implementation trees | Statement | B | Codeforces Round 423 (Div. 1, rated, based on VK Cup Finals) {827} | PROGRAMMING | Codeforces Round #423 Analysis | 1800 | |
| 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 | |
| 482 | Red-Black Cobweb | data structures divide and conquer implementation trees | Statement | D | Codeforces Round 426 (Div. 1) {833} | PROGRAMMING | Codeforces Round #426 Editorial | 2800 | |
| 1233 | Roads in the Kingdom | dfs and similar dp graphs trees | Statement | F | Codeforces Round 427 (Div. 2) {835} | PROGRAMMING | Editorial | 2400 | |
| 1066 | Diverging Directions | data structures dfs and similar trees | Statement | B | IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules) {838} | PROGRAMMING | 53736 | 2100 | |
| 20001 | Journey | dfs and similar dp graphs probabilities trees | Statement | C | Codeforces Round 428 (Div. 2) {839} | PROGRAMMING | Codeforces Round #428 editorial | 1500 | |
| 573 | In a Trap | trees | Statement | E | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 3200 | |
| 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 | |
| 1025 | Chemistry in Berland | dfs and similar greedy trees | Statement | E | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 2400 | |
| 346 | Berland SU Computer Network | dfs and similar hashing trees | Statement | L | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2500 | ||
| 731 | Dating | brute force dfs and similar graphs trees | Statement | I | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2500 | |
| 2397 | Helga Hufflepuff's Cup | dp trees | Statement | C | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 2000 | |
| 581 | Rowena Ravenclaw's Diadem | trees | Statement | D | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 2400 | |
| 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 | |
| 1121 | Third Month Insanity | dp probabilities trees | Statement | D | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 2100 | |
| 504 | Arkady and a Nobody-men | data structures dfs and similar trees | Statement | E | Codeforces Round 434 (Div. 1, based on Technocup 2018 Elimination Round 1) {860} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 2600 | |
| 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 | |
| 5456 | Danil and a Part-time Job | bitmasks data structures trees | Statement | E | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 2000 | |
| 1212 | Road Widening | constructive algorithms greedy implementation | Statement | K | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2100 | ||
| 5670 | Petya and Catacombs | dsu greedy implementation trees | Statement | C | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 1300 | |
| 236 | Sloth | dfs and similar dp graph matchings trees | Statement | D | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 3000 | |
| 2488 | Subtree Minimum Query | data structures trees | Statement | F | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 2300 | |
| 1203 | Ralph And His Tour in Binary Country | brute force data structures trees | Statement | D | Codeforces Round 447 (Div. 2) {894} | PROGRAMMING | Codeforces Round #447 (Div.2 Only) Editorial | 2300 | |
| 3057 | Ralph and Mushrooms | dp graphs | Statement | E | Codeforces Round 447 (Div. 2) {894} | PROGRAMMING | Codeforces Round #447 (Div.2 Only) Editorial | 2400 | |
| 5372 | Hashing Trees | constructive algorithms trees | Statement | A | Codeforces Round 453 (Div. 1) {901} | PROGRAMMING | Codeforces Round #453 (Div. 1 & Div. 2) Editorial | 1500 | |
| 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 | |
| 19395 | Christmas Spruce | implementation trees | Statement | B | Hello 2018 {913} | PROGRAMMING | Tutorial | 1200 | |
| 1904 | Palindromes in a Tree | bitmasks data structures divide and conquer trees | Statement | E | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2400 | |
| 277 | Ember and Storm's Tree Game | combinatorics dp games trees | Statement | H | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2900 | |
| 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 | |
| 562 | Jamie and To-do List | data structures interactive trees | Statement | D | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | Codeforces Round #457 (Div. 2) Editorial | 2600 | |
| 2086 | Jamie and Tree | data structures trees | Statement | E | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | Codeforces Round #457 (Div. 2) Editorial | 2600 | |
| 1462 | Stranger Trees | dp math matrices trees | Statement | D | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 2600 | |
| 185 | Upside Down | data structures string suffix structures strings trees | Statement | E | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 3000 | |
| 2455 | Birds | dp | Statement | E | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 2300 | |
| 4709 | Perfect Security | data structures greedy strings trees | Statement | C | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 1900 | |
| 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 | |
| 540 | May Holidays | data structures trees | Statement | E | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 2900 | |
| 831 | Autocompletion | *special strings trees | Statement | D | VK Cup 2018 - Квалификация 1 {928} | PROGRAMMING | 2400 | ||
| 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 | |
| 1966 | Tree | binary search dp trees | Statement | D | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 2200 | |
| 977 | Fafa and Ancient Mathematics | dfs and similar dp trees | Statement | E | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 2500 | |
| 252 | Iqea | data structures dfs and similar divide and conquer dsu shortest paths trees | Statement | E | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 3300 | |
| 1960 | Heaps | dp trees | Statement | F | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 2800 | |
| 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 | |
| 6203 | Mahmoud and Ehab and the wrong algorithm | constructive algorithms trees | Statement | C | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 1500 | |
| 1944 | Full Binary Tree Queries | brute force implementation trees | Statement | D | 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 | 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 | |
| 347 | Santa's Gift | data structures trees | Statement | H | 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 | 3000 | |
| 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 | |
| 207 | Visible Black Areas | data structures dsu geometry trees | Statement | G | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2900 | |
| 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 | |
| 1872 | Short Code | data structures dp greedy strings trees | Statement | E | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 2500 | |
| 7320 | Kuro and Walking Route | dfs and similar trees | Statement | C | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | Codeforces Round #482 (Div. 2) Editorial | 1600 | |
| 2171 | Kuro and GCD and XOR and SUM | binary search bitmasks brute force data structures dp dsu greedy math number theory strings trees | Statement | D | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | 1750.0 | Codeforces Round #482 (Div. 2) Editorial | 2200 |
| 2113 | The Number Games | data structures greedy trees | Statement | E | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2300 | |
| 215 | Cactus to Tree | dp graphs trees | Statement | F | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2900 | |
| 6841 | Useful Decomposition | implementation trees | Statement | C | Avito Code Challenge 2018 {981} | PROGRAMMING | 59713 | 1400 | |
| 15741 | Cut 'em all! | dfs and similar dp graphs greedy trees | Statement | C | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1500 | |
| 2510 | Shark | brute force data structures dsu trees | Statement | D | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1900 | |
| 1188 | NN country | binary search data structures trees | Statement | E | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 2700 | |
| 893 | Prince's Problem | brute force data structures math number theory trees | Statement | E | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 2900 | |
| 2295 | GCD Counting | divide and conquer dp dsu number theory trees | Statement | G | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2400 | |
| 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 | |
| 1603 | Cowmpany Cowmpensation | combinatorics dp math trees | Statement | F | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2700 | |
| 514 | Cycles in product | combinatorics divide and conquer trees | Statement | D | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 2800 | |
| 14382 | Cutting | dp greedy sortings | Statement | B | Codeforces Round 493 (Div. 2) {998} | PROGRAMMING | Codeforces Round #493 — Editorial | 1200 | |
| 6460 | We Need More Bosses | dfs and similar graphs trees | Statement | E | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2100 | |
| 711 | Two-Paths | data structures dp trees | Statement | G | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2800 | |
| 1232 | Sonya and Ice Cream | binary search data structures dp greedy shortest paths trees | Statement | E | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2400 | |
| 11569 | Military Problem | dfs and similar graphs trees | Statement | E | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1600 | |
| 321 | Ants | 2-sat data structures trees | Statement | D | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 3200 | |
| 7683 | Dominant Indices | data structures dsu trees | Statement | F | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2300 | |
| 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 | |
| 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 | |
| 406 | Raining season | data structures divide and conquer trees | Statement | E | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 3200 | |
| 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 | |
| 188 | Pisces | data structures flows trees | Statement | G | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 3300 | |
| 4113 | Recovering BST | brute force dp math number theory trees | Statement | D | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 2000 | |
| 1138 | Vasya and Maximum Matching | dp trees | Statement | F | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 2600 | |
| 992 | Region Separation | combinatorics dp number theory trees | Statement | C | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 2900 | |
| 18975 | Valid BFS? | dfs and similar graphs shortest paths trees | Statement | D | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1700 | |
| 2296 | You Are Given a Tree | data structures dp trees | Statement | D | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2700 | |
| 1466 | Leaf Sets | data structures dfs and similar dsu graphs greedy sortings trees | Statement | F | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2400 | |
| 1706 | Intersecting Subtrees | dfs and similar interactive trees | Statement | B | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 1900 | |
| 827 | Hyperspace Highways | dfs and similar graphs trees | Statement | C | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | Tutorial (PDF) | 2500 | |
| 856 | Interstellar battle | math probabilities trees | Statement | D | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | Tutorial (PDF) | 2600 | |
| 574 | Last chance | data structures flows graph matchings trees | Statement | A | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 2800 | |
| 210 | Moonwalk challenge | data structures strings trees | Statement | J | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 3000 | |
| 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 | |
| 237 | Euler tour | constructive algorithms trees | Statement | E | Codeforces Round 512 (Div. 1, based on Technocup 2019 Elimination Round 1) {1053} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 3500 | |
| 604 | Tree and XOR | strings trees | Statement | F | Mail.Ru Cup 2018 Round 2 {1055} | PROGRAMMING | Mail.Ru Cup 2018 Round 2 — analysis | 2800 | |
| 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 | |
| 7435 | Bmail Computer Network | *special dfs and similar trees | Statement | A | Mail.Ru Cup 2018 - Practice Round {1057} | PROGRAMMING | 1700 | ||
| 1619 | Split the Tree | binary search data structures dp greedy trees | Statement | E | Codeforces Round 514 (Div. 2) {1059} | PROGRAMMING | Codeforces Round #514 (Div. 2) Editorial | 2400 | |
| 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 | |
| 2049 | Company | binary search data structures dfs and similar greedy trees | Statement | E | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 2300 | |
| 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 | |
| 552 | Random Forest Rank | dp graph matchings math trees | Statement | E | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 592 | Choosing Two Paths | dfs and similar dp greedy trees | Statement | F | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2800 | |
| 4138 | Vasya and a Tree | data structures trees | Statement | E | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1900 | |
| 532 | Speed Dial | dp strings trees | Statement | F | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2900 | |
| 6239 | The Fair Nut and the Best Path | data structures dp trees | Statement | A | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 1800 | |
| 1110 | Max Mex | data structures trees | Statement | C | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 2800 | |
| 5642 | Connect Three | implementation math | Statement | C | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 1600 | |
| 5905 | Minimum Diameter Tree | constructive algorithms implementation trees | Statement | D | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 1700 | |
| 314 | Forest Fires | math | Statement | F | Codeforces Round 528 (Div. 1, based on Technocup 2019 Elimination Round 4) {1086} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 3400 | |
| 1614 | Ehab and a component choosing problem | dp greedy math trees | Statement | E | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 2400 | |
| 592 | Ehab and a weird weight formula | data structures trees | Statement | F | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 3000 | |
| 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 | |
| 1978 | Minimal Diameter Forest | constructive algorithms dfs and similar greedy trees | Statement | E | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2500 | |
| 1052 | Vladislav and a Great Legend | combinatorics dp trees | Statement | G | Hello 2019 {1097} | PROGRAMMING | 64310 | 2900 | |
| 9534 | Sum in the tree | constructive algorithms dfs and similar greedy trees | Statement | A | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 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 | |
| 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 | |
| 1499 | Sasha and Interesting Fact from Graph Theory | brute force combinatorics dp math trees | Statement | D | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2600 | |
| 364 | Sasha and Algorithm of Silence's Sounds | data structures trees | Statement | F | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 3200 | |
| 2038 | Nearest Leaf | data structures trees | Statement | F | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 2600 | |
| 740 | Tree-Tac-Toe | constructive algorithms games trees | Statement | G | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 3000 | |
| 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 | |
| 6682 | Tree Cutting (Easy Version) | dfs and similar trees | Statement | F1 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1800 | |
| 630 | Tree Cutting (Hard Version) | combinatorics dfs and similar dp trees | Statement | F2 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 2700 | |
| 875 | Niyaz and Small Degrees | data structures dp trees | Statement | F | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 2900 | |
| 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 | |
| 565 | Legendary Tree | binary search interactive trees | Statement | E | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 3000 | |
| 1226 | Greedy Subsequences | data structures dp trees | Statement | G | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2600 | |
| 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 | |
| 523 | Matches Are Not a Child's Play | data structures trees | Statement | F | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 3300 | |
| 16570 | Edgy Trees | dfs and similar dsu graphs math trees | Statement | C | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 1500 | |
| 610 | Double Tree | data structures divide and conquer shortest paths trees | Statement | G | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2900 | |
| 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 | |
| 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 | |
| 17540 | Queen | dfs and similar trees | Statement | C | Codeforces Round 549 (Div. 2) {1143} | PROGRAMMING | Codeforces Round #549 Editorial | 1400 | |
| 1337 | Leaf Partition | dp trees | Statement | F | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2400 | |
| 1667 | Tree Generator™ | data structures implementation trees | Statement | C | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 2900 | |
| 2577 | Neko and Aki's Prank | dp greedy trees | Statement | D | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2000 | |
| 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 | |
| 193 | Strange device | binary search interactive math trees | Statement | E | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 3300 | |
| 435 | Anagram Paths | dp implementation trees | Statement | D | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 2900 | |
| 4403 | Nauuo and Circle | combinatorics dfs and similar dp trees | Statement | B | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2000 | |
| 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 | |
| 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 | |
| 13500 | Cover it! | dfs and similar dsu graphs shortest paths trees | Statement | E | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1700 | |
| 2444 | Serge and Dining Room | binary search data structures graph matchings greedy implementation math trees | Statement | C | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 2400 | |
| 1035 | Fedor Runs for President | data structures dp trees | Statement | D | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 2600 | |
| 2791 | Irrigation | binary search data structures implementation sortings trees two pointers | Statement | D | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 2100 | |
| 1001 | Complete Mirror | constructive algorithms dfs and similar dp hashing implementation trees | Statement | D | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2500 | |
| 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 | |
| 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 | |
| 8925 | Add on a Tree | trees | Statement | A1 | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 1600 | |
| 1296 | Add on a Tree: Revolution | constructive algorithms dfs and similar implementation trees | Statement | A2 | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 2500 | |
| 1539 | Dynamic Diameter | *special data structures dfs and similar divide and conquer trees | Statement | B | CEOI 2019 day 1 online mirror (unrated, IOI format) {1192} | PROGRAMMING | E | ||
| 507 | Magic Tree | *special data structures dp trees | Statement | B | CEOI 2019 day 2 online mirror (unrated, IOI format) {1193} | PROGRAMMING | T | ||
| 762 | Almost All | constructive algorithms trees | Statement | D | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 2800 | |
| 1216 | Indie Album | data structures dfs and similar hashing string suffix structures strings trees | Statement | G | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 2600 | |
| 188 | Red Blue Tree | data structures implementation trees | Statement | H | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 3500 | |
| 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 | |
| 3588 | Kamil and Making a Stream | math number theory trees | Statement | C | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2100 | |
| 83 | King's Path | *special math trees | Statement | G | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2500 | |
| 57 | Road Repair in Treeland | *special binary search dp trees | Statement | H | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 3000 | |
| 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 | |
| 458 | Tiles Placement | constructive algorithms dfs and similar trees | Statement | H | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2700 | |
| 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 | |
| 845 | Gardener Alex | binary search data structures | Statement | F | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 2600 | |
| 2887 | Paint the Tree | dp sortings trees | Statement | E | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2200 | |
| 276 | Wooden Raft | binary search math number theory | Statement | G | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 3100 | |
| 990 | Tree Factory | constructive algorithms greedy trees | Statement | F | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 2500 | |
| 1639 | Arson In Berland Forest | binary search graphs graphs shortest paths | Statement | E | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2200 | |
| 479 | One Node is Gone | constructive algorithms implementation trees | Statement | F | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 2700 | |
| 1519 | Balanced Binary Search Trees | dp math | Statement | E | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 2400 | |
| 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 | |
| 17992 | Grow The Tree | greedy math sortings | Statement | B | Codeforces Round 594 (Div. 2) {1248} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 900 | |
| 2730 | Maximum Weight Subset | dp trees | Statement | F | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 2500 | |
| 1069 | Regular Forestation | hashing trees | Statement | F | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2500 | |
| 585 | Cleaning Robots | dp trees | Statement | B | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2600 | |
| 410 | Find String in a Grid | data structures dp strings trees | Statement | D | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2900 | |
| 2244 | Cheap Robot | binary search dsu graphs shortest paths trees | Statement | F | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 2600 | |
| 1524 | Tree Queries | data structures probabilities trees | Statement | D | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2600 | |
| 361 | Send Tree to Charlie | combinatorics dfs and similar dsu trees | Statement | E | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 3200 | |
| 631 | Colored Tree | data structures trees | Statement | F | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 2700 | |
| 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 | |
| 671 | Tree Elimination | dp trees | Statement | D | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 2600 | |
| 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 | |
| 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 | |
| 3038 | Jeremy Bearimy | dfs and similar graphs greedy trees | Statement | C | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2000 | |
| 1228 | Miss Punyverse | dp greedy trees | Statement | D | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2700 | |
| 9405 | Christmas Trees | graphs greedy shortest paths | Statement | D | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1800 | |
| 2034 | DIY Garland | constructive algorithms greedy trees | Statement | F | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 2400 | |
| 412 | New Year and Social Network | data structures graph matchings graphs math trees | Statement | F | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 3100 | |
| 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 | |
| 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 | |
| 668 | Cartesian Tree | data structures | Statement | E | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 3000.0 | Codeforces Round #616 Editorial | 3200 |
| 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 |
| 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 |
| 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 | |
| 3086 | Berland Beauty | constructive algorithms dfs and similar greedy sortings trees | Statement | F | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 2400 | |
| 218 | Modernization of Treeland | *special dfs and similar trees | Statement | E | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 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 |
| 1005 | Sum of Prefix Sums | data structures divide and conquer geometry trees | Statement | G | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 2700 | |
| 5864 | 1-Trees and Queries | data structures dfs and similar shortest paths trees | Statement | E | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 2000.0 | Codeforces Round #620 (Div. 2) Editorial | 2000 |
| 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 |
| 675 | Cow and Vacation | dfs and similar dsu trees | Statement | F | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 3000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 3200 |
| 2711 | Construct the Binary Tree | brute force constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 2400 |