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 |
|---|---|---|---|---|---|---|---|---|---|
| 5447 | 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 | |
| 2198 | Police Station | dp graphs shortest paths | Statement | C | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1900 | |
| 343 | Doe Graphs | constructive algorithms divide and conquer dp graphs shortest paths | Statement | C | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2700 | |
| 533 | Meeting Her | dp graphs shortest paths | Statement | E | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2700 | |
| 18849 | Greg and Graph | dp graphs shortest paths | Statement | B | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 1900 | |
| 1989 | Greg and Friends | combinatorics dp graphs shortest paths | Statement | C | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 2500 | |
| 8837 | 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 | |
| 892 | Robot Control | dp graphs shortest paths | Statement | D | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2600 | |
| 1332 | 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 | |
| 586 | Game with Points | dp graphs implementation shortest paths | Statement | D | Testing Round 9 {386} | PROGRAMMING | 2300 | ||
| 1925 | President's Path | dp graphs shortest paths | Statement | E | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 2400 | |
| 3352 | Breaking Good | dfs and similar dp graphs shortest paths | Statement | E | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | 2200 | ||
| 2119 | Vanya and Treasure | data structures dp graphs shortest paths | Statement | D | Codeforces Round 355 (Div. 2) {677} | PROGRAMMING | Codeforces Round #355 (Div. 2) Editorial | 2300 | |
| 818 | Perishable Roads | dp graphs shortest paths | Statement | D | VK Cup 2017 - Round 3 {773} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 2700 | |
| 1749 | Presents in Bankopolis | dp graphs shortest paths | Statement | D | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 2100 | |
| 7949 | Police Stations | constructive algorithms dfs and similar dp graphs shortest paths trees | Statement | D | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 2100 | |
| 854 | An unavoidable detour for home | combinatorics dp graphs shortest paths | Statement | E | Codeforces Round 418 (Div. 2) {814} | PROGRAMMING | Codeforces Round #418 (Div. 2) Editorial | 2700 | |
| 623 | Dirty Arkady's Kitchen | data structures dp graphs shortest paths | Statement | F | Codeforces Round 423 (Div. 1, rated, based on VK Cup Finals) {827} | PROGRAMMING | Codeforces Round #423 Analysis | 3100 | |
| 1014 | Elevator | dp graphs shortest paths | Statement | C | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 2500 | |
| 2687 | Find a Number | dp graphs number theory shortest paths | Statement | A | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 2200 | |
| 5596 | Subsequences (easy version) | dp graphs implementation shortest paths | Statement | E | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2000 | |
| 7523 | Anna, Svyatoslav and Maps | dp graphs greedy shortest paths | Statement | C | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 1700 | |
| 28561 | Polygon | dp graphs implementation shortest paths | Statement | E | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1300 | |
| 2016 | 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 | |
| 5950 | 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 | ||
| 5102 | Minimum Path | dp graphs implementation shortest paths | Statement | E | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 497 | Useful Edges | dp graphs shortest paths | Statement | D | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 1750.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 3556 | Paired Payment | binary search constructive algorithms dp graphs shortest paths | Statement | E | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 2250.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 9554 | Explorer Space | dp graphs shortest paths | Statement | D | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 1750.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 2121 | Lost Array | constructive algorithms dp graphs interactive shortest paths | Statement | E | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 2250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 973 | 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 | ||
| 5587 | Frog Traveler | data structures dp graphs shortest paths | Statement | B | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 1250.0 | 95865 | 1900 |
| 1081 | 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) | |
| 3112 | Counting Shortcuts | dfs and similar dp graphs shortest paths | Statement | G | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 2448 | Long Way Home | data structures divide and conquer dp geometry graphs shortest paths | Statement | E | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 2750.0 | Codeforces Round #816 (Div. 2) editorial | |
| 4749 | Moving Both Hands | dp graphs shortest paths | Statement | M | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 1993 | Kirill and Company | bitmasks brute force dp graphs shortest paths | Statement | G | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 2980 | The way home | dp graphs greedy shortest paths sortings | Statement | D | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1750.0 | Codeforces Round #857 Editorial | |
| 6127 | Rudolf and CodeVid-23 | bitmasks dp graphs greedy shortest paths | Statement | G | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 13732 | Nastya and Potions | dfs and similar dp graphs greedy shortest paths sortings | Statement | E | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 3100 | Another MEX Problem | bitmasks dp graphs shortest paths | Statement | E | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 2750.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 1441 | Jellyfish and Math | bitmasks dp graphs shortest paths | Statement | B | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 1250.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 10102 | Minimum Maximum Distance | dfs and similar dp graphs shortest paths trees | Statement | F | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 10613 | Bicycles | dp graphs greedy implementation shortest paths sortings | Statement | G | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 3036 | 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 | ||
| 4195 | Determine Winning Islands in Race | data structures dp graphs shortest paths | Statement | D | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 1977 | 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 | |
| 7363 | Skipping | brute force data structures dp graphs greedy shortest paths | Statement | B | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1000.0 | 135341 | |
| 3858 | 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 | |
| 111 | Affectionate Arrays (Hard Version) | data structures dp graphs greedy math shortest paths two pointers | Statement | I2 | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 2712 | Another Exercise on Graphs (Easy Version) | binary search brute force dp graphs shortest paths | Statement | E1 | Hello 2025 {2057} | PROGRAMMING | 1000.0 | ||
| 1651 | Gleb and Boating | brute force constructive algorithms data structures dp graphs greedy math shortest paths | Statement | G | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 3071 | Traffic Lights | brute force dp graphs shortest paths | Statement | D | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 2000.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 1073 | 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 | ||
| 425 | Shortest GCD Paths | dp graphs math number theory shortest paths | Statement | F | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 |