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
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 592 | New Year and Finding Roots | constructive algorithms implementation interactive trees | Statement | F | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 2700 | |
| 14941 | PolandBall and Forest | dfs and similar dsu graphs interactive trees | Statement | C | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 1300 | |
| 219 | Verifying Kingdom | binary search divide and conquer interactive trees | Statement | E | VK Cup 2017 - Round 2 {772} | PROGRAMMING | VK Cup Round 2 + Codeforces Round #409 Tutorial | 3200 | |
| 562 | Jamie and To-do List | data structures interactive trees | Statement | D | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | Codeforces Round #457 (Div. 2) Editorial | 2600 | |
| 1706 | Intersecting Subtrees | dfs and similar interactive trees | Statement | B | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 1900 | |
| 565 | Legendary Tree | binary search interactive trees | Statement | E | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 3000 | |
| 193 | Strange device | binary search interactive math trees | Statement | E | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 3300 | |
| 1956 | Ehab and the Big Finale | constructive algorithms divide and conquer graphs implementation interactive trees | Statement | F | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 2300 | |
| 5354 | Kuroni and the Celebration | constructive algorithms dfs and similar graphs interactive trees | Statement | D | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 1750.0 | Ozon Tech Challenge 2020 Editorial | 1900 |
| 1779 | The Hidden Pair (Easy Version) | binary search dfs and similar graphs interactive shortest paths trees | Statement | F1 | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #651 | |
| 1662 | The Hidden Pair (Hard Version) | binary search dfs and similar graphs interactive shortest paths trees | Statement | F2 | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #651 | |
| 800 | Olha and Igor | interactive trees | Statement | F | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 3000.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 166 | Finding the Vertex | brute force dfs and similar dp interactive trees | Statement | E | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 3000.0 | Codeforces Round #680 Editorial | |
| 6785 | 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 | |
| 255 | Lost Nodes | dp graphs interactive sortings trees | Statement | H | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 3500.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 3059 | Gold Transfer | binary search data structures greedy interactive trees | Statement | E | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 2551 | 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 | |
| 366 | Perfect Matching | data structures interactive trees | Statement | F | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 1373 | Connectivity Addicts | constructive algorithms dsu graphs greedy interactive shortest paths sortings trees | Statement | F | Codeforces Global Round 22 {1738} | PROGRAMMING | 2750.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 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 | |
| 3593 | Sum Graph | constructive algorithms graphs implementation interactive math shortest paths trees | Statement | B | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #865 | 2000 |
| 379 | 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 | |
| 651 | 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) | |
| 1261 | 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 |
| 1565 | Interactive Game with Coloring | brute force constructive algorithms graphs implementation interactive math trees | Statement | E | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 2400 | |
| 178 | Tree Diameter | interactive trees | Statement | H | Hello 2024 {1919} | PROGRAMMING | 5000.0 | 3500 | |
| 1135 | 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 | |
| 1098 | 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 | |
| 12741 | Guess The Tree | binary search brute force greedy interactive trees | Statement | C | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 6175 | Genokraken | binary search constructive algorithms data structures graphs interactive trees two pointers | Statement | D | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 1750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 604 | 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 | ||
| 1606 | Baudelaire (easy version) | binary search interactive trees | Statement | G1 | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 2204 | Paths in a Tree | dfs and similar interactive sortings trees | Statement | G | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 49 | 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 | |
| 37 | 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 | |
| 53 | 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 | |
| 807 | 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 | |
| 477 | 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 |