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 |
|---|---|---|---|---|---|---|---|---|---|
| 5379 | 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 | |
| 7754 | Eternal Victory | dfs and similar graphs greedy shortest paths trees | Statement | D | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 1900 | |
| 109 | Harry Potter and Moving Staircases | dfs and similar implementation | Statement | E | Codeforces Beta Round 60 {65} | PROGRAMMING | Codeforces Beta Round #60: tutorial | 2900 | |
| 5195 | Missile Silos | data structures dfs and similar graphs shortest paths | Statement | D | Codeforces Round 103 (Div. 2) {144} | PROGRAMMING | Codeforces Round #103 (Div. 2) Разбор Задач. | 1900 | |
| 11435 | King's Path | dfs and similar graphs hashing shortest paths | Statement | C | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | Codeforces Round #149 (Div. 2) Tutorial | 1800 | |
| 2925 | Text Editor | data structures dfs and similar graphs greedy shortest paths | Statement | C | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 1600 | |
| 668 | Rats | brute force dfs and similar graphs implementation shortest paths | Statement | D | Codeforces Round 155 (Div. 2) {254} | PROGRAMMING | Codeforces Round #155 (Div. 2) — tutorial | 2600 | |
| 486 | Monsters and Diamonds | dfs and similar graphs shortest paths | Statement | C | MemSQL start[c]up Round 1 {325} | PROGRAMMING | 2500 | ||
| 8805 | Xenia and Weights | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | C | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 1700 | |
| 1311 | Valera and Fools | dfs and similar dp graphs shortest paths | Statement | D | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 2300 | |
| 3291 | Breaking Good | dfs and similar dp graphs shortest paths | Statement | E | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | 2200 | ||
| 64270 | Two Buttons | dfs and similar graphs greedy implementation math shortest paths | Statement | B | Codeforces Round 295 (Div. 2) {520} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 1400 | |
| 2317 | President and Roads | dfs and similar graphs hashing shortest paths | Statement | E | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 2600 | |
| 3829 | Phillip and Trains | dfs and similar graphs shortest paths | Statement | B | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 1800 | |
| 3673 | Three States | dfs and similar graphs shortest paths | Statement | C | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 2200 | |
| 13641 | Igor In the Museum | dfs and similar graphs shortest paths | Statement | D | Educational Codeforces Round 1 {598} | PROGRAMMING | Editorial | 1700 | |
| 6682 | Mike and Shortcuts | dfs and similar graphs greedy shortest paths | Statement | B | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | 45912 | 1600 | |
| 3139 | Cycle In Maze | *special dfs and similar graphs greedy shortest paths | Statement | C | VK Cup 2017 - Qualification 1 {769} | PROGRAMMING | Tutorial | 1800 | |
| 2661 | The Great Mixing | dfs and similar graphs shortest paths | Statement | C | Codeforces Round 407 (Div. 1) {788} | PROGRAMMING | Codeforces Round #407(Div.1 + Div.2) Editorial | 2500 | |
| 4872 | Igor and his way to work | dfs and similar graphs implementation shortest paths | Statement | B | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 1600 | |
| 7717 | Police Stations | constructive algorithms dfs and similar dp graphs shortest paths trees | Statement | D | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 2100 | |
| 1775 | Okabe and City | dfs and similar graphs shortest paths | Statement | D | Codeforces Round 420 (Div. 2) {821} | PROGRAMMING | Tutorial | 2200 | |
| 5230 | Olya and Energy Drinks | data structures dfs and similar graphs shortest paths | Statement | D | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 1900 | |
| 8086 | Fight Against Traffic | dfs and similar graphs shortest paths | Statement | D | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 1600 | |
| 2152 | Berland and the Shortest Paths | brute force dfs and similar graphs shortest paths | Statement | F | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 2400 | |
| 19780 | Valid BFS? | dfs and similar graphs shortest paths trees | Statement | D | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1700 | |
| 2880 | Multihedgehog | dfs and similar graphs shortest paths | Statement | B | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2000 | |
| 4456 | Kilani and the Game | dfs and similar graphs implementation shortest paths | Statement | D | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 1900 | |
| 20566 | Lunar New Year and a Wander | data structures dfs and similar graphs greedy shortest paths | Statement | D | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 1500 | |
| 13900 | Cover it! | dfs and similar dsu graphs shortest paths trees | Statement | E | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1700 | |
| 1091 | 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 | |
| 1396 | 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 | |
| 8199 | Nearest Opposite Parity | dfs and similar graphs shortest paths | Statement | E | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 2000 | |
| 1442 | Super Jaber | dfs and similar graphs implementation shortest paths | Statement | F | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 2500.0 | Codeforces Round #619 (Div. 2) Editorial | 2700 |
| 7393 | Cow and Fields | binary search data structures dfs and similar graphs greedy shortest paths sortings | Statement | D | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 2000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1900 |
| 2382 | Ehab's REAL Number Theory Problem | brute force dfs and similar graphs number theory shortest paths | Statement | E | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 2500.0 | 74235 | 2700 |
| 4868 | Orac and Game of Life | dfs and similar graphs implementation shortest paths | Statement | C | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 1250.0 | Codeforces Round #641 Editorial | 2000 |
| 21251 | Solve The Maze | constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths | Statement | D | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 1500.0 | Editorial — Codeforces Round #648 | 1700 |
| 1839 | 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 | |
| 1725 | 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 | |
| 430 | 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 | ||
| 1948 | Egor in the Republic of Dagestan | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | E | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2500.0 | Codeforces Round #669 Editorial | |
| 5294 | Reducing Delivery Cost | dfs and similar graphs shortest paths | Statement | G | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 1511 | Capitalism | constructive algorithms dfs and similar graphs shortest paths | Statement | E | Codeforces Global Round 12 {1450} | PROGRAMMING | 2500.0 | Codeforces Global Round 12 Editorial | |
| 5805 | Moving to the Capital | dfs and similar dp graphs shortest paths | Statement | G | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 1581 | 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 | |
| 4329 | To Go Or Not To Go? | dfs and similar graphs greedy shortest paths | Statement | G | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 722 | Down Below | binary search dfs and similar graphs meet-in-the-middle shortest paths | Statement | E | Codeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine)) {1558} | PROGRAMMING | 3000.0 | Codeforces Round #740 Editorial | 3000 |
| 4890 | The Strongest Build | data structures dfs and similar graphs greedy hashing implementation shortest paths | Statement | D | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 1059 | 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) | |
| 3009 | Counting Shortcuts | dfs and similar dp graphs shortest paths | Statement | G | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 6649 | Nearest Excluded Points | binary search data structures dfs and similar graphs shortest paths | Statement | D | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 21037 | Getting Zero | brute force dfs and similar graphs greedy shortest paths | Statement | B | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 1265 | Antennas | data structures dfs and similar graphs graphs implementation implementation shortest paths shortest paths | Statement | F | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 2114 | Cactus Wall | dfs and similar graphs shortest paths | Statement | E | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 8849 | Friendly Spiders | dfs and similar graphs math number theory shortest paths | Statement | D | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 2000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 4116 | 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 | ||
| 1341 | Tokens on Graph | constructive algorithms dfs and similar graphs shortest paths | Statement | G | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 2398 | Between | constructive algorithms dfs and similar graphs greedy shortest paths | Statement | C | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #865 | 2200 |
| 13526 | Nastya and Potions | dfs and similar dp graphs greedy shortest paths sortings | Statement | E | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 1853 | Fast Travel Text Editor | dfs and similar graphs shortest paths | Statement | E | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 9712 | Mad City | dfs and similar dsu graphs shortest paths | Statement | H | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 9815 | Minimum Maximum Distance | dfs and similar dp graphs shortest paths trees | Statement | F | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 3002 | Turtle Mission: Robot and the Earthquake | dfs and similar dp graphs shortest paths | Statement | F | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 4813 | Rudolf and Subway | dfs and similar graphs shortest paths | Statement | G | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 21460 | Arrow Path | dfs and similar graphs shortest paths | Statement | C | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 996 | Long Way to be Non-decreasing | binary search dfs and similar graphs implementation shortest paths two pointers | Statement | D | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1750.0 | Tutorial | 2800 |
| 3814 | Alice's Adventures in Cards | constructive algorithms data structures dfs and similar dp graphs greedy implementation shortest paths | Statement | D | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1750.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 5213 | Drunken Maze | dfs and similar graphs shortest paths | Statement | D | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | Problem Analysis and Hints (PDF) | ||
| 380 | Porto Vs. Benfica | data structures dfs and similar dsu graphs shortest paths | Statement | E | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 917 | 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 | |
| 284 | Penguin Steps | binary search dfs and similar flows graphs shortest paths | Statement | F | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 3000.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 5828 | D/D/D | dfs and similar graphs greedy shortest paths | Statement | D | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 1750.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 2860 | Rada and the Chamomile Valley | dfs and similar graphs shortest paths | Statement | F | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 1059 | Long Journey | dfs and similar dp graphs matrices number theory shortest paths | Statement | F | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial |