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 |
|---|---|---|---|---|---|---|---|---|---|
| 2519 | Gift | dsu graphs sortings trees | Statement | A | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 2300 | |
| 646 | Petya and Tree | binary search dfs and similar probabilities sortings trees | Statement | C | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Yandex.Algorithm 2011 - Round 1. Problem C. Tutorial | 2200 | |
| 1102 | Beautiful Road | dfs and similar dp dsu graphs implementation sortings trees | Statement | D | Codeforces Beta Round 73 (Div. 1 Only) {87} | PROGRAMMING | CodeForces Beta Round #73 div. 1 analysis (particulary with div. 2) | 2300 | |
| 813 | Castle | dp greedy probabilities sortings trees | Statement | D | Codeforces Beta Round 79 (Div. 1 Only) {101} | PROGRAMMING | Codeforces Beta Round 79, editoral | 2300 | |
| 1071 | Paint Tree | constructive algorithms divide and conquer geometry sortings trees | Statement | C | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Разбор задач | 2400 | |
| 508 | Furukawa Nagisa's Tree | binary search divide and conquer sortings trees | Statement | E | Codeforces Round 248 (Div. 1) {434} | PROGRAMMING | Codeforces Round #248 Editorial | 3000 | |
| 4416 | Pillars | binary search data structures dp sortings trees | Statement | E | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 2200 | |
| 6102 | Misha and Forest | constructive algorithms data structures greedy sortings trees | Statement | C | Codeforces Round 285 (Div. 2) {501} | PROGRAMMING | Tutorial | 1700 | |
| 2603 | Infinite Inversions | binary search data structures implementation sortings trees | Statement | E | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 2400 | |
| 4322 | Kingdom and its Cities | dfs and similar divide and conquer dp graphs sortings trees | Statement | D | Codeforces Round 339 (Div. 1) {613} | PROGRAMMING | Tutorial | 2800 | |
| 2534 | Ants in Leaves | dfs and similar greedy sortings trees | Statement | E | Educational Codeforces Round 7 {622} | PROGRAMMING | Editorial of Educational Codeforces Round 7 | 2300 | |
| 1645 | Expected diameter of a tree | binary search brute force dfs and similar dp sortings trees | Statement | D | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 2600 | |
| 1607 | Leaf Sets | data structures dfs and similar dsu graphs greedy sortings trees | Statement | F | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2400 | |
| 6837 | Decorate Apple Tree | constructive algorithms dfs and similar dp graphs greedy sortings trees | Statement | D | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 1600 | |
| 2907 | Irrigation | binary search data structures implementation sortings trees two pointers | Statement | D | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 2100 | |
| 9990 | Path Queries | divide and conquer dsu graphs sortings trees | Statement | G | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2000 | |
| 2888 | Petya and Construction Set | constructive algorithms graphs math sortings trees | Statement | E | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2000 | |
| 3009 | Paint the Tree | dp sortings trees | Statement | E | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2200 | |
| 2036 | Delete a Segment | brute force constructive algorithms data structures dp graphs sortings trees two pointers | Statement | E | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 2300 | |
| 3151 | Berland Beauty | constructive algorithms dfs and similar greedy sortings trees | Statement | F | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 2400 | |
| 25649 | 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 |
| 11389 | String Transformation 1 | dsu graphs greedy sortings strings trees | Statement | A | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 1314 | Boboniu and Jianghu | dp greedy sortings trees | Statement | D | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1750.0 | Codeforces Round #664 Editorial | 2800 |
| 10784 | 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 | |
| 950 | 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 | ||
| 418 | 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 | |
| 526 | 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) | |
| 2373 | 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) | |
| 6189 | Passable Paths (hard version) | bitmasks data structures dfs and similar dp sortings trees | Statement | G2 | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 6561 | Passable Paths (easy version) | data structures dfs and similar sortings trees | Statement | G1 | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 1418 | 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> | |
| 18743 | Masha and a Beautiful Tree | dfs and similar divide and conquer graphs sortings trees | Statement | D | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 5172 | 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 | |
| 1274 | 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 | |
| 7805 | Lisa and the Martians | bitmasks data structures greedy math sortings strings trees | Statement | F | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 4220 | Vlad and the Mountains | data structures dsu graphs implementation sortings trees two pointers | Statement | G | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 31250 | Strong Vertices | math sortings trees | Statement | D | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 4112 | 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) | ||
| 4641 | 01 Tree | data structures divide and conquer greedy implementation sortings trees | Statement | D | Hello 2024 {1919} | PROGRAMMING | 1500.0 | 2100 | |
| 2357 | 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. | |
| 44 | 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 | |||
| 1512 | Dating | greedy sortings trees | Statement | F | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 1017 | 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 | ||
| 10236 | 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) | |
| 2768 | 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 | |
| 695 | 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) | ||
| 1996 | Another Exercise on Graphs (hard version) | binary search brute force dsu graphs shortest paths sortings trees | Statement | E2 | Hello 2025 {2057} | PROGRAMMING | 2000.0 | ||
| 15308 | 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 | |
| 273 | Morse Code | dp greedy sortings trees | Statement | D | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 9954 | 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 | |
| 13044 | 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 | |
| 260 | 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 | |
| 2415 | Paths in a Tree | dfs and similar interactive sortings trees | Statement | G | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 2096 | 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 | |
| 295 | Spectral Components | dfs and similar dp greedy sortings trees | Statement | F | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 2750.0 | ||
| 748 | Nightcrawler | data structures dfs and similar dp greedy sortings trees | Statement | G | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING |