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
< 1 2 3 4 5 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 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 | |
| 715 | Starry Night Camping | flows graphs | Statement | G | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 3000.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 907 | Off by One | constructive algorithms dfs and similar geometry graphs sortings trees | Statement | E | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 4259 | To Go Or Not To Go? | dfs and similar graphs greedy shortest paths | Statement | G | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 2315 | Nastia Plays with a Tree | constructive algorithms data structures dfs and similar dp flows graphs greedy implementation trees | Statement | D | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2250.0 | 90477 | |
| 2980 | Trees of Tranquillity | data structures dfs and similar greedy trees | Statement | C | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 1750.0 | Codeforces Round #722 Editorial | |
| 1708 | It's a bird! No, it's a plane! No, it's AaParsa! | graphs shortest paths | Statement | D | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 2000.0 | Codeforces Round #722 Editorial | |
| 10125 | Secret Santa | constructive algorithms flows graphs math probabilities | Statement | D | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 1500.0 | Codeforces Round #733 Editorial (all problems) | |
| 61 | Excursions | *special constructive algorithms dfs and similar flows graphs | Statement | I | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 98 | Biome Map | *special constructive algorithms dfs and similar graphs | Statement | G | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 13890 | Little Alawn's Puzzle | combinatorics dfs and similar dp dsu graphs math | Statement | C | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1250.0 | Codeforces LATOKEN Round 1 (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 | |
| 710 | Falling Sand (Hard Version) | dfs and similar dp graphs greedy | Statement | F2 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 1406 | Falling Sand (Easy Version) | dfs and similar graphs greedy | Statement | F1 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1750.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 264 | Lost Nodes | dp graphs interactive sortings trees | Statement | H | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 3500.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 2740 | Omkar and Forest | combinatorics graphs math shortest paths | Statement | E | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 2250.0 | Codeforces Round #724 — Editorial | 2300 |
| 2820 | Figure Fixing | constructive algorithms dfs and similar dsu graphs math | Statement | F | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 2000.0 | Codeforces Round #726 (Div.2) Editorial | |
| 15021 | Great Graphs | constructive algorithms graphs greedy shortest paths sortings | Statement | A | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 500.0 | Tutorial | |
| 452 | The Final Pursuit | constructive algorithms graphs greedy | Statement | E | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 3000.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 769 | AquaMoon and Permutations | combinatorics constructive algorithms graph matchings graphs | Statement | C | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 1500.0 | Codeforces Round #732 Editorial | 2800 |
| 3562 | How Many Paths? | dfs and similar dp graphs trees | Statement | G | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 17767 | Web of Lies | brute force graphs greedy | Statement | A | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 500.0 | Codeforces Round 736 Editorial | |
| 602 | Gregor and the Two Painters | data structures graphs math | Statement | E | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 3500.0 | Codeforces Round 736 Editorial | |
| 26960 | Gregor and the Pawn Game | flows graphs greedy implementation | Statement | B | Codeforces Round 736 (Div. 2) {1549} | PROGRAMMING | 750.0 | Codeforces Round 736 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 | ||
| 7912 | Array Differentiation | bitmasks dp graphs math | Statement | D | Codeforces Global Round 15 {1552} | PROGRAMMING | 1000.0 | Editorial of Global Round 15 | |
| 16981 | Running for Gold | combinatorics graphs greedy probabilities sortings | Statement | B | Codeforces Global Round 15 {1552} | PROGRAMMING | 500.0 | Editorial of Global Round 15 | |
| 1220 | Common Divisor Graph | binary search dsu graphs math number theory | Statement | G | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 3000.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 3789 | 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 | |
| 1059 | Good Graph | data structures dsu graphs trees | Statement | F | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 2700 | |
| 1423 | Sports Betting | bitmasks combinatorics dp graphs math probabilities | Statement | F | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 2500.0 | 94384 | 2500 |
| 446 | DIY Tree | graphs greedy math | Statement | H | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 3500.0 | 94384 | 3300 |
| 3016 | Ezzat and Grid | data structures dp graphs greedy | Statement | D | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 2500.0 | Codeforces Round #737 Editorial | |
| 704 | 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 |
| 22963 | Mocha and Hiking | constructive algorithms graphs | Statement | C | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1000.0 | Tutorial (en) | 1200 |
| 16163 | 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 |
| 3081 | 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 |
| 385 | Four Vertices | constructive algorithms data structures graphs greedy implementation shortest paths | Statement | G | Codeforces Global Round 16 {1566} | PROGRAMMING | 3000.0 | Codeforces Global Round 16 Editorial | |
| 4456 | Buds Re-hanging | dfs and similar graphs greedy trees | Statement | E | Codeforces Global Round 16 {1566} | PROGRAMMING | 2000.0 | Codeforces Global Round 16 Editorial | |
| 882 | One-Four Overload | 2-sat constructive algorithms dfs and similar geometry graphs implementation | Statement | F | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 2750.0 | Codeforces Round #742 Editorial | |
| 380 | Palindromic Hamiltonian Path | brute force dp graphs | Statement | F | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
| 10481 | Book | binary search data structures dp graphs implementation | Statement | A | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 500.0 | Tutorial | 1800 |
| 626 | Bridge Club | flows graphs greedy | Statement | D | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 2500.0 | Tutorial | 2800 |
| 747 | Occurrences | combinatorics dp dsu fft graphs | Statement | F | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 4864 | 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 | ||
| 425 | Anti-Tetris | constructive algorithms graphs shortest paths | Statement | A | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 410 | Kingdom of Islands | graphs implementation | Statement | K | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 5382 | 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 | ||
| 18497 | Productive Meeting | graphs greedy | Statement | D | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 124 | 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 |
| 12540 | Diameter of Graph | constructive algorithms graphs greedy math | Statement | B | Codeforces Round 745 (Div. 2) {1581} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 1200 |
| 2493 | Moment of Bloom | constructive algorithms dfs and similar graph matchings graphs greedy | Statement | E | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 2250.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 1118 | Strange LCS | bitmasks dp graphs greedy strings | Statement | F | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 2500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2600 |
| 310 | Poachers | dp games graphs trees | Statement | G | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 3500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 355 | Jumping Through the Array | data structures graphs two pointers | Statement | F | Codeforces Round 755 (Div. 1, based on Technocup 2022 Elimination Round 2) {1588} | PROGRAMMING | 3750.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 3500 |
| 9183 | Bakry and Partitioning | bitmasks constructive algorithms dfs and similar dp graphs trees | Statement | C | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1500.0 | 95583 | |
| 9511 | The Number of Imposters | constructive algorithms dfs and similar dp dsu graphs | Statement | D | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1750.0 | 95525 | 1700 |
| 132 | Desert | data structures graphs | Statement | I | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | Tutorial | ||
| 5518 | Frog Traveler | data structures dp graphs shortest paths | Statement | B | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 1250.0 | 95865 | 1900 |
| 3261 | Treelabeling | bitmasks constructive algorithms dfs and similar games graphs greedy trees | Statement | D | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2000.0 | tutorial | 2100 |
| 2137 | Robot on the Board 2 | dfs and similar graphs | Statement | F | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 1563 | Dominoes | combinatorics fft graphs math | Statement | D | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 7398 | Game Master | data structures dfs and similar dp graphs greedy two pointers | Statement | C | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 8436 | Social Network | dsu graphs greedy implementation trees | Statement | D | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 2000.0 | Deltix Round, Autumn 2021. Editorial | 1600 |
| 710 | Mashtali: a Space Oddysey | constructive algorithms dfs and similar graphs implementation | Statement | F | Codeforces Global Round 17 {1610} | PROGRAMMING | 2750.0 | Codeforces Global Round 17 Editorial | |
| 5913 | Crazy Robot | constructive algorithms dfs and similar graphs | Statement | E | Educational Codeforces Round 118 (Rated for Div. 2) {1613} | PROGRAMMING | 97467 | ||
| 2139 | X(or)-mas Tree | 2-sat bitmasks dfs and similar graphs trees | Statement | D | Codeforces Global Round 18 {1615} | PROGRAMMING | 2250.0 | Global Round 18 Editorial | |
| 9221 | Menorah | brute force graphs greedy math | Statement | C | Codeforces Global Round 18 {1615} | PROGRAMMING | 1750.0 | Global Round 18 Editorial | |
| 388 | Reindeer Games | constructive algorithms flows graphs shortest paths | Statement | H | Codeforces Global Round 18 {1615} | PROGRAMMING | 4000.0 | Global Round 18 Editorial | |
| 722 | Tricolor Triangles | graphs math matrices | Statement | F | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 3000.0 | Good Bye 2021 -- Editorial | 2900 |
| 425 | Just Add an Edge | dfs and similar dp graphs | Statement | G | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 3500.0 | Good Bye 2021 -- Editorial | 3500 |
| 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) | |
| 199 | Trains and Airplanes | graphs shortest paths | Statement | H | Hello 2022 {1621} | PROGRAMMING | 3500.0 | ||
| 1155 | Cats on the Upgrade (easy version) | data structures dfs and similar divide and conquer dp graphs trees | Statement | E1 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 664 | Cats on the Upgrade (hard version) | data structures dfs and similar graphs trees | Statement | E2 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 656 | Not Splitting | geometry graphs implementation shortest paths | Statement | F | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 2750.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 920 | Making It Bipartite | flows graphs number theory | Statement | F | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #768 | |
| 1760 | Spanning Tree Queries | binary search data structures dsu graphs implementation math sortings | Statement | E | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 2213 | Fair Share | constructive algorithms data structures dfs and similar graph matchings graphs | Statement | E | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 2736 | Cars | constructive algorithms dfs and similar dsu graphs greedy sortings | Statement | E | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 16001 | Inversion Graph | dsu graphs math | Statement | C | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 1250.0 | Codeforces Round #771 Editorial | |
| 0 | Treasure Hunt | graphs graphs graphs interactive interactive | Statement | D | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs graphs interactive interactive | Statement | C | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | A | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | B | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | E | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | F | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | G | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | H | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | I | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | J | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | K | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 17146 | Madoka and the Elegant Gift | brute force graphs implementation | Statement | B | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 1250.0 | Codeforces Round #777 Editorial | |
| 516 | Air Reform | data structures dfs and similar divide and conquer dsu graphs implementation trees | Statement | E | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2500.0 | Codeforces Round #775 Editorial | |
| 186 | Two Avenues | data structures dfs and similar graphs | Statement | F | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 3750.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 | ||
| 6559 | 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 | ||
| 2369 | 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 |
| 461 | 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 |
| 1233 | Parametric MST | binary search graphs greedy math ternary search | Statement | F | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3000.0 | Tutorial | |
| 154 | Neighbour Ordering | constructive algorithms graphs | Statement | I | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 4500.0 | Tutorial | |
| 2506 | Star MST | combinatorics dp math | Statement | E | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 1980 | 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 | |
| 20836 | 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 | ||
| 1248 | 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 | ||
| 1596 | Circular Maze | dfs and similar graphs implementation | Statement | O | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 298 | Training Camp | flows graphs | Statement | J | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 383 | European Trip | graphs | Statement | C | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 3722 | Labyrinth | dfs and similar graphs | Statement | L | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 11020 | Where is the Pizza? | data structures dfs and similar dsu graphs implementation math | Statement | C | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 1750.0 | Tutorial | 1400 |
| 3566 | Array Shuffling | constructive algorithms graphs greedy | Statement | F1 | Codeforces Global Round 20 {1672} | PROGRAMMING | 1250.0 | Global Round 20 Editorial | 2000 |
| 939 | Checker for Array Shuffling | constructive algorithms dfs and similar graphs | Statement | F2 | Codeforces Global Round 20 {1672} | PROGRAMMING | 1250.0 | Global Round 20 Editorial | 2800 |
| 462 | Cross Xor | graphs math | Statement | G | Codeforces Global Round 20 {1672} | PROGRAMMING | 2750.0 | Global Round 20 Editorial | 3200 |
| 2919 | Remove Directed Edges | dfs and similar dp graphs | Statement | G | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 14863 | Vertical Paths | graphs implementation trees | Statement | D | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 24425 | White-Black Balanced Subtrees | dfs and similar dp graphs trees | Statement | G | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 4099 | Tokitsukaze and Two Colorful Tapes | constructive algorithms dfs and similar dsu graphs greedy | Statement | C | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 1250.0 | Tutorial | |
| 5867 | Toss a Coin to Your Graph... | binary search dfs and similar dp graphs | Statement | D | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 1750.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 908 | Lenient Vertex Cover | data structures dfs and similar divide and conquer dsu graphs | Statement | F | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 752 | Unordered Swaps | constructive algorithms dfs and similar graphs greedy math sortings | Statement | E | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2500.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 395 | MCMF? | data structures flows graphs greedy sortings two pointers | Statement | F | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2750.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 4155 | Railway System | constructive algorithms dsu graphs greedy interactive sortings | Statement | B | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 796 | |
| 1368 | 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) | |
| 8970 | Shifting String | graphs math number theory strings | Statement | F | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 1700 | |
| 2105 | Number of Groups | data structures dfs and similar dsu graphs greedy sortings | Statement | E | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 2250.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 3203 | Keshi in Search of AmShZ | graphs greedy shortest paths | Statement | C | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 1500.0 | Codeforces Round #800 Editorial | 2300 |
| 514 | Ambiguous Dominoes | constructive algorithms dfs and similar graphs | Statement | E | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 6032 | 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 | |
| 1144 | 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 | |
| 1452 | 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 | ||
| 760 | Equal Reversal | constructive algorithms graphs math | Statement | F | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 2500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 18160 | Split Into Two Sets | dfs and similar dsu graph matchings graphs | Statement | E | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 2695 | 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 | |
| 1924 | DFS Trees | data structures dfs and similar dsu graphs greedy trees | Statement | C | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1250.0 | 104930 | |
| 683 | Multiset of Strings | dp fft flows graphs greedy math | Statement | F | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 14412 | Party | brute force graphs | Statement | B | Codeforces Round 810 (Div. 2) {1711} | PROGRAMMING | 1000.0 | Codeforces Round #810 Editorial | |
| 6132 | 2+ doors | 2-sat bitmasks graphs greedy schedules | Statement | D | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 2250.0 | Codeforces Round #816 (Div. 2) editorial | |
| 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 | |
| 640 | Madoka and The First Session | constructive algorithms dfs and similar flows graph matchings graphs | Statement | F | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 3000.0 | Codeforces Round #818 (Div. 2) Editorial. | 2500 |
| 180 | Impressionism | constructive algorithms graphs implementation math | Statement | E | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 2250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 299 | Imitating the Key Tree | combinatorics dsu trees | Statement | I | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 4479 | Moving Both Hands | dp graphs shortest paths | Statement | M | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 4174 | 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 | |
| 13424 | Jatayu's Balanced Bracket Sequence | data structures dsu graphs | Statement | C | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 1500.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 10969 | Phase Shift | dfs and similar dsu graphs greedy strings | Statement | C | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 1250.0 | Codeforces Round #824 — editorial | |
| 2110 | Ela and the Wiring Wizard | graphs greedy shortest paths | Statement | D | Dytechlab Cup 2022 {1737} | PROGRAMMING | 2000.0 | Editorial of Dytechlab Cup 2022 | |
| 3763 | Permutation Addicts | constructive algorithms dfs and similar dsu graphs trees | Statement | D | Codeforces Global Round 22 {1738} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 1390 | 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> | |
| 6289 | Reset K Edges | binary search data structures dfs and similar graphs greedy trees | Statement | D | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 152 | Arranging Crystal Balls | data structures divide and conquer divide and conquer dp geometry graphs number theory | Statement | I | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 3500.0 | Tutorial | 3500 |
| 1948 | Kirill and Company | bitmasks brute force dp graphs shortest paths | Statement | G | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 18426 | Masha and a Beautiful Tree | dfs and similar divide and conquer graphs sortings trees | Statement | D | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 2078 | Cactus Wall | dfs and similar graphs shortest paths | Statement | E | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 2085 | The Beach | graphs shortest paths | Statement | D | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 2000.0 | Tutorial | 2400 |
| 1016 | Tick, Tock | 2-sat combinatorics dfs and similar dsu graphs | Statement | E | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 2250.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 10435 | 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 | ||
| 10761 | Set Construction | constructive algorithms dfs and similar graphs greedy | Statement | C | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1250.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 2167 | Make It Connected | constructive algorithms graphs greedy | Statement | E | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1750.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 645 | Edge Queries | data structures dp graphs | Statement | F | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 3000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 2219 | Node Pairs | dp graphs math | Statement | E | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 2000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 1534 | Hospital Queue | binary search graphs greedy | Statement | H | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2200 | |
| 1259 | 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 | ||
| 11230 | Playoff | combinatorics constructive algorithms dp graphs greedy | Statement | D | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 9086 | Lucky Permutation | dfs and similar dsu graphs greedy | Statement | D | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1750.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 4408 | Koxia and Game | data structures dfs and similar dsu games graph matchings graphs implementation | Statement | D | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 1500.0 | Good Bye 2022 -- Editorial | |
| 8604 | 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 | |
| 4182 | Train Splitting | constructive algorithms graphs greedy | Statement | F | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 881 | Italian Data Centers | graphs | Statement | J | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 2355 | Edge Reverse | binary search dfs and similar dsu graphs | Statement | E | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2250.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 872 | Maximizing Root | dfs and similar dp graphs math trees | Statement | F | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 2750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 2048 | Anya's Simultaneous Exhibition | constructive algorithms data structures graphs greedy interactive sortings | Statement | E | Hello 2023 {1779} | PROGRAMMING | 2250.0 | ||
| 388 | The Game of the Century | constructive algorithms graphs shortest paths | Statement | G | Hello 2023 {1779} | PROGRAMMING | 2750.0 | ||
| 1323 | Double Sort II | dfs and similar flows graphs greedy | Statement | F | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 3829 | Game on Axis | combinatorics dsu graphs implementation | Statement | D | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 2000.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 1177 | XOR, Tree, and Queries | constructive algorithms dfs and similar dsu graphs trees | Statement | F | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 3000.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 4025 | 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 | ||
| 1319 | Tokens on Graph | constructive algorithms dfs and similar graphs shortest paths | Statement | G | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 820 | Removal Sequences | bitmasks graphs | Statement | G | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 1037 | Colored Subgraphs | data structures dp greedy trees | Statement | E | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 15344 | 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 | ||
| 15675 | 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 | ||
| 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 | |
| 1180 | Approximate Diameter | binary search divide and conquer graphs shortest paths | Statement | F | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 2750.0 | Nebius Welcome Round Editorial | |
| 1714 | Routing | bitmasks dp graphs | Statement | E | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 2000.0 | Nebius Welcome Round Editorial | |
| 14224 | Place for a Selfie | binary search geometry math sortings | Statement | C | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 1923 | There Should Be a Lot of Maximums | data structures dfs and similar dsu graphs trees | Statement | E | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 936 | Traveling in Berland | binary search data structures graphs greedy implementation | Statement | F | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 3944 | 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!) | |
| 2184 | Is It Flower? | dfs and similar dsu graphs implementation | Statement | F | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 3622 | 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 |
| 2367 | 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 |
| 316 | OH NO1 (-2-3-4) | constructive algorithms graphs math shortest paths | Statement | F | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #865 | 3500 |
| 5145 | 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 | |
| 7710 | 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 | ||
| 1302 | Random Walk | dp graphs math probabilities trees | Statement | F | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2500.0 | 115465 | |
| 1456 | Removing Graph | games graphs math | Statement | E | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2000.0 | 115465 | |
| 1966 | 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 |
| 560 | Bus Routes | binary search constructive algorithms dfs and similar greedy trees | Statement | E | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 2500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 3400 |
| 27027 | The Lakes | dfs and similar dsu graphs implementation | Statement | E | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1100 | |
| 21986 | Forever Winter | dfs and similar graphs math | Statement | F | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1300 | |
| 20635 | Copil Copac Draws Trees | dfs and similar dp graphs trees | Statement | A | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 500.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 18799 | Round Dance | dsu graphs shortest paths | Statement | E | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 235 | Good Graph | bitmasks graph matchings graphs implementation | Statement | F | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 3000.0 | Codeforces Round 880 Editorial | |
| 658 | Doctor's Brown Hypothesis | dfs and similar graphs math number theory | Statement | D | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 1750.0 | Codeforces Round 880 Editorial | |
| 2126 | Railguns | dfs and similar dp graphs implementation | Statement | F | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 4767 | 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 | |
| 485 | Min Cost Permutation (Hard Version) | binary search data structures graphs greedy sortings | Statement | F2 | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 2168 | Great Grids | constructive algorithms dfs and similar dsu graphs math | Statement | E | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 2000.0 | Codeforces Round #884 (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 | |||
| 10059 | The Third Letter | dfs and similar graphs greedy implementation | Statement | H | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 4088 | Vlad and the Mountains | data structures dsu graphs implementation sortings trees two pointers | Statement | G | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 13372 | Nastya and Potions | dfs and similar dp graphs greedy shortest paths sortings | Statement | E | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 5523 | Counting Graphs | combinatorics divide and conquer dsu graphs greedy sortings | Statement | G | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 56098 | United We Stand | constructive algorithms graphs math | Statement | A | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 500.0 | Video solutions from Geothermal. | |
| 527 | 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. | |
| 1825 | 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 | ||
| 3210 | Speedrun | brute force data structures dfs and similar dp graphs sortings | Statement | E | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 1750.0 | ||
| 835 | Swaps | combinatorics graphs | Statement | G | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 2750.0 | ||
| 107 | Future Dominators | graphs greedy | Statement | I | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 4250.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 3433 | Completely Searching for Inversions | dfs and similar dp graphs | Statement | C | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 6899 | Cyclic Operations | constructive algorithms dfs and similar graphs greedy implementation | Statement | D | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.0 | ||
| 2768 | Candy Party (Hard Version) | bitmasks constructive algorithms dp graphs greedy implementation math | Statement | B2 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 8355 | Candy Party (Easy Version) | bitmasks constructive algorithms graphs greedy implementation math | Statement | B1 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 383 | Flower-like Pseudotree | constructive algorithms graphs implementation trees | Statement | D | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 1750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 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 | |
| 122 | Standard Graph Problem | data structures graphs greedy trees | Statement | H | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 4000.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 7579 | Selling a Menagerie | dfs and similar dsu graphs implementation math | Statement | F | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 9599 | Mad City | dfs and similar dsu graphs shortest paths | Statement | H | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 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 | |
| 2202 | Jellyfish and EVA | dp graphs greedy math probabilities | Statement | C | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 1500.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 2728 | Autosynthesis | 2-sat constructive algorithms dfs and similar dp flows graphs trees | Statement | C | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 1250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 186 | Indefinite Clownfish | binary search graphs | Statement | F | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 2750.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 1050 | Lexichromatography | combinatorics dfs and similar dsu graphs two pointers | Statement | D | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 1750.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 1584 | 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 | |
| 9675 | Minimum Maximum Distance | dfs and similar dp graphs shortest paths trees | Statement | F | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 509 | Good Colorings | binary search constructive algorithms graphs interactive | Statement | E | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 2000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 3960 | Time Travel | binary search graphs implementation shortest paths | Statement | B | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 750.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 941 | Game of Stacks | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 2000.0 | Codeforces Round 906 Editorial | |
| 180 | Doremy's Swapping Trees | dfs and similar graphs trees | Statement | E | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 3500.0 | Codeforces Round 906 Editorial | |
| 282 | Cacti Symphony | combinatorics dfs and similar dp graphs | Statement | E | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 2750.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 1871 | 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 | ||
| 9580 | Alex's whims | constructive algorithms graphs shortest paths trees | Statement | F | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 2655 | Transitive Graph | constructive algorithms dfs and similar dp graphs implementation | Statement | E | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 2250.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 1994 | Compressed Tree | dfs and similar dp graphs greedy trees | Statement | E | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 927 | Babysitting | 2-sat binary search data structures graphs | Statement | F | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 3500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 519 | Beautiful Tree | data structures dfs and similar graphs trees | Statement | F | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 3500.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 1104 | Count BFS Graph | combinatorics dp | Statement | J | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 2346 | Lights | constructive algorithms dfs and similar graphs greedy implementation | Statement | G | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 608 | Hypercatapult Commute | graphs | Statement | H | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 2400 | |
| 1343 | Matrix Problem | flows graph matchings graphs | Statement | E | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 |