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 |
|---|---|---|---|---|---|---|---|---|---|
| 5265 | Two Paths | dfs and similar dp graphs shortest paths trees two pointers | Statement | D | Codeforces Beta Round 14 (Div. 2) {14} | PROGRAMMING | Codeforces Beta Round #14 tutorial | 2100 | |
| 7613 | Eternal Victory | dfs and similar graphs greedy shortest paths trees | Statement | D | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 1900 | |
| 414 | Tree or not Tree | data structures divide and conquer implementation trees | Statement | E | Codeforces Beta Round 88 {117} | PROGRAMMING | Codeforces Beta Round #88 (Editorial) | 2800 | |
| 6487 | Design Tutorial: Inverse the Problem | dfs and similar dsu shortest paths trees | Statement | D | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 1900 | |
| 644 | Timofey and a flat tree | data structures graphs hashing shortest paths trees | Statement | D | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 2800 | |
| 7146 | Police Stations | constructive algorithms dfs and similar dp graphs shortest paths trees | Statement | D | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 2100 | |
| 252 | Iqea | data structures dfs and similar divide and conquer dsu shortest paths trees | Statement | E | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 3300 | |
| 1232 | Sonya and Ice Cream | binary search data structures dp greedy shortest paths trees | Statement | E | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2400 | |
| 18975 | Valid BFS? | dfs and similar graphs shortest paths trees | Statement | D | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1700 | |
| 3723 | The Shortest Statement | graphs shortest paths trees | Statement | F | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 2300 | |
| 610 | Double Tree | data structures divide and conquer shortest paths trees | Statement | G | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2900 | |
| 13500 | Cover it! | dfs and similar dsu graphs shortest paths trees | Statement | E | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1700 | |
| 1056 | Daleks' Invasion (medium) | dfs and similar graphs shortest paths trees | Statement | E2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2200 | |
| 1362 | Koala and Notebook | data structures dfs and similar graphs shortest paths strings trees | Statement | F | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2600 | |
| 9529 | Shichikuji and Power Grid | dsu graphs greedy shortest paths trees | Statement | D | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1900 | |
| 2244 | Cheap Robot | binary search dsu graphs shortest paths trees | Statement | F | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 2600 | |
| 5864 | 1-Trees and Queries | data structures dfs and similar shortest paths trees | Statement | E | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 2000.0 | Codeforces Round #620 (Div. 2) Editorial | 2000 |
| 1067 | 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 | |
| 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 | |
| 213 | Dušan's Railway | graphs trees | Statement | C | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 14327 | Minimal Height Tree | graphs greedy shortest paths trees | Statement | D | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 1530 | 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 | |
| 895 | 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 | ||
| 8330 | 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 | |
| 4309 | 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 | |
| 1008 | 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) | |
| 1333 | 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 | |
| 1191 | 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 | |
| 454 | 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 |
| 6004 | 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 | |
| 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> | |
| 3983 | 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 | ||
| 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 |
| 519 | 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. | |
| 9504 | Minimum Maximum Distance | dfs and similar dp graphs shortest paths trees | Statement | F | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 9487 | Alex's whims | constructive algorithms graphs shortest paths trees | Statement | F | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 3999 | 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) | ||
| 14968 | 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 | |
| 7474 | 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 |
| 1918 | 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 | |
| 1905 | Another Exercise on Graphs (hard version) | binary search brute force dsu graphs shortest paths sortings trees | Statement | E2 | Hello 2025 {2057} | PROGRAMMING | 2000.0 | ||
| 875 | 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 |