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 |
|---|---|---|---|---|---|---|---|---|---|
| 4347 | PFAST Inc. | bitmasks brute force graphs | Statement | B | Codeforces Beta Round 86 (Div. 2 Only) {114} | PROGRAMMING | Codeforces Beta Round #86 Editorial | 1500 | |
| 14168 | Students and Shoelaces | brute force dfs and similar graphs implementation | Statement | B | Codeforces Beta Round 94 (Div. 2 Only) {129} | PROGRAMMING | Problem D of Beta Round 94 | 1200 | |
| 3101 | Party | brute force dfs and similar dsu graphs | Statement | C2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1500 | ||
| 25537 | Ice Skating | brute force dfs and similar dsu graphs | Statement | A | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 1400 | |
| 566 | Suggested Friends | brute force graphs | Statement | G | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | CROC-MBTU 2012, Elimination Round — Editorial | 2200 | |
| 10423 | Colorful Graph | brute force dfs and similar graphs | Statement | D | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | Codeforces Round #151 (Div. 2) Tutorial | 1700 | |
| 672 | 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 | |
| 7364 | Coach | brute force dfs and similar graphs | Statement | B | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 1500 | |
| 989 | Minimum Modular | brute force graphs math number theory | Statement | C | Codeforces Round 183 (Div. 1) {303} | PROGRAMMING | Codeforces Round #183 Editorial | 2700 | |
| 604 | Fetch the Treasure | brute force data structures graphs shortest paths | Statement | C | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | Codeforces Round #185 Editorial | 2600 | |
| 992 | Pumping Stations | brute force dfs and similar divide and conquer flows graphs greedy trees | Statement | E | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2800 | |
| 9688 | Simple Molecules | brute force graphs math | Statement | B | Codeforces Round 200 (Div. 2) {344} | PROGRAMMING | Codeforces Round #200 Tutorial | 1300 | |
| 885 | Wrong Floyd | brute force constructive algorithms dfs and similar graphs | Statement | E | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 2200 | |
| 448 | Dima and Kicks | brute force dsu graphs implementation | Statement | E | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 2600 | |
| 6454 | Searching for Graph | brute force constructive algorithms graphs | Statement | C | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 1500 | |
| 9428 | Strongly Connected City | brute force dfs and similar graphs implementation | Statement | B | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 1400 | |
| 7129 | Unbearable Controversy of Being | brute force combinatorics dfs and similar graphs | Statement | D | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 1700 | |
| 2623 | Mr. Kitayuta's Colorful Graph | brute force dfs and similar dsu graphs | Statement | D | Codeforces Round 286 (Div. 1) {506} | PROGRAMMING | Editorial | 2300 | |
| 4239 | Amr and Chemistry | brute force graphs greedy math shortest paths | Statement | C | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 2000 | |
| 8438 | Bear and Three Musketeers | brute force dfs and similar graphs hashing | Statement | B | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 2) {574} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 1500 | |
| 1349 | Magic Matrix | brute force divide and conquer graphs matrices trees | Statement | F | Educational Codeforces Round 9 {632} | PROGRAMMING | 43493 | 2400 | |
| 3283 | Orchestra | brute force implementation | Statement | A | 8VC Venture Cup 2016 - Final Round (Div. 2 Edition) {635} | PROGRAMMING | 8VC Venture Cup 2016 — Final Round Editorial | 1200 | |
| 815 | Three-dimensional Turtle Super Computer | brute force dfs and similar graphs | Statement | D | VK Cup 2016 - Qualification Round 2 {638} | PROGRAMMING | 2200 | ||
| 407 | Bear and Chase | brute force dfs and similar graphs implementation math probabilities | Statement | D | Codeforces Round 356 (Div. 1) {679} | PROGRAMMING | Codeforces Round #356 — Editorial | 2900 | |
| 682 | Travelling Through the Snow Queen's Kingdom | bitmasks brute force divide and conquer graphs | Statement | E | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | Codeforces Round #359 Editorial | 2700 | |
| 1168 | Dividing Kingdom II | brute force data structures dsu graphs sortings | Statement | D | Codeforces Round 360 (Div. 1) {687} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 2500 | |
| 20259 | PolandBall and Hypothesis | brute force graphs math number theory | Statement | A | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 900 | |
| 1067 | Mother of Dragons | brute force graphs math meet-in-the-middle | Statement | E | Codeforces Round 428 (Div. 2) {839} | PROGRAMMING | Codeforces Round #428 editorial | 2600 | |
| 792 | Dating | brute force dfs and similar graphs trees | Statement | I | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2500 | |
| 165 | Hex Dyslexia | bitmasks brute force dp graphs | Statement | E | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 2700 | |
| 372 | The Overdosing Ubiquity | brute force dfs and similar graphs | Statement | D | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | Tutorial | 2800 | |
| 1584 | Party | bitmasks brute force dp graphs | Statement | C | Codeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4) {906} | PROGRAMMING | Editorial Codeforces Round 454 (and Technocup 2018 — Elimination Round 4) | 2300 | |
| 15641 | Protect Sheep | brute force dfs and similar graphs implementation | Statement | A | Codeforces Round 470 (rated, Div. 2, based on VK Cup 2018 Round 1) {948} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 1000 | |
| 2204 | 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 | |
| 6749 | Relatively Prime Graph | brute force constructive algorithms graphs greedy math | Statement | D | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1700 | |
| 26153 | Badge | brute force dfs and similar graphs | Statement | B | Codeforces Round 503 (by SIS, Div. 2) {1020} | PROGRAMMING | Codeforces Round #503 (based on SIS olympiad) — Editorial | 1000 | |
| 327 | Familiar Operations | brute force graphs math | Statement | F | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 2700 | |
| 1170 | Maximum Matching | bitmasks brute force dfs and similar dp graphs | Statement | E | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2400 | |
| 370 | Take Metro | brute force data structures graphs | Statement | G | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 2800 | |
| 18609 | New Year and the Christmas Ornament | brute force implementation math | Statement | A | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 900 | |
| 2455 | Elongated Matrix | binary search bitmasks brute force dp graphs | Statement | F | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 2400 | |
| 1555 | Sasha and Interesting Fact from Graph Theory | brute force combinatorics dp math trees | Statement | D | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2600 | |
| 1145 | Abandoning Roads | brute force dp graphs greedy | Statement | D | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 2900 | |
| 577 | Delivery Oligopoly | brute force dp graphs | Statement | F | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 2700 | |
| 1057 | Magical Permutation | bitmasks brute force constructive algorithms data structures graphs math | Statement | E | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2800 | |
| 1245 | Graph Traveler | brute force data structures dfs and similar dp graphs implementation math number theory | Statement | F | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2500 | |
| 7653 | Shortest Cycle | bitmasks brute force graphs shortest paths | Statement | B | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 1900 | |
| 5584 | Anadi and Domino | brute force graphs | Statement | A | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 1600 | |
| 503 | Marek and Matching (easy version) | brute force probabilities | Statement | F1 | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2900 | |
| 529 | Marek and Matching (hard version) | brute force probabilities | Statement | F2 | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 3100 | |
| 5473 | Complete Tripartite | brute force constructive algorithms graphs hashing implementation | Statement | D | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 1800 | |
| 8429 | Paint the Tree | brute force constructive algorithms dp graphs implementation trees | Statement | D | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1700 | |
| 964 | Invertation in Tournament | brute force divide and conquer graphs math | Statement | D | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 3100 | |
| 2038 | 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 | |
| 2119 | Tourism | brute force dp graphs probabilities | Statement | D | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 2250.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2300 |
| 2441 | 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 |
| 19759 | Princesses and Princes | brute force graphs greedy | Statement | B | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 1300 | |
| 3603 | Infinite Path | brute force dfs and similar graphs math number theory | Statement | D | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2200 | |
| 4187 | Challenges in school №41 | brute force constructive algorithms games graphs greedy implementation sortings | Statement | D | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1750.0 | Codeforces Round #632 (Div. 2) editorial | |
| 5882 | Weights Distributing | brute force graphs greedy shortest paths sortings | Statement | E | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 2400 | |
| 871 | Rearrange | brute force constructive algorithms graphs greedy sortings | Statement | D | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1750.0 | Codeforces Round #659 Editorial | |
| 2184 | Boboniu Walks on Graph | brute force graphs hashing implementation meet-in-the-middle | Statement | B | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1000.0 | Codeforces Round #664 Editorial | 2300 |
| 1697 | Graph Subset Problem | brute force data structures graphs | Statement | B | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 1250.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 2249 | Water Level | brute force graphs greedy implementation math | Statement | E | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 2250.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 6842 | Strange Definition | bitmasks brute force data structures graphs math number theory | Statement | B | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 750.0 | 86464 | |
| 15595 | Minimum Ties | brute force constructive algorithms dfs and similar graphs greedy implementation math | Statement | C | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 8466 | Pekora and Trampoline | brute force data structures dp graphs greedy implementation | Statement | C | Codeforces Global Round 13 {1491} | PROGRAMMING | 1000.0 | Codeforces Global Round 13 Editorial | |
| 2191 | Two Houses | brute force combinatorics graphs interactive probabilities sortings | Statement | E | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 2500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 183 | Optimal Encoding | brute force data structures | Statement | F | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 4000.0 | Codeforces Round #715 Editorial | |
| 6086 | King's Task | brute force graphs implementation | Statement | K | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 12593 | Min Cost String | brute force constructive algorithms dfs and similar graphs greedy | Statement | D | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 17941 | Web of Lies | brute force graphs greedy | Statement | A | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 500.0 | Codeforces Round 736 Editorial | |
| 3860 | Permutation Shift | brute force combinatorics constructive algorithms dfs and similar graphs math | Statement | E | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 1750.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 16611 | Mocha and Diana (Easy Version) | brute force constructive algorithms dsu graphs greedy trees | Statement | D1 | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1500.0 | Tutorial (en) | 1400 |
| 3250 | Mocha and Diana (Hard Version) | brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers | Statement | D2 | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1500.0 | Tutorial (en) | 2500 |
| 521 | Palindromic Hamiltonian Path | brute force dp graphs | Statement | F | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
| 5447 | Array Stabilization (AND version) | binary search brute force graphs greedy implementation math number theory shortest paths | Statement | F | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 126 | Railway Construction | brute force constructive algorithms data structures graphs shortest paths | Statement | E | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 3500.0 | Codeforces Round #745 Editorial | 3400 |
| 9295 | Menorah | brute force graphs greedy math | Statement | C | Codeforces Global Round 18 {1615} | PROGRAMMING | 1750.0 | Global Round 18 Editorial | |
| 17271 | Madoka and the Elegant Gift | brute force graphs implementation | Statement | B | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 1250.0 | Codeforces Round #777 Editorial | |
| 2387 | Arithmetic Operations | brute force divide and conquer graphs math | Statement | E | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2300 |
| 2035 | AND-MEX Walk | bitmasks brute force data structures dfs and similar dsu graphs greedy | Statement | E | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2250.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 21250 | 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 | ||
| 1425 | ANDfinity | bitmasks brute force constructive algorithms dfs and similar dsu graphs | Statement | E | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 1174 | Tree Recovery | bitmasks brute force constructive algorithms dfs and similar dsu graphs trees | Statement | F | Codeforces Global Round 21 {1696} | PROGRAMMING | 2500.0 | Editorial of Codeforces Global Round 21 | |
| 1493 | Coloring | brute force combinatorics constructive algorithms dfs and similar dp dsu graphs implementation | Statement | E | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 2749 | Count Seconds | brute force constructive algorithms dp graphs | Statement | E | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 2000.0 | CodeTON Round 2 Editorial | |
| 14698 | Party | brute force graphs | Statement | B | Codeforces Round 810 (Div. 2) {1711} | PROGRAMMING | 1000.0 | Codeforces Round #810 Editorial | |
| 4294 | Edge Split | brute force constructive algorithms dfs and similar graphs probabilities trees | Statement | D | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 2000.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 1993 | Kirill and Company | bitmasks brute force dp graphs shortest paths | Statement | G | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 11000 | SlavicG's Favorite Problem | bitmasks brute force constructive algorithms data structures dfs and similar graphs greedy | Statement | G | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 1342 | Algebra Flash | bitmasks brute force dp graphs meet-in-the-middle trees | Statement | E | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 4206 | 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 | ||
| 15687 | Unforgivable Curse (hard version) | brute force constructive algorithms constructive algorithms dsu graphs greedy | Statement | E2 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 16028 | Unforgivable Curse (easy version) | brute force constructive algorithms dsu graphs greedy | Statement | E1 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 4023 | Monsters | brute force data structures dfs and similar dsu graphs implementation trees | Statement | E | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 5291 | Fish Graph | brute force constructive algorithms dfs and similar graphs trees | Statement | B | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 1000.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 7912 | Gardening Friends | brute force dfs and similar dp graphs trees | Statement | F | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 2023 | Walk the Runway | bitmasks brute force data structures dp graphs implementation sortings | Statement | E | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 2500.0 | Codeforces Round #870 (Div. 2) Editorial | 2400 |
| 4858 | Tenzing and His Animal Friends | brute force constructive algorithms graphs greedy shortest paths | Statement | D | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 1500.0 | CodeTON Round 5 Editorial | |
| 3301 | Speedrun | brute force data structures dfs and similar dp graphs sortings | Statement | E | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 1750.0 | ||
| 1626 | Interactive Game with Coloring | brute force constructive algorithms graphs implementation interactive math trees | Statement | E | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 2400 | |
| 1935 | Infinite Card Game | brute force dfs and similar games graphs greedy sortings | Statement | E | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 2486 | Light Bulbs (Easy Version) | brute force combinatorics dfs and similar dp dsu graphs math | Statement | G1 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 2164 | Sasha and the Happy Tree Cutting | bitmasks brute force dp fft graphs greedy trees | Statement | E | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 2500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 17749 | Permutation Game | brute force dfs and similar games graphs greedy math | Statement | D | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1300 | |
| 919 | Min-Fund Prison (Medium) | brute force dfs and similar dp graphs trees | Statement | G2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2200 | |
| 452 | Kostyanych's Theorem | brute force graphs interactive | Statement | F | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 3000.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 7491 | Maximize the Largest Component (Easy Version) | brute force data structures dfs and similar dsu graphs implementation | Statement | H1 | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 23699 | Substring and Subsequence | bitmasks brute force dp graphs greedy hashing strings trees | Statement | B | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 3070 | Cases | bitmasks brute force combinatorics dfs and similar dp graphs greedy strings | Statement | D | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 2250.0 | Video Tutorial | |
| 3265 | Call During the Journey | binary search brute force graphs greedy shortest paths | Statement | G | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 180 | Dora's Paint | brute force combinatorics constructive algorithms graphs | Statement | F | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 3000.0 | Tutorial | |
| 7634 | Connect the Dots | brute force dfs and similar dp dsu graphs math trees | Statement | D | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 1500.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 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 | |
| 1407 | C+K+S | brute force constructive algorithms dfs and similar graphs greedy hashing math strings | Statement | C | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1500.0 | 135341 | |
| 7363 | Skipping | brute force data structures dp graphs greedy shortest paths | Statement | B | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1000.0 | 135341 | |
| 1879 | Matrix Transformation | bitmasks brute force dfs and similar graphs implementation | Statement | E | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 2335 | Mirror Maze | brute force dfs and similar graphs implementation | Statement | M | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 1800 | |
| 1248 | DAG Serialization | brute force graphs | Statement | D | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 2712 | Another Exercise on Graphs (Easy Version) | binary search brute force dp graphs shortest paths | Statement | E1 | Hello 2025 {2057} | PROGRAMMING | 1000.0 | ||
| 2025 | Another Exercise on Graphs (hard version) | binary search brute force dsu graphs shortest paths sortings trees | Statement | E2 | Hello 2025 {2057} | PROGRAMMING | 2000.0 | ||
| 15393 | 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 | |
| 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 | ||
| 434 | From Kazan with Love | brute force graphs trees | Statement | E | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 2500.0 | Codeforces Round #1031 Editorial | |
| 5452 | Omg Graph | brute force dsu graphs greedy shortest paths sortings | Statement | G | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 8686 | Red Light, Green Light (Easy version) | brute force dfs and similar dp graphs implementation | Statement | D1 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1250.0 | Codeforces Round 1030 (Div. 2) 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 | |
| 2691 | 23 Rises Again | brute force data structures dfs and similar dp flows graphs implementation probabilities trees | Statement | H | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 4000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 929 | Sea, You & copriMe | brute force combinatorics constructive algorithms graphs greedy math number theory | Statement | H | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 4694 | Monotone Subsequence | brute force constructive algorithms dp graphs interactive math | Statement | E | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 3000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 16820 | Cyclic Merging | brute force constructive algorithms graphs greedy trees | Statement | A | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 500.0 | 148452 | |
| 229 | Statistics on Tree | binary search brute force dfs and similar divide and conquer graphs trees | Statement | G | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 3500.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 1252 | Diameter Intersections | brute force dfs and similar fft graphs trees | Statement | E | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 |