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 |
|---|---|---|---|---|---|---|---|---|---|
| 2524 | Playoff Fixing | combinatorics trees | Statement | E | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 1826 | Tenzing and Tree | brute force dfs and similar greedy trees | Statement | F | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 2500.0 | CodeTON Round 5 Editorial | |
| 39748 | Sum in Binary Tree | bitmasks math trees | Statement | C | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 21831 | Apple Tree | combinatorics dfs and similar dp trees | Statement | D | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 2143 | Omsk Metro (hard version) | data structures dfs and similar divide and conquer dp implementation math trees | Statement | F2 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 6385 | Omsk Metro (simple version) | data structures dfs and similar dp greedy math trees | Statement | F1 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 1190 | Tree Weights | bitmasks constructive algorithms data structures dfs and similar math matrices number theory trees | Statement | G | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 3500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 887 | XOR Partition | binary search bitmasks data structures divide and conquer greedy trees | Statement | F | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 7615 | Lisa and the Martians | bitmasks data structures greedy math sortings strings trees | Statement | F | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 4088 | Vlad and the Mountains | data structures dsu graphs implementation sortings trees two pointers | Statement | G | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 658 | Michael and Hotel | interactive trees | Statement | D | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 1761 | PermuTree (hard version) | bitmasks dp implementation trees | Statement | E2 | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 1500.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 6479 | PermuTree (easy version) | dfs and similar dp trees | Statement | E1 | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 1500.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 29809 | Strong Vertices | math sortings trees | Statement | D | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 3209 | Trees and Segments | binary search brute force constructive algorithms data structures dp greedy two pointers | Statement | D | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 2000.0 | Codeforces Round #893 (Div. 2) Editorial | 2200 |
| 1566 | Rollbacks (Easy Version) | brute force data structures dfs and similar trees | Statement | E1 | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1750.0 | Codeforces Round #893 (Div. 2) Editorial | 2500 |
| 1271 | Rollbacks (Hard Version) | bitmasks data structures interactive trees | Statement | E2 | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1000.0 | Codeforces Round #893 (Div. 2) Editorial | 2600 |
| 527 | Teleportation in Byteland | data structures divide and conquer graphs shortest paths trees | Statement | F | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 3000.0 | Video solutions from Geothermal. | |
| 12361 | Queries for the Array | data structures dfs and similar implementation strings trees | Statement | C | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 128 | Redundant Routes | constructive algorithms dp trees | Statement | I | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 4000.0 | ||
| 112 | Goldberg Machine 3 | dp trees | Statement | H | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 3500.0 | ||
| 3077 | Guess Game | bitmasks combinatorics constructive algorithms data structures games math probabilities strings trees | Statement | E | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 2000.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 560 | Keen Tree Calculation | binary search dp geometry trees | Statement | K | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 511 | Most Different Tree | brute force constructive algorithms dfs and similar greedy hashing | Statement | F | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 4000.0 | ||
| 1378 | Travel Plan | combinatorics divide and conquer dp math trees | Statement | C | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 1000.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 383 | Flower-like Pseudotree | constructive algorithms graphs implementation trees | Statement | D | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 1750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 122 | Standard Graph Problem | data structures graphs greedy trees | Statement | H | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 4000.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 19857 | Money Trees | greedy greedy greedy math two pointers | Statement | F | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 2728 | Autosynthesis | 2-sat constructive algorithms dfs and similar dp flows graphs trees | Statement | C | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 1250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 281 | Clubstep | binary search brute force data structures greedy trees | Statement | G | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 3250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 350 | Ball-Stackable | constructive algorithms data structures dp trees | Statement | E | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 2250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 1468 | wxhtzdy ORO Tree | binary search bitmasks data structures dfs and similar math trees | Statement | G | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 1584 | Interactive Game with Coloring | brute force constructive algorithms graphs implementation interactive math trees | Statement | E | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 2400 | |
| 9675 | Minimum Maximum Distance | dfs and similar dp graphs shortest paths trees | Statement | F | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 7155 | Tree XOR | bitmasks dfs and similar dp greedy trees | Statement | D | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 941 | Game of Stacks | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 2000.0 | Codeforces Round 906 Editorial | |
| 180 | Doremy's Swapping Trees | dfs and similar graphs trees | Statement | E | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 3500.0 | Codeforces Round 906 Editorial | |
| 157 | Doremy's Average Tree | dp trees | Statement | F | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 3500.0 | Codeforces Round 906 Editorial | |
| 4808 | A Growing Tree | data structures dfs and similar trees | Statement | F | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 2250.0 | ||
| 7165 | XOR Construction | bitmasks constructive algorithms data structures math trees | Statement | D | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 9580 | Alex's whims | constructive algorithms graphs shortest paths trees | Statement | F | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 4054 | Unusual Entertainment | data structures dfs and similar dsu shortest paths sortings trees | Statement | G | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 15106 | Anji's Binary Tree | dfs and similar dp shortest paths trees | Statement | C | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 1250.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 1994 | Compressed Tree | dfs and similar dp graphs greedy trees | Statement | E | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 5693 | Collapsing Strings | binary search data structures dfs and similar hashing strings trees | Statement | E | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 1495 | Trees and XOR Queries Again | bitmasks data structures dfs and similar implementation math trees | Statement | F | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 1301 | Tree Queries | binary search data structures dfs and similar implementation trees | Statement | E | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 2750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 519 | Beautiful Tree | data structures dfs and similar graphs trees | Statement | F | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 3500.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 1274 | One-X | combinatorics dp math | Statement | E | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 2250.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 18653 | Begginer's Zelda | greedy trees | Statement | B | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 1000.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 220 | Build Railway Stations | *special greedy trees | Statement | F | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 4176 | Array Collapse | data structures divide and conquer dp trees | Statement | D | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 5056 | Programming Competition | dfs and similar greedy trees | Statement | F | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 2657 | Happy Life in University | brute force data structures dfs and similar dp implementation trees | Statement | E | Good Bye 2023 {1916} | PROGRAMMING | 2000.0 | ||
| 236 | Optimizations From Chelsu | divide and conquer dp number theory trees | Statement | G | Good Bye 2023 {1916} | PROGRAMMING | 3750.0 | ||
| 1207 | Construct Tree | bitmasks constructive algorithms dp trees | Statement | F | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 1123 | Caterpillar on a Tree | binary search dfs and similar graphs greedy implementation trees | Statement | F | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 3000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 4596 | 01 Tree | data structures divide and conquer greedy implementation sortings trees | Statement | D | Hello 2024 {1919} | PROGRAMMING | 1500.0 | 2100 | |
| 2595 | Wine Factory (Easy Version) | data structures flows schedules trees | Statement | F1 | Hello 2024 {1919} | PROGRAMMING | 1500.0 | 2300 | |
| 210 | Tree LGM | constructive algorithms games trees | Statement | G | Hello 2024 {1919} | PROGRAMMING | 4000.0 | 3500 | |
| 183 | Tree Diameter | interactive trees | Statement | H | Hello 2024 {1919} | PROGRAMMING | 5000.0 | 3500 | |
| 644 | Smooth Sailing (Hard Version) | binary search data structures dsu graphs trees | Statement | F2 | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 5189 | Count Paths | data structures dfs and similar divide and conquer dp dsu trees | Statement | E | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 4577 | Vlad and Trouble at MIT | dfs and similar dp flows graphs greedy implementation trees | Statement | G | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 5437 | Microcycle | data structures dfs and similar dsu graphs greedy trees | Statement | F | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 2092 | Sasha and the Happy Tree Cutting | bitmasks brute force dp fft graphs greedy trees | Statement | E | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 2500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 5803 | Sasha and a Walk in the City | combinatorics dfs and similar dp math trees | Statement | D | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 2000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 2295 | Sasha and the Wedding Binary Search Tree | combinatorics dfs and similar math sortings trees | Statement | F | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 3000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 514 | Prefix Max Set Counting | data structures trees | Statement | G | think-cell Round 1 {1930} | PROGRAMMING | 3500.0 | think-cell Round 1 Editorial | |
| 611 | Andrey's Tree | binary search constructive algorithms dsu greedy implementation trees | Statement | F | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 3000.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 307 | Evidence Board | *special constructive algorithms dfs and similar graphs trees | Statement | B | XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {1939} | PROGRAMMING | |||
| 43 | Burenka and Pether | *special data structures dfs and similar divide and conquer dsu graphs sortings trees | Statement | C | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 218 | Farmer John's Favorite Intern | data structures dp flows trees | Statement | H | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 4500.0 | CodeTON Round 8 Editorial | |
| 2632 | Tree Compass | constructive algorithms dfs and similar greedy trees | Statement | C | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 1250.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 13835 | Tree Cutting | binary search dp greedy implementation trees | Statement | C | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 1500.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 874 | MST with Matching | bitmasks brute force trees | Statement | G | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 2551 | Annual Ants' Gathering | dfs and similar greedy trees | Statement | C | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 203 | Grove | dp dp dp geometry | Statement | A | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 541 | Amanda the Amoeba | graphs implementation trees two pointers | Statement | J | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 1421 | Dating | greedy sortings trees | Statement | F | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 11358 | 0, 1, 2, Tree! | greedy math trees | Statement | F | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 106 | Growing Trees | constructive algorithms flows graphs greedy | Statement | I | Codeforces Global Round 25 {1951} | PROGRAMMING | 4000.0 | Codeforces Global Round 25 Editorial | |
| 365 | Thanos Snap | dp games greedy trees | Statement | H | Codeforces Global Round 25 {1951} | PROGRAMMING | 3500.0 | Codeforces Global Round 25 Editorial | |
| 676 | Frequency Mismatch (Easy Version) | binary search data structures divide and conquer hashing probabilities trees | Statement | F1 | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 2250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2600 |
| 626 | Frequency Mismatch (Hard Version) | binary search data structures dfs and similar hashing probabilities trees | Statement | F2 | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2700 |
| 50 | Equal Trees | *special graphs meet-in-the-middle | Statement | I | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 3100 | |
| 2247 | Fenwick Tree | bitmasks brute force combinatorics data structures dp math trees | Statement | C | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1250.0 | Tutorial | 2300 |
| 4423 | Game on Tree (Medium) | dfs and similar dp games trees | Statement | C2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1700 | |
| 2474 | Game on Tree (Hard) | dfs and similar dp games trees | Statement | C3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1900 | |
| 1941 | Min-Fund Prison (Easy) | dfs and similar trees | Statement | G1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1900 | |
| 881 | Min-Fund Prison (Medium) | brute force dfs and similar dp graphs trees | Statement | G2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2200 | |
| 549 | Min-Fund Prison (Hard) | bitmasks dfs and similar dp graphs trees | Statement | G3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2400 | |
| 603 | Balanced Unshuffle (Medium) | brute force constructive algorithms trees | Statement | A2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2400 | |
| 670 | Balanced Unshuffle (Hard) | constructive algorithms trees | Statement | A3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2400 | |
| 7544 | Paint the Tree | brute force dfs and similar dp greedy shortest paths trees | Statement | D | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 1500.0 | editorial_zh.pdf | 1700 |
| 2899 | Chain Queries | binary search data structures dfs and similar implementation trees | Statement | E | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 2000.0 | editorial_zh.pdf | 2100 |
| 1312 | Splittable Permutations | combinatorics data structures dfs and similar greedy math trees | Statement | E | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 842 | Remove Bridges | data structures dfs and similar dp greedy sortings trees | Statement | F | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 1715 | Yasya and the Mysterious Tree | bitmasks data structures dfs and similar graphs strings trees | Statement | G | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 352 | Turtle and Paths on a Tree | data structures dp trees | Statement | F | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 3500.0 | Simplified Chinese Tutorial | |
| 1246 | Turtle and Intersected Segments | data structures dsu graphs greedy | Statement | E | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 2500.0 | Simplified Chinese Tutorial | |
| 286 | Your Loss | bitmasks brute force trees | Statement | G | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 3000.0 | ||
| 1823 | Shuffle | constructive algorithms dp greedy trees | Statement | E | Codeforces Global Round 26 {1984} | PROGRAMMING | 3000.0 | Codeforces Global Round 26 Editorial | |
| 4098 | Wonderful Tree! | brute force dfs and similar dp flows greedy trees | Statement | E | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 1750.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 348 | Spinning Round (Easy Version) | dp trees | Statement | G1 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 3000.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 6052 | The Omnipotent Monster Killer | brute force dp trees | Statement | D | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 23408 | Substring and Subsequence | bitmasks brute force dp graphs greedy hashing strings trees | Statement | B | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 1156 | Catch the Mole(Easy Version) | binary search constructive algorithms data structures interactive trees | Statement | E1 | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 1129 | Catch the Mole(Hard Version) | binary search data structures dfs and similar interactive trees | Statement | E2 | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 750.0 | Video Tutorial | |
| 5613 | Wooden Game | bitmasks greedy math trees | Statement | E | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 16025 | Maximize the Root | binary search dfs and similar dp greedy trees | Statement | D | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 2337 | Ksyusha and the Loaded Set | binary search data structures dp implementation trees | Statement | H | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 12871 | Guess The Tree | binary search brute force greedy interactive trees | Statement | C | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 2887 | DFS Checker (Hard Version) | constructive algorithms data structures dfs and similar hashing implementation trees | Statement | D2 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 2936 | Cosmic Rays | data structures dfs and similar greedy implementation trees | Statement | E | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 4381 | Iris and the Tree | brute force data structures dfs and similar dsu math trees | Statement | B | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 1250.0 | Tutorial | |
| 321 | Iris's Full Binary Tree | data structures trees | Statement | E | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 2500.0 | Tutorial | |
| 9499 | Iris and Game on the Tree | games graphs greedy trees | Statement | A | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 750.0 | Tutorial | |
| 542 | Yunli's Subarray Queries (extreme version) | data structures trees | Statement | G3 | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | Codeforces Round 971 (Div. 4) Editorial | ||
| 666 | Game in Tree (Easy Version) | binary search data structures games implementation trees | Statement | F1 | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 167 | Game in Tree (Hard Version) | binary search data structures trees | Statement | F2 | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 5184 | Sheriff's Defense | dfs and similar dp trees | Statement | F | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 9816 | Tree Pruning | brute force data structures dfs and similar greedy sortings trees | Statement | C | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 7466 | Connect the Dots | brute force dfs and similar dp dsu graphs math trees | Statement | D | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 1500.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 268 | Count Leaves | dp math number theory | Statement | F | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 2750.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 1941 | Digital Village (Easy Version) | brute force data structures dp dsu graphs greedy implementation math shortest paths trees | Statement | E1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 1223 | Digital Village (Hard Version) | data structures dp dsu graphs math trees | Statement | E2 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 178 | Tree of Life | dp greedy trees | Statement | E | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 2750.0 | 135341 | |
| 1071 | Choose Your Queries | dfs and similar dp graphs greedy trees | Statement | F | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 402 | Bermart Ice Cream | data structures dfs and similar divide and conquer dp implementation trees | Statement | F | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 1924 | Alice's Adventures in the Rabbit Hole | constructive algorithms dfs and similar dp greedy math probabilities trees | Statement | E | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 2000.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 3954 | Cool Graph | constructive algorithms data structures dfs and similar dsu graphs trees | Statement | D | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2250.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 9918 | Penchick and Desert Rabbit | data structures dfs and similar dp dsu greedy two pointers | Statement | D | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 2000.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 2723 | Penchick and Chloe's Trees | data structures dfs and similar dp greedy sortings trees | Statement | E | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 2500.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 6234 | Genokraken | binary search constructive algorithms data structures graphs interactive trees two pointers | Statement | D | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 1750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 2009 | Sakurako and Chefir | data structures dfs and similar dp trees | Statement | G | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 1105 | Tree Operations | binary search dfs and similar dp trees | Statement | F | Codeforces Global Round 27 {2035} | PROGRAMMING | 2250.0 | Codeforces Global Round 27 Editorial | |
| 172 | Go Learn! (Easy Version) | dp trees | Statement | G1 | Codeforces Global Round 27 {2035} | PROGRAMMING | 2250.0 | Codeforces Global Round 27 Editorial | |
| 5880 | Non Prime Tree | brute force constructive algorithms dfs and similar greedy number theory trees two pointers | Statement | D | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2000.0 | Codeforces Round #992 (Div.2) Editorial | |
| 2691 | Control of Randomness | combinatorics dfs and similar graphs greedy math probabilities trees | Statement | E | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2250.0 | Codeforces Round #992 (Div.2) Editorial | |
| 678 | Auto Complete | data structures implementation sortings strings trees | Statement | I | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | Problem Analysis and Hints (PDF) | ||
| 527 | Vertex Pairs | binary search brute force dfs and similar dp greedy trees | Statement | E | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 3889 | Medium Demon Problem (hard version) | dfs and similar dp dsu graphs implementation trees | Statement | G2 | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 1325 | Kevin and Math Class | brute force data structures divide and conquer dp math trees two pointers | Statement | F | Codeforces Global Round 28 {2048} | PROGRAMMING | 2000.0 | Tutorial | |
| 5441 | Tree Destruction | dfs and similar dp greedy trees | Statement | G | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 12088 | Best Price | brute force data structures greedy sortings | Statement | E | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 396 | Managing Cluster | dp graphs math trees | Statement | M | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 4541 | Resourceful Caterpillar Sequence | dfs and similar dp games graphs implementation trees | Statement | E | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 1053 | Nested Segments | combinatorics dp math trees | Statement | E | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 2250.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 1939 | Another Exercise on Graphs (hard version) | binary search brute force dsu graphs shortest paths sortings trees | Statement | E2 | Hello 2025 {2057} | PROGRAMMING | 2000.0 | ||
| 459 | The Game (Hard Version) | data structures dfs and similar games graphs trees | Statement | E2 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 2500.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 3572 | Balanced Tree | dfs and similar dp greedy trees | Statement | D | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 2000.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 4357 | The Game (Easy Version) | dfs and similar games graphs trees | Statement | E1 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 1500.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 14796 | Remove Exactly Two | brute force data structures dp graphs greedy sortings trees | Statement | C | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1500.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 935 | Counting Is Not Fun (Hard Version) | combinatorics data structures dfs and similar dsu trees | Statement | F2 | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1500.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 2399 | Triangle Tree | data structures dfs and similar dp dsu greedy trees | Statement | E | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 2750.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 7201 | Skibidus and Slay | data structures dfs and similar graphs greedy trees | Statement | F | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 267 | Morse Code | dp greedy sortings trees | Statement | D | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 11248 | Tree Jumps | combinatorics dfs and similar dp trees | Statement | D | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | Video Tutorial | ||
| 826 | LeaFall | combinatorics probabilities trees | Statement | E | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 2500.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 9786 | Trapmigiano Reggiano | constructive algorithms dfs and similar sortings trees | Statement | C | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1500.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 3852 | Shorten the Array | binary search brute force data structures dfs and similar greedy strings trees two pointers | Statement | G | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 1947 | Baggage Claim | combinatorics dsu graphs math trees | Statement | B | Codeforces Round 1021 (Div. 1) {2097} | PROGRAMMING | 1000.0 | 142316 | |
| 161 | Shoo Shatters the Sunshine | combinatorics dp trees | Statement | F | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 3750.0 | 142788 | |
| 541 | Modulo 3 | data structures divide and conquer dsu trees | Statement | G | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 623 | Baudelaire (hard version) | binary search dfs and similar divide and conquer implementation interactive trees | Statement | G2 | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 1627 | Baudelaire (easy version) | binary search interactive trees | Statement | G1 | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 3571 | Apple Tree Traversing | brute force dfs and similar greedy implementation trees | Statement | D | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 2000.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 946 | Ain and Apple Tree | constructive algorithms greedy math trees | Statement | E | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 2750.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 900 | Spruce Dispute | constructive algorithms dfs and similar graphs implementation shortest paths trees | Statement | E | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 2750.0 | Codeforces Round 1022 Editorial | |
| 3413 | Tree Colorings | combinatorics dp graphs math trees | Statement | E | Educational Codeforces Round 180 (Rated for Div. 2) {2112} | PROGRAMMING | Educational Codeforces Round 180 — Editorial | ||
| 9565 | Reachability and Tree | constructive algorithms dfs and similar dp trees | Statement | D | Educational Codeforces Round 180 (Rated for Div. 2) {2112} | PROGRAMMING | Educational Codeforces Round 180 — Editorial | ||
| 414 | From Kazan with Love | brute force graphs trees | Statement | E | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 2500.0 | Codeforces Round #1031 Editorial | |
| 14148 | Kirei Attacks the Estate | dfs and similar dp trees | Statement | E | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 5974 | Wildflower | combinatorics dfs and similar trees | Statement | F | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 12742 | Divine Tree | constructive algorithms greedy math sortings trees | Statement | C | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 1250.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 519 | Tree Parking | combinatorics math trees | Statement | G | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 4000.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 220 | Lexicographic Partition | constructive algorithms math trees | Statement | I | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 4750.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 4349 | 1-1-1, Free Tree! | data structures dfs and similar graphs trees | Statement | F | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 853 | 23 Rises Again | brute force data structures dfs and similar dp flows graphs implementation probabilities trees | Statement | H | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 4000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 6474 | Root was Built by Love, Broken by Destiny | combinatorics dfs and similar graphs trees | Statement | D | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 3066 | Ancient Tree | constructive algorithms data structures dfs and similar dsu greedy trees | Statement | E | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2500.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 14511 | Arboris Contractio | graphs greedy trees | Statement | D | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 1724 | I Yearned For The Mines | constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 2750.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 3689 | Sliding Tree | constructive algorithms dfs and similar trees | Statement | D | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 2000.0 | 145832 | |
| 259 | To the Infinity | data structures hashing math trees | Statement | F | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 4000.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 3425 | Maple and Tree Beauty (Hard Version) | bitmasks brute force dfs and similar divide and conquer dp fft trees | Statement | C2 | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 750.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 5504 | Maple and Tree Beauty (Easy Version) | dfs and similar dp graphs trees | Statement | C1 | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 1250.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 10727 | Max Sum OR (Easy Version) | bitmasks constructive algorithms divide and conquer greedy trees | Statement | D1 | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 209 | Cycle Closing | constructive algorithms graphs trees | Statement | F | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 3250.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 1380 | Triple Attack | brute force data structures greedy trees two pointers | Statement | F | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 4000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 1055 | Query Jungle | data structures data structures implementation math math trees | Statement | G | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 4000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 327 | Odd Queries on Odd Array | data structures trees | Statement | F | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 3250.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 26559 | Circle of Apple Trees | greedy | Statement | A | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 500.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 4845 | Catshock | constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 1750.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 671 | Juan's Colorful Tree | data structures data structures dfs and similar dfs and similar dsu graphs graphs trees | Statement | F | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 3000.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 353 | SubMST | combinatorics graphs trees | Statement | F | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 3250.0 | ||
| 2837 | Beautiful Tree | constructive algorithms math trees | Statement | G | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 14556 | Cyclic Merging | brute force constructive algorithms graphs greedy trees | Statement | A | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 500.0 | 148452 | |
| 307 | Rainbow Branch | dp trees | Statement | E | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 3000.0 | 148452 | |
| 7265 | Tree, TREE!!! | data structures dp trees | Statement | F | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 7307 | Rae Taylor and Trees (hard version) | binary search constructive algorithms data structures dp dsu implementation trees | Statement | F | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 11853 | Rae Taylor and Trees (easy version) | binary search data structures dp dsu greedy implementation trees | Statement | D | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 479 | Mosaic Tree | combinatorics dp fft math trees | Statement | F | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 3500.0 | Codeforces Round 1069 Editorial | |
| 300 | Secret Message | data structures greedy trees | Statement | D | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 2750.0 | Codeforces Round 1069 Editorial | |
| 1302 | Remove at the lowest cost | data structures dfs and similar greedy implementation trees | Statement | E | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 2500.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 1851 | Conquer or of Forest | combinatorics dfs and similar dsu trees | Statement | F | Good Bye 2025 {2178} | PROGRAMMING | 2750.0 | ||
| 1326 | Blackslex and Plants | bitmasks data structures dp math | Statement | H | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 358 | Short Garland | data structures dp trees | Statement | G | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 1142 | Jumping Man | combinatorics data structures dp trees | Statement | F | Hello 2026 {2183} | PROGRAMMING | 2750.0 | ||
| 2528 | Tree Coloring (Hard Version) | constructive algorithms data structures dfs and similar greedy implementation trees | Statement | D2 | Hello 2026 {2183} | PROGRAMMING | 2000.0 | ||
| 9041 | Tree Coloring (Easy Version) | constructive algorithms dfs and similar greedy trees | Statement | D1 | Hello 2026 {2183} | PROGRAMMING | 1000.0 | ||
| 4023 | Cherry Tree | dfs and similar dp graphs trees | Statement | F | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 230 | Al Fine (Maximizing Version) | binary search data structures divide and conquer greedy trees | Statement | F1 | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 2000.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 1413 | Jerry and Tom | data structures dfs and similar games graphs greedy trees | Statement | C | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 1750.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 77 | Al Fine (Counting Version) | dp trees | Statement | F2 | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 3500.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 104 | Many Cartesian Trees | greedy | Statement | G | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 3000.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 230 | Zhora the Vacuum Cleaner | dp implementation sortings trees | Statement | F | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 3250.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 978 | Prufer Vertex | combinatorics dsu number theory probabilities trees | Statement | D | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 2250.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 3708 | Cost of Tree | data structures dfs and similar dp trees | Statement | D | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 1750.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 1082 | Remove the Grail Tree | dfs and similar dp greedy trees | Statement | H | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 2297 | Paths in a Tree | dfs and similar interactive sortings trees | Statement | G | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 176 | Again Trees... (hard version) | bitmasks data structures dfs and similar dp fft trees | Statement | F2 | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1750.0 | Codeforces Round #1078 Editorial | |
| 916 | Again Trees... (Easy Version) | bitmasks dfs and similar dp fft trees | Statement | F1 | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1750.0 | Codeforces Round #1078 Editorial | |
| 1096 | Idiot First Search and Queries | binary search data structures graphs trees | Statement | G | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 8921 | Idiot First Search | dfs and similar dp trees | Statement | E | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 480 | Six Seven | divide and conquer math number theory strings trees | Statement | H | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 5206 | Simons and Beating Peaks | data structures divide and conquer dp greedy implementation trees | Statement | D | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 1750.0 | Tutorial | |
| 291 | Christmas Tree Un-decoration | data structures dp trees | Statement | D | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 55 | Bowser's Castle (Easy Version) | binary search constructive algorithms divide and conquer greedy interactive trees | Statement | H1 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 3250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 43 | Bowser's Castle (Medium Version) | constructive algorithms divide and conquer interactive trees two pointers | Statement | H2 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1000.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 60 | Bowser's Castle (Hard Version) | constructive algorithms divide and conquer interactive trees two pointers | Statement | H3 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1500.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 2182 | Boxed Like a Fish | dfs and similar dp games trees | Statement | D | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 2250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 4470 | Tree Orientation (Easy Version) | constructive algorithms dfs and similar dsu graphs greedy trees | Statement | D1 | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 1949 | Tree Orientation (Hard Version) | data structures dfs and similar dsu graphs greedy matrices sortings trees | Statement | D2 | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 441 | Dynamic Values And Maximum Sum | data structures greedy implementation trees | Statement | F | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 3000.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 240 | A Simple Problem | binary search greedy math trees | Statement | F | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 3500.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 2154 | A Simple RBS Problem | constructive algorithms strings trees | Statement | D | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 2250.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 910 | Minimum Path Cover | dp interactive number theory trees | Statement | E | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 2500.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 728 | Oriented Journey | bitmasks communication constructive algorithms graphs hashing interactive trees | Statement | C | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 1750.0 | 152930 | |
| 67 | Maze | trees | Statement | G | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 5000.0 | 152930 | |
| 406 | Down the Pivot | combinatorics trees | Statement | G | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 3250.0 | Tutorial | |
| 15665 | The 67th XOR Problem | binary search bitmasks brute force trees | Statement | E | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 8247 | The 67th Tree Problem | constructive algorithms implementation trees | Statement | F | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 1303 | Coloring a Red Black Tree | dp greedy probabilities trees | Statement | C | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 1750.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 190 | Statistics on Tree | binary search brute force dfs and similar divide and conquer graphs trees | Statement | G | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 3500.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 787 | Zhily and Signpost | binary search chinese remainder theorem dfs and similar math number theory trees | Statement | C | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 1500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 25 | Zhily and Permutation | data structures divide and conquer trees | Statement | E | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 3500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 161 | Stop Spot | strings trees | Statement | G | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 1390 | Fallen Leaves | dfs and similar dp trees | Statement | H | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial |