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 |
|---|---|---|---|---|---|---|---|---|---|
| 5304 | 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 | |
| 1349 | Password | bitmasks dp shortest paths | Statement | D | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 - разбор (перевод A-D) | 2700 | |
| 2368 | AlgoRace | dp shortest paths | Statement | B | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | Tutorial | 1900 | |
| 2158 | Police Station | dp graphs shortest paths | Statement | C | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1900 | |
| 311 | 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 | |
| 502 | Meeting Her | dp graphs shortest paths | Statement | E | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2700 | |
| 17855 | Greg and Graph | dp graphs shortest paths | Statement | B | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 1900 | |
| 1944 | Greg and Friends | combinatorics dp graphs shortest paths | Statement | C | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 2500 | |
| 8774 | 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 | |
| 843 | Robot Control | dp graphs shortest paths | Statement | D | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2600 | |
| 1288 | 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 | |
| 552 | Game with Points | dp graphs implementation shortest paths | Statement | D | Testing Round 9 {386} | PROGRAMMING | 2300 | ||
| 1803 | President's Path | dp graphs shortest paths | Statement | E | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 2400 | |
| 3258 | Breaking Good | dfs and similar dp graphs shortest paths | Statement | E | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | 2200 | ||
| 1974 | 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 | |
| 1336 | Tree Folding | dfs and similar dp greedy implementation trees | Statement | E | Codeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {765} | PROGRAMMING | Codeforces Round #397 Editorial | 2200 | |
| 801 | 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 | |
| 1712 | Presents in Bankopolis | dp graphs shortest paths | Statement | D | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 2100 | |
| 7278 | Police Stations | constructive algorithms dfs and similar dp graphs shortest paths trees | Statement | D | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 2100 | |
| 728 | 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 | |
| 584 | 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 | |
| 888 | Logical Expression | bitmasks dp shortest paths | Statement | E | Hello 2018 {913} | PROGRAMMING | Tutorial | 2400 | |
| 945 | 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 | |
| 1247 | Sonya and Ice Cream | binary search data structures dp greedy shortest paths trees | Statement | E | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2400 | |
| 3020 | Make It One | bitmasks combinatorics dp math number theory shortest paths | Statement | F | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 2500 | |
| 1446 | Three Pieces | dfs and similar dp shortest paths | Statement | D | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 2200 | |
| 2625 | 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 | |
| 5445 | Subsequences (easy version) | dp graphs implementation shortest paths | Statement | E | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2000 | |
| 1860 | Culture Code | binary search combinatorics data structures dp shortest paths sortings | Statement | E | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 2300 | |
| 4851 | You Are Given a Decimal String... | brute force dp shortest paths | Statement | B | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 1700 | |
| 7264 | Anna, Svyatoslav and Maps | dp graphs greedy shortest paths | Statement | C | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 1700 | |
| 1371 | Hyakugoku and Ladders | dp probabilities shortest paths | Statement | E | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 2300 | |
| 11102 | By Elevator or Stairs? | dp shortest paths | Statement | E | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1700 | |
| 28104 | Polygon | dp graphs implementation shortest paths | Statement | E | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1300 | |
| 10425 | Uncle Bogdan and Country Happiness | dfs and similar dp greedy math trees | Statement | C | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1500.0 | Codeforces Round #660 Editorial | 1800 |
| 1911 | 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 | |
| 5691 | 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 | ||
| 4786 | 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 | |
| 3382 | 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 | |
| 2506 | Bananas in a Microwave | dfs and similar dp greedy shortest paths | Statement | D | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 2500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 3861 | Travelling Salesman Problem | binary search data structures dp greedy shortest paths sortings | Statement | C | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1250.0 | T | 2200 |
| 9300 | 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 | |
| 2079 | 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 | |
| 16456 | Air Conditioners | dfs and similar dp implementation shortest paths sortings two pointers | Statement | E | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 902 | 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 | ||
| 5518 | Frog Traveler | data structures dp graphs shortest paths | Statement | B | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 1250.0 | 95865 | 1900 |
| 4321 | 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 | |
| 695 | Armor and Weapons | brute force dp greedy shortest paths | Statement | F | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 1035 | 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) | |
| 7289 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 2804 | Not Escaping | data structures dp implementation shortest paths sortings two pointers | Statement | E | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 2000.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 18998 | Make Them Equal | dp greedy shortest paths | Statement | D | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 1052 | Serious Business | data structures divide and conquer dp shortest paths | Statement | D | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2000.0 | Codeforces Round #775 Editorial | |
| 2973 | Counting Shortcuts | dfs and similar dp graphs shortest paths | Statement | G | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 10830 | Required Length | brute force dfs and similar dp hashing shortest paths | Statement | D | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 1700 | |
| 956 | Labyrinth Adventures | data structures dp greedy matrices shortest paths | Statement | E | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 2600 | |
| 4767 | Lena and Matrix | brute force data structures dp shortest paths | Statement | D | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 1750.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 14196 | Zero Path | brute force data structures dp greedy shortest paths | Statement | C | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 2151 | 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 | |
| 4479 | Moving Both Hands | dp graphs shortest paths | Statement | M | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 1948 | Kirill and Company | bitmasks brute force dp graphs shortest paths | Statement | G | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 1602 | Divisors and Table | dp number theory shortest paths | Statement | E | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 2891 | The way home | dp graphs greedy shortest paths sortings | Statement | D | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1750.0 | Codeforces Round #857 Editorial | |
| 943 | Mex Tree | brute force dp trees | Statement | D | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 2250.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 5749 | Rudolf and CodeVid-23 | bitmasks dp graphs greedy shortest paths | Statement | G | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 13372 | Nastya and Potions | dfs and similar dp graphs greedy shortest paths sortings | Statement | E | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 2976 | 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 | |
| 1398 | 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 | |
| 9675 | Minimum Maximum Distance | dfs and similar dp graphs shortest paths trees | Statement | F | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 15106 | 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 | |
| 9881 | Bicycles | dp graphs greedy implementation shortest paths sortings | Statement | G | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 2971 | 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 | ||
| 7544 | 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 |
| 4127 | Determine Winning Islands in Race | data structures dp graphs shortest paths | Statement | D | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 1941 | 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 | |
| 7143 | Skipping | brute force data structures dp graphs greedy shortest paths | Statement | B | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1000.0 | 135341 | |
| 3770 | 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 | |
| 108 | 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 | |
| 2651 | Another Exercise on Graphs (Easy Version) | binary search brute force dp graphs shortest paths | Statement | E1 | Hello 2025 {2057} | PROGRAMMING | 1000.0 | ||
| 1537 | 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 | ||
| 15366 | Gellyfish and Flaming Peony | brute force constructive algorithms dp greedy math number theory shortest paths | Statement | A | Codeforces Round 1028 (Div. 1) {2115} | PROGRAMMING | 500.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 2540 | 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 | |
| 1017 | 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 | ||
| 910 | 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 |