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 5 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1079 | Treeland and Viruses | shortest paths trees | Statement | E | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 2500.0 | Codeforces Round #625 Editorial | |
| 163 | Assigning Fares | dp dp dp trees | Statement | F | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 3000.0 | Codeforces Round #626 Editorial | |
| 13226 | Maximum White Subtree | dfs and similar dp graphs trees | Statement | F | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 17350 | Ehab and Path-etic MEXs | constructive algorithms dfs and similar greedy trees | Statement | C | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 1250.0 | 74235 | 1500 |
| 108 | Spiderweb Trees | dp geometry trees | Statement | G | Codeforces Global Round 7 {1326} | PROGRAMMING | 4000.0 | 74961 | 3600 |
| 11883 | Tree Queries | dfs and similar graphs trees | Statement | E | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 2100 | |
| 1132 | Independent Set | dfs and similar dp trees | Statement | F | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 2250.0 | Codeforces Round #630 Editorial | 2500 |
| 24932 | 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 |
| 279 | Journey | data structures divide and conquer graphs trees | Statement | F | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 3250.0 | Codeforces Round #635 Editorial | 3600 |
| 9575 | Edge Weight Assignment | bitmasks constructive algorithms greedy math trees | Statement | B | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1000.0 | Editorial | |
| 1142 | Nested Rubber Bands | dfs and similar dp trees | Statement | D | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 2000.0 | Editorial | |
| 1073 | Nastya and Time Machine | constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 1750.0 | Codeforces Round #637 Editorial | |
| 523 | Train Tracks | data structures trees | Statement | E | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 2500.0 | Codeforces Round #639 Editorial | 3100 |
| 340 | Johnny and James | greedy implementation math trees | Statement | D | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 2500.0 | Codeforces Round #647 Editorial | 2900 |
| 1002 | James and the Chase | dfs and similar graphs probabilities trees | Statement | E | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 3000.0 | Codeforces Round #647 Editorial | 3000 |
| 21209 | Game On Leaves | games trees | Statement | C | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 1500.0 | 78202 | 1600 |
| 7526 | Tree Shuffling | dfs and similar dp dsu greedy trees | Statement | E | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2250.0 | 78202 | 2000 |
| 4997 | 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 |
| 678 | Shifting Dominoes | data structures geometry graphs trees | Statement | G | Codeforces Global Round 8 {1368} | PROGRAMMING | 3500.0 | Codeforces Global Round 8: editorial | |
| 9248 | TediousLee | dp graphs greedy math matrices trees | Statement | D | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2000.0 | Codeforces Round #652 (Div. 2) Editorial | 1900 |
| 1803 | The Hidden Pair (Easy Version) | binary search dfs and similar graphs interactive shortest paths trees | Statement | F1 | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #651 | |
| 1683 | The Hidden Pair (Hard Version) | binary search dfs and similar graphs interactive shortest paths trees | Statement | F2 | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #651 | |
| 2192 | Tree Modification | dfs and similar greedy trees | Statement | G | Codeforces Global Round 9 {1375} | PROGRAMMING | 2250.0 | 79731 | |
| 474 | Inverse Genealogy | constructive algorithms divide and conquer dp math trees | Statement | E | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 2500.0 | Codeforces Round #657 Editorial | 2400 |
| 2423 | Merging Towers | data structures dsu implementation trees | Statement | E | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 826 | 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 |
| 667 | String Transformation 2 | dp graphs trees | Statement | C | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1750.0 | Codeforces Round #659 Editorial | |
| 11288 | String Transformation 1 | dsu graphs greedy sortings strings trees | Statement | A | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 2831 | Removing Leaves | data structures dfs and similar divide and conquer greedy implementation trees | Statement | F | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2300 | |
| 10425 | 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 |
| 6919 | 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 |
| 496 | Directing Edges | dfs and similar dp graphs greedy trees | Statement | G | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 1937 | Pairs of Pairs | constructive algorithms dfs and similar graphs trees | Statement | E | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 2750.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 1240 | Boboniu and Jianghu | dp greedy sortings trees | Statement | D | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1750.0 | Codeforces Round #664 Editorial | 2800 |
| 435 | Distance Matching | binary search constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 2500.0 | Codeforces Round #666 — Editorial | |
| 2534 | Weights Division (hard version) | binary search data structures dfs and similar greedy trees two pointers | Statement | E2 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 6351 | Weights Division (easy version) | data structures dfs and similar greedy trees | Statement | E1 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 10580 | Maximum Distributed Tree | constructive algorithms dfs and similar greedy math number theory sortings trees | Statement | D | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1750.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 236 | 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 | ||
| 395 | Spring cleaning | *special data structures dfs and similar graphs trees | Statement | B | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 8229 | Tree Tag | dfs and similar dp games trees | Statement | B | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 1000.0 | Codeforces Round #668 Editorial | |
| 11821 | Link Cut Centroids | constructive algorithms dfs and similar graphs trees | Statement | C | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 1500.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 5081 | XOR Inverse | bitmasks data structures divide and conquer greedy strings trees | Statement | C | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 1250.0 | Codeforces Round #673 Editorial | 2000 |
| 2733 | Graph and Queries | data structures dfs and similar dsu graphs trees | Statement | D | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2000.0 | Codeforces Round #673 Editorial | 2600 |
| 1290 | Boring Queries | data structures number theory trees | Statement | F | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 2750.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 214 | Dušan's Railway | graphs trees | Statement | C | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 325 | Milutin's Plums | interactive | Statement | M | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 402 | Boring Card Game | data structures greedy trees | Statement | F | Codeforces Global Round 11 {1427} | PROGRAMMING | 2250.0 | Editorial of Global Round 11 | 3200 |
| 31021 | Districts Connection | constructive algorithms dfs and similar trees | Statement | D | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 6525 | Bandit in a City | binary search dfs and similar greedy trees | Statement | D | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 2000.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 1278 | Death DBMS | data structures hashing string suffix structures strings trees | Statement | G | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 14444 | Minimal Height Tree | graphs greedy shortest paths trees | Statement | D | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 804 | Olha and Igor | interactive trees | Statement | F | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 3000.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 249 | Cheat and Win | bitmasks data structures games trees | Statement | E | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 2500.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 801 | Black, White and Grey Tree | dp trees | Statement | E | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1750.0 | 84298 | |
| 169 | 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 | |
| 4101 | Xor Tree | binary search bitmasks data structures divide and conquer dp trees | Statement | C | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1250.0 | E | |
| 351 | Communism | bitmasks dp trees | Statement | G | Codeforces Global Round 12 {1450} | PROGRAMMING | 3750.0 | Codeforces Global Round 12 Editorial | |
| 2231 | 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 | |
| 6677 | Number of Simple Paths | combinatorics data structures dfs and similar dsu graphs trees | Statement | E | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 13302 | Find the Spruce | brute force dp | Statement | B | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 1000.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 444 | My Beautiful Madness | data structures trees | Statement | F | Codeforces Round 692 (Div. 1, based on Technocup 2021 Elimination Round 3) {1464} | PROGRAMMING | 3000.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 23223 | Bovine Dilemma | brute force math | Statement | A | Good Bye 2020 {1466} | PROGRAMMING | 500.0 | Good Bye 2020 Editorial | |
| 14831 | 13th Labour of Heracles | greedy trees | Statement | D | Good Bye 2020 {1466} | PROGRAMMING | 1000.0 | Good Bye 2020 Editorial | |
| 1775 | Distinctive Roots in a Tree | data structures dfs and similar trees | Statement | E | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 2500.0 | Codeforces Round #695 (Div. 2) Editorial | 2500 |
| 1348 | Odd Mineral Resource | bitmasks data structures hashing probabilities trees | Statement | D | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round #700 | |
| 739 | AB Tree | dp greedy trees | Statement | F | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 3000.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 690 | Exam | trees | Statement | H | Технокубок 2021 - Финал {1482} | PROGRAMMING | 3500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 15 | Exam | trees | Statement | F | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 2500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 1534 | Move and Swap | dp greedy trees | Statement | E | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #701 (Div. 2) | 2500 |
| 812 | Pairs of Paths | combinatorics data structures trees | Statement | F | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 3000.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 21819 | Permutation Transformation | dfs and similar divide and conquer implementation | Statement | D | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 2348 | Fib-tree | brute force divide and conquer trees | Statement | E | Codeforces Global Round 13 {1491} | PROGRAMMING | 1750.0 | Codeforces Global Round 13 Editorial | |
| 2826 | Dogeforces | brute force constructive algorithms divide and conquer dsu greedy implementation trees | Statement | D | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 1541 | BFS Trees | combinatorics dfs and similar graphs math shortest paths trees | Statement | D | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2000.0 | Codeforces Round #706 Editorial | |
| 423 | Squares | constructive algorithms data structures graphs trees | Statement | F | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 3250.0 | Codeforces Round #706 Editorial | |
| 1062 | 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 | |
| 1606 | Diameter Cuts | dfs and similar dp trees | Statement | F | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 33328 | Yet Another Card Deck | brute force data structures implementation trees | Statement | C | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 2085 | Phoenix and Earthquake | constructive algorithms dfs and similar dsu graphs greedy trees | Statement | F | Codeforces Global Round 14 {1515} | PROGRAMMING | 3250.0 | Editorial | |
| 605 | Reunion | dp trees | Statement | F | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 3000.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 907 | Off by One | constructive algorithms dfs and similar geometry graphs sortings trees | Statement | E | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 2315 | 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 | |
| 9195 | Compression and Expansion | brute force data structures greedy implementation trees | Statement | C | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 1500.0 | Deltix Round, Spring 2021. Editorial | 1600 |
| 2292 | MEX Tree | combinatorics constructive algorithms data structures dfs and similar math trees | Statement | D | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 2250.0 | Tutorial | 2400 |
| 19233 | 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 | |
| 601 | Mashtali and Hagh Trees | combinatorics dp trees | Statement | E | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 2750.0 | Codeforces Round #722 Editorial | |
| 2980 | Trees of Tranquillity | data structures dfs and similar greedy trees | Statement | C | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 1750.0 | Codeforces Round #722 Editorial | |
| 6832 | Lost Tree | constructive algorithms interactive trees | Statement | D | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1500.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 264 | Lost Nodes | dp graphs interactive sortings trees | Statement | H | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 3500.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 3078 | Gold Transfer | binary search data structures greedy interactive trees | Statement | E | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 8524 | Playoff Tournament | data structures implementation trees | Statement | D | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 3003 | Tree Array | brute force combinatorics dp math probabilities trees | Statement | B | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 1250.0 | Tutorial | |
| 3562 | How Many Paths? | dfs and similar dp graphs trees | Statement | G | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 902 | Jumping Around | data structures divide and conquer dp dsu graphs shortest paths trees | Statement | F | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 2190 | Equidistant Vertices | combinatorics dfs and similar dp trees | Statement | F | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 855 | XOR and Distance | bitmasks divide and conquer dp trees | Statement | H | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 3750.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 1059 | Good Graph | data structures dsu graphs trees | Statement | F | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 2700 | |
| 16163 | Mocha and Diana (Easy Version) | brute force constructive algorithms dsu graphs greedy trees | Statement | D1 | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1500.0 | Tutorial (en) | 1400 |
| 3081 | Mocha and Diana (Hard Version) | brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers | Statement | D2 | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1500.0 | Tutorial (en) | 2500 |
| 4456 | Buds Re-hanging | dfs and similar graphs greedy trees | Statement | E | Codeforces Global Round 16 {1566} | PROGRAMMING | 2000.0 | Codeforces Global Round 16 Editorial | |
| 1022 | Illusions of the Desert | data structures trees | Statement | I | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 1290 | Mathematics Curriculum | combinatorics dp trees | Statement | B | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 2600 |
| 1112 | Subsequence | divide and conquer dp trees | Statement | D | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 2000.0 | Codeforces Round #745 Editorial | 2900 |
| 13304 | Omkar and Heavenly Tree | constructive algorithms trees | Statement | B | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 1000.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 407 | Omkar and Tours | sortings trees | Statement | H | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 3500.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 1212 | Frequency Queries | data structures dfs and similar trees | Statement | E | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 2500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 310 | Poachers | dp games graphs trees | Statement | G | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 3500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 2636 | Hemose in ICPC ? | binary search dfs and similar divide and conquer interactive math number theory trees | Statement | D | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 2000.0 | 95583 | |
| 9183 | Bakry and Partitioning | bitmasks constructive algorithms dfs and similar dp graphs trees | Statement | C | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1500.0 | 95583 | |
| 14851 | Gardener and Tree | dfs and similar greedy implementation trees | Statement | E | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 1614 | Rubik's Cube Coloring (hard version) | brute force dp implementation math trees | Statement | E2 | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1500.0 | 95525 | 2300 |
| 598 | Phys Ed Online | data structures dp greedy trees | Statement | E | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2900 |
| 3261 | Treelabeling | bitmasks constructive algorithms dfs and similar games graphs greedy trees | Statement | D | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2000.0 | tutorial | 2100 |
| 669 | Tree Queries | binary search data structures dp dsu geometry trees | Statement | F | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 247 | Alphabetic Tree | binary search data structures dfs and similar hashing string suffix structures strings trees | Statement | G | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 8436 | Social Network | dsu graphs greedy implementation trees | Statement | D | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 2000.0 | Deltix Round, Autumn 2021. Editorial | 1600 |
| 629 | Squid Game | data structures dfs and similar divide and conquer greedy trees | Statement | H | Codeforces Global Round 17 {1610} | PROGRAMMING | 3500.0 | Codeforces Global Round 17 Editorial | |
| 347 | Mashtali vs AtCoder | games trees | Statement | I | Codeforces Global Round 17 {1610} | PROGRAMMING | 4000.0 | Codeforces Global Round 17 Editorial | |
| 11635 | Weights Assignment For Tree Edges | constructive algorithms trees | Statement | D | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1500 | |
| 8402 | Escape The Maze (easy version) | dfs and similar greedy shortest paths trees two pointers | Statement | E1 | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1700 | |
| 4321 | 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 | |
| 2139 | X(or)-mas Tree | 2-sat bitmasks dfs and similar graphs trees | Statement | D | Codeforces Global Round 18 {1615} | PROGRAMMING | 2250.0 | Global Round 18 Editorial | |
| 1704 | Purple Crayon | dp games greedy math trees | Statement | E | Codeforces Global Round 18 {1615} | PROGRAMMING | 2750.0 | Global Round 18 Editorial | |
| 1035 | 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) | |
| 9722 | Replace the Numbers | data structures dsu greedy trees | Statement | E | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1268 | Middle Duplication | data structures dfs and similar greedy strings trees | Statement | E | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 2750.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 7664 | MinOr Tree | bitmasks dfs and similar dsu greedy | Statement | G | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 2329 | Binary Spiders | bitmasks data structures implementation sortings trees | Statement | D | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 1155 | 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) | |
| 664 | Cats on the Upgrade (hard version) | data structures dfs and similar graphs trees | Statement | E2 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 1862 | Black and White Tree | dp greedy trees | Statement | E | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 16314 | Not Assigning | constructive algorithms dfs and similar number theory trees | Statement | C | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1250.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 1238 | Groceries in Meteor Town | data structures trees | Statement | E | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 2250.0 | 99276 | |
| 1345 | Distance Tree (easy version) | dfs and similar shortest paths trees | Statement | E1 | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 1204 | Distance Tree (hard version) | dfs and similar shortest paths trees | Statement | E2 | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 379 | Perfect Matching | data structures interactive trees | Statement | F | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 2172 | Towers | constructive algorithms dfs and similar dp greedy trees | Statement | F | Codeforces Global Round 19 {1637} | PROGRAMMING | 3250.0 | Tutorial | |
| 4462 | 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 |
| 1098 | Madoka and the Sixth-graders | dfs and similar greedy trees | Statement | E | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 2500.0 | Codeforces Round #777 Editorial | |
| 516 | Air Reform | data structures dfs and similar divide and conquer dsu graphs implementation trees | Statement | E | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2500.0 | Codeforces Round #775 Editorial | |
| 3070 | Potion Brewing Class | dfs and similar implementation math number theory trees | Statement | D | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2100 |
| 461 | Snowy Mountain | data structures graphs greedy shortest paths trees | Statement | G | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2900 |
| 3881 | Equal Tree Sums | constructive algorithms dfs and similar trees | Statement | E | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 2500.0 | Tutorial | |
| 766 | Words on Tree | 2-sat implementation trees | Statement | F | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 2506 | Star MST | combinatorics dp math | Statement | E | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 251 | Tree and Permutation Game | dfs and similar games trees | Statement | F | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 3000.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 10568 | Water the Trees | binary search greedy math | Statement | C | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 1124 | Narrow Components | data structures dfs and similar dsu trees | Statement | E | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 562 | Gastronomic Event | trees | Statement | G | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 10898 | Who Tested? | trees | Statement | A | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
| 9912 | Tree Infection | binary search dfs and similar greedy trees | Statement | C | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 1250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 1585 | Job Lookup | constructive algorithms dp | Statement | J | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 812 | 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 |
| 816 | Centroid Probabilities | combinatorics dp fft math | Statement | E | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 2750.0 | Codeforces Round #783 Editorial | 3000 |
| 1942 | Hemose on the Tree | bitmasks constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2750.0 | Tutorial | 2200 |
| 3237 | Preorder | combinatorics divide and conquer dp dsu hashing trees | Statement | E | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 6300 | Vlad and Unfinished Business | dfs and similar dp greedy trees | Statement | F | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 14863 | Vertical Paths | graphs implementation trees | Statement | D | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 24425 | 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 | ||
| 2339 | 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 | |
| 3732 | Circular Spanning Tree | constructive algorithms trees | Statement | D | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2000.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 13605 | 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) | |
| 1139 | 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) | |
| 9646 | 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 |
| 2465 | 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 | |
| 2301 | 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 | |
| 6032 | Permutation Graph | binary search constructive algorithms data structures greedy shortest paths trees | Statement | D | Codeforces Global Round 21 {1696} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round 21 | |
| 1144 | Tree Recovery | bitmasks brute force constructive algorithms dfs and similar dsu graphs trees | Statement | F | Codeforces Global Round 21 {1696} | PROGRAMMING | 2500.0 | Editorial of Codeforces Global Round 21 | |
| 12220 | Helping the Nature | constructive algorithms greedy | Statement | C | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1500.0 | 103978 | 1700 |
| 5857 | Passable Paths (hard version) | bitmasks data structures dfs and similar dp sortings trees | Statement | G2 | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 6406 | Passable Paths (easy version) | data structures dfs and similar sortings trees | Statement | G1 | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 3783 | Qpwoeirut and Vertices | binary search data structures dsu trees | Statement | E | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 2250.0 | Codeforces Round #809 Editorial | |
| 894 | Partial Virtual Trees | combinatorics dp math trees | Statement | D | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1750.0 | 104930 | |
| 1924 | DFS Trees | data structures dfs and similar dsu graphs greedy trees | Statement | C | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1250.0 | 104930 | |
| 3998 | XOR Tree | data structures dfs and similar dsu greedy trees | Statement | E | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 560 | Recover the Tree | constructive algorithms trees | Statement | D | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 2000.0 | Codeforces Round #810 Editorial | |
| 445 | Triameter | data structures dfs and similar trees | Statement | F | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 3500.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 9748 | Path Prefixes | binary search data structures dfs and similar implementation trees | Statement | G | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 3693 | Build a Tree and That Is It | brute force constructive algorithms greedy implementation trees | Statement | F | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 420 | Permutation for Burenka | greedy math trees | Statement | D | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 2250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 6724 | Xor-Subsequence (easy version) | bitmasks brute force dp strings trees | Statement | D1 | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1500.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 2220 | Xor-Subsequence (hard version) | bitmasks data structures dp strings trees | Statement | D2 | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1000.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 2562 | Prefix Function Queries | bitmasks brute force data structures hashing string suffix structures strings trees | Statement | E | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 599 | Electrical Efficiency | combinatorics data structures dp number theory trees | Statement | E | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 299 | Imitating the Key Tree | combinatorics dsu trees | Statement | I | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 466 | Journey | dp trees | Statement | J | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 4174 | Edge Split | brute force constructive algorithms dfs and similar graphs probabilities trees | Statement | D | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 2000.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 3763 | Permutation Addicts | constructive algorithms dfs and similar dsu graphs trees | Statement | D | Codeforces Global Round 22 {1738} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 1390 | Connectivity Addicts | constructive algorithms dsu graphs greedy interactive shortest paths sortings trees | Statement | F | Codeforces Global Round 22 {1738} | PROGRAMMING | 2750.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 6289 | Reset K Edges | binary search data structures dfs and similar graphs greedy trees | Statement | D | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 5095 | 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 |
| 321 | MEX Tree Manipulation | data structures trees | Statement | H | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 3000.0 | Tutorial | 3300 |
| 18426 | Masha and a Beautiful Tree | dfs and similar divide and conquer graphs sortings trees | Statement | D | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 5128 | 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 | |
| 2698 | Yet Another Array Counting Problem | data structures divide and conquer dp trees | Statement | E | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 2250.0 | Codeforces Round #833 (Div. 2) Editorial | 2300 |
| 622 | Distance to the Path | data structures dfs and similar trees | Statement | F | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 10435 | SlavicG's Favorite Problem | bitmasks brute force constructive algorithms data structures dfs and similar graphs greedy | Statement | G | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 155 | Centroid Guess | interactive probabilities trees | Statement | G | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 3500.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 853 | Tree Sum | combinatorics trees | Statement | E | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 2500.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 1197 | Doremy's Experimental Tree | brute force constructive algorithms dfs and similar dsu sortings trees | Statement | F | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 1259 | Algebra Flash | bitmasks brute force dp graphs meet-in-the-middle trees | Statement | E | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 434 | Two Subtrees | data structures trees | Statement | F | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 1614 | Koxia and Tree | combinatorics dp math probabilities trees | Statement | E | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 2000.0 | Good Bye 2022 -- Editorial | |
| 1572 | Hossam and Range Minimum Query | binary search bitmasks data structures hashing probabilities strings trees | Statement | F | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 3500.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 3231 | 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 | |
| 978 | BinCoin | divide and conquer hashing implementation probabilities trees | Statement | B | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2200 | ||
| 145 | Jumbled Trees | Statement | J | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2900 | |||
| 615 | Segment Covering | brute force combinatorics constructive algorithms data structures trees | Statement | G | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 3250.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 3989 | 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 | |
| 20433 | Gardener and the Capybaras (easy version) | brute force implementation strings | Statement | A1 | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 19974 | Gardener and the Capybaras (hard version) | constructive algorithms greedy strings | Statement | A2 | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 508 | Parmigiana With Seafood | trees | Statement | M | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 1384 | Comfortably Numb | binary search bitmasks data structures divide and conquer dsu strings trees two pointers | Statement | F | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2750.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 4750 | 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 | |
| 1122 | The Tree Has Fallen! | bitmasks dfs and similar math trees | Statement | E | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 2250.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 872 | 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 | |
| 1417 | Xorcerer's Stones | constructive algorithms dp trees | Statement | F | Hello 2023 {1779} | PROGRAMMING | 2250.0 | ||
| 1324 | Bracket Insertion | brute force combinatorics constructive algorithms dp math trees | Statement | F | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 3250.0 | Tutorial | |
| 273 | Diverse Coloring | trees | Statement | G | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 3500.0 | Tutorial | |
| 589 | Weighed Tree Radius | data structures divide and conquer trees | Statement | G | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 1177 | XOR, Tree, and Queries | constructive algorithms dfs and similar dsu graphs trees | Statement | F | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 3000.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 4025 | Timofey and Black-White Tree | brute force dfs and similar divide and conquer graphs greedy math shortest paths trees | Statement | F | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 1537 | Labeling the Tree with Distances | data structures dp hashing implementation trees | Statement | E | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 2750.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 1037 | Colored Subgraphs | data structures dp greedy trees | Statement | E | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 4663 | 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 | |
| 567 | Li Hua and Path | data structures dfs and similar divide and conquer dsu trees | Statement | F | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 3000.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 2542 | Symmetree | dfs and similar hashing trees | Statement | G | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 619 | Gasoline prices | data structures divide and conquer dsu trees | Statement | E | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 2500.0 | Codeforces Round #857 Editorial | |
| 1923 | There Should Be a Lot of Maximums | data structures dfs and similar dsu graphs trees | Statement | E | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 9190 | 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) | |
| 3463 | Tree Master | brute force data structures dfs and similar hashing trees | Statement | E | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2250.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 3944 | Monsters | brute force data structures dfs and similar dsu graphs implementation trees | Statement | E | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 3622 | Sum Graph | constructive algorithms graphs implementation interactive math shortest paths trees | Statement | B | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #865 | 2000 |
| 5145 | Fish Graph | brute force constructive algorithms dfs and similar graphs trees | Statement | B | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 1000.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 1742 | The Fox and the Complete Tree Traversal | constructive algorithms dp games implementation math trees | Statement | C | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 1500.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 380 | Roads in E City | interactive math probabilities trees | Statement | E | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 2750.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 957 | Timber | combinatorics dp fft math | Statement | F | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 7710 | 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 | ||
| 1302 | Random Walk | dp graphs math probabilities trees | Statement | F | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2500.0 | 115465 | |
| 6096 | LuoTianyi and the Floating Islands (Easy Version) | combinatorics math probabilities trees | Statement | B1 | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 500.0 | CodeForces Round 872(Div. 1&2) Editorial | 1800 |
| 3459 | LuoTianyi and the Floating Islands (Hard Version) | combinatorics dfs and similar math probabilities trees | Statement | B2 | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 750.0 | CodeForces Round 872(Div. 1&2) Editorial | 2300 |
| 1693 | 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 |
| 188 | LuoTianyi and Cartridge | data structures trees | Statement | E | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 3000.0 | CodeForces Round 872(Div. 1&2) Editorial | 3500 |
| 4556 | Range Sorting (Easy Version) | binary search dp dsu greedy trees two pointers | Statement | B1 | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2000 |
| 995 | Two Centroids | data structures dfs and similar greedy trees | Statement | D | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 1750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2800 |
| 560 | Bus Routes | binary search constructive algorithms dfs and similar greedy trees | Statement | E | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 2500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 3400 |
| 943 | Mex Tree | brute force dp trees | Statement | D | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 2250.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 20635 | 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 | |
| 6433 | Ksyusha and Chinchilla | dfs and similar dp dsu greedy implementation trees | Statement | G | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 |