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 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 24815 | Corrupted Array | constructive algorithms data structures greedy | Statement | D | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 5044 | Cut and Stick | binary search data structures greedy probabilities sortings | Statement | D | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 2000.0 | Codeforces round #716 editorial | |
| 18933 | Phoenix and Towers | constructive algorithms data structures greedy | Statement | C | Codeforces Global Round 14 {1515} | PROGRAMMING | 1500.0 | Editorial | |
| 2371 | 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 | |
| 9213 | Compression and Expansion | brute force data structures greedy implementation trees | Statement | C | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 1500.0 | Deltix Round, Spring 2021. Editorial | 1600 |
| 4862 | Robot Collisions | data structures greedy implementation sortings | Statement | C | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 27751 | Potions (Easy Version) | brute force data structures dp greedy | Statement | C1 | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 750.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 31405 | Potions (Hard Version) | data structures greedy | Statement | C2 | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 1000.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 3018 | 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 | |
| 285 | Chess Team Forming | *special binary search data structures greedy | Statement | E | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 3129 | Gold Transfer | binary search data structures greedy interactive trees | Statement | E | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 5131 | Omkar and Medians | data structures greedy implementation | Statement | D | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 2000.0 | Codeforces Round #724 — Editorial | 2000 |
| 6330 | Erase and Extend (Hard Version) | binary search data structures greedy hashing string suffix structures strings | Statement | E2 | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1750.0 | Codeforces Round #726 (Div.2) Editorial | |
| 12854 | PriceFixed | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 1500.0 | tutorial | 1600 |
| 1058 | Strange Array | data structures greedy sortings | Statement | F | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 2500.0 | tutorial | 2600 |
| 1920 | Stringforces | binary search bitmasks data structures dp greedy strings two pointers | Statement | E | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 16778 | Wonderful Coloring - 2 | binary search constructive algorithms data structures greedy | Statement | B2 | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 2146 | Colors and Intervals | constructive algorithms data structures greedy sortings | Statement | E | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 3041 | Equilibrium | data structures greedy | Statement | E | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 2000.0 | 94384 | 2200 |
| 3080 | Ezzat and Grid | data structures dp graphs greedy | Statement | D | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 2500.0 | Codeforces Round #737 Editorial | |
| 422 | 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 | |
| 8362 | Seating Arrangements (hard version) | data structures greedy implementation sortings two pointers | Statement | D2 | Codeforces Global Round 16 {1566} | PROGRAMMING | 1000.0 | Codeforces Global Round 16 Editorial | |
| 14760 | Seating Arrangements (easy version) | data structures greedy sortings | Statement | D1 | Codeforces Global Round 16 {1566} | PROGRAMMING | 750.0 | Codeforces Global Round 16 Editorial | |
| 4890 | The Strongest Build | data structures dfs and similar graphs greedy hashing implementation shortest paths | Statement | D | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 7487 | Array Optimization by Deque | data structures greedy | Statement | E2 | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 4278 | Pchelyonok and Segments | binary search data structures dp greedy math | Statement | E | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 2500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 25008 | Grandma Capa Knits a Scarf | data structures greedy strings two pointers | Statement | C | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 1490 | Game with Stones | binary search data structures games greedy | Statement | E | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 2000.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2300 |
| 1927 | Changing Brackets | data structures greedy | Statement | G | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 2380 | Optimal Insertion | data structures divide and conquer greedy sortings | Statement | C | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2000.0 | 95865 | 2300 |
| 1983 | Difficult Mountain | data structures dp greedy sortings | Statement | D | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2700 |
| 624 | Phys Ed Online | data structures dp greedy trees | Statement | E | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2900 |
| 7434 | 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) | |
| 551 | A Stroll Around the Matrix | data structures greedy math | Statement | G | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 3250.0 | Deltix Round, Autumn 2021. Editorial | 3000 |
| 686 | Squid Game | data structures dfs and similar divide and conquer greedy trees | Statement | H | Codeforces Global Round 17 {1610} | PROGRAMMING | 3500.0 | Codeforces Global Round 17 Editorial | |
| 768 | Robot and Candies | data structures greedy | Statement | G | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 2500 | |
| 2746 | Lexicographically Small Enough | data structures greedy strings | Statement | E | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 2500.0 | Good Bye 2021 -- Editorial | 2200 |
| 1986 | Trader Problem | binary search data structures dsu greedy math sortings | Statement | G | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 10328 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 9811 | Replace the Numbers | data structures dsu greedy trees | Statement | E | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1945 | New School | binary search data structures greedy implementation sortings | Statement | E | Hello 2022 {1621} | PROGRAMMING | 2250.0 | ||
| 14634 | Integers Shop | data structures greedy implementation | Statement | B | Hello 2022 {1621} | PROGRAMMING | 1000.0 | ||
| 1283 | Middle Duplication | data structures dfs and similar greedy strings trees | Statement | E | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 2750.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 11966 | Monsters And Spells | data structures dp fft greedy implementation two pointers | Statement | C | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 6525 | Range and Partition | binary search data structures greedy two pointers | Statement | B | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 3359 | Paint the Middle | data structures dp greedy sortings | Statement | C | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 5419 | New Year Concert | binary search data structures dp greedy math number theory two pointers | Statement | D | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #769 | |
| 1431 | Closest Pair | data structures greedy | Statement | F | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 3000.0 | Codeforces Round #772 Editorial | |
| 4492 | Rescheduling the Exam | binary search data structures greedy implementation math sortings | Statement | E | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 14635 | Alice and the Cake | constructive algorithms data structures greedy sortings | Statement | C | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 1400 |
| 473 | 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 |
| 2011 | 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 | |
| 4479 | Reverse Sort Sum | constructive algorithms data structures greedy implementation math two pointers | Statement | D | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2000.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 5421 | Progressions Covering | data structures greedy implementation | Statement | D | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 1849 | MinimizOR | binary search bitmasks data structures dp greedy implementation | Statement | E | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 2250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 41819 | Eating Candies | binary search data structures greedy two pointers | Statement | F | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1100 | |
| 257 | PermutationForces | data structures greedy | Statement | I | Codeforces Global Round 20 {1672} | PROGRAMMING | 4000.0 | Global Round 20 Editorial | 3000 |
| 5719 | Desktop Rearrangement | data structures greedy implementation | Statement | F | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 20527 | Longest Strike | data structures greedy implementation sortings two pointers | Statement | F | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 978 | Labyrinth Adventures | data structures dp greedy matrices shortest paths | Statement | E | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 2600 | |
| 453 | 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 | |
| 3683 | MEX vs DIFF | brute force constructive algorithms data structures greedy two pointers | Statement | E | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 1750.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 2100 |
| 19205 | Mystic Permutation | data structures greedy implementation | Statement | B | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 750.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 28244 | Restoring the Duration of Tasks | data structures greedy implementation | Statement | C | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 800 | |
| 2141 | 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) | |
| 1146 | Decinc Dividing | brute force data structures divide and conquer dp greedy | Statement | D | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 2250.0 | Codeforces Round #800 Editorial | 2800 |
| 563 | Outermost Maximums | data structures greedy | Statement | E | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 2500.0 | Codeforces Round #800 Editorial | 3400 |
| 14478 | 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 | |
| 6059 | 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 | |
| 15905 | awoo's Favorite Problem | constructive algorithms data structures dp greedy implementation strings two pointers | Statement | C | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 3571 | Almost Triple Deletions | data structures dp greedy | Statement | D | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 1750.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 6317 | Permutation Restoration | binary search data structures greedy math sortings | Statement | D | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 9575 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 25455 | Train and Queries | data structures greedy | Statement | C | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 31524 | Yet Another Problem About Pairs Satisfying an Inequality | binary search data structures dp greedy sortings | Statement | F | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 2504 | Mark and Professor Koro | binary search bitmasks combinatorics data structures greedy | Statement | E | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 2500.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 1961 | DFS Trees | data structures dfs and similar dsu graphs greedy trees | Statement | C | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1250.0 | 104930 | |
| 4147 | XOR Tree | data structures dfs and similar dsu greedy trees | Statement | E | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 5173 | Empty Graph | binary search data structures greedy | Statement | D | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 2000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 10613 | Monoblock | brute force combinatorics data structures divide and conquer greedy implementation | Statement | C | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 1750.0 | Codeforces Round #816 (Div. 2) editorial | |
| 3527 | Fibonacci Strings | brute force data structures greedy implementation math number theory | Statement | B | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 1250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 1882 | Tonya and Burenka-179 | brute force data structures greedy math number theory | Statement | C | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 1250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 5968 | Burenka and Traditions (hard version) | data structures dp greedy math two pointers | Statement | A2 | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 500.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 22490 | Interesting Sum | data structures greedy math | Statement | B | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1000.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 131 | Late For Work | data structures greedy schedules shortest paths | Statement | F | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 2750.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 18089 | Digital Logarithm | data structures greedy | Statement | C | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 18042 | Minimum Notation | data structures greedy math sortings | Statement | C | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 1500.0 | Codeforces Round #823 — editorial | 1200 |
| 24979 | Planets | data structures data structures greedy sortings | Statement | A | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 500.0 | Codeforces Round #823 — editorial | 800 |
| 7118 | Slime Escape | data structures dp greedy two pointers | Statement | D | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 2000.0 | Codeforces Round #822 (Div.2) Editorial | |
| 1266 | House Planning | constructive algorithms data structures flows graph matchings greedy | Statement | E | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 2250.0 | Codeforces Round #824 — editorial | |
| 6406 | 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 | ||
| 9142 | Knowledge Cards | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1750.0 | Tutorial | 1500 |
| 5130 | Hanging Hearts | constructive algorithms data structures dfs and similar dp greedy trees | Statement | E | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2000.0 | Tutorial | 1800 |
| 13245 | Zero-Sum Prefixes | brute force data structures dp greedy implementation | Statement | C | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 1500.0 | Codeforces Round #833 (Div. 2) Editorial | 1600 |
| 1697 | Bracket Cost | binary search data structures divide and conquer dp greedy strings | Statement | E | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 2250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 5627 | Restore the Permutation | binary search data structures greedy math | Statement | G | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 4564 | All Possible Digits | binary search data structures greedy math number theory | Statement | F | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 10638 | 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 | ||
| 23198 | Binary Inversions | data structures greedy math | Statement | E | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 3939 | The Human Equation | data structures dp dsu greedy | Statement | E | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 2250.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 9138 | Boris and His Amazing Haircut | constructive algorithms data structures dp dsu greedy | Statement | D | Hello 2023 {1779} | PROGRAMMING | 1500.0 | ||
| 2079 | Anya's Simultaneous Exhibition | constructive algorithms data structures graphs greedy interactive sortings | Statement | E | Hello 2023 {1779} | PROGRAMMING | 2250.0 | ||
| 14670 | Least Prefix Sum | data structures greedy | Statement | C | Hello 2023 {1779} | PROGRAMMING | 1250.0 | ||
| 1451 | Rectangle Shrinking | binary search data structures greedy implementation two pointers | Statement | E | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 2750.0 | Tutorial | |
| 33369 | Matryoshkas | data structures greedy sortings | Statement | D | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 1361 | Velepin and Marketing | data structures dp greedy sortings | Statement | E | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 2500.0 | Codeforces Round #852 Editorial | |
| 5538 | Maximum Subarray | data structures dp greedy | Statement | D | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 1067 | Colored Subgraphs | data structures dp greedy trees | Statement | E | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 19003 | Three Sevens | brute force data structures greedy implementation | Statement | B | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 860 (Div. 2) | 1000 |
| 12424 | Recent Actions | data structures greedy implementation math | Statement | A | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 500.0 | Codeforces Round #854 Editorial | |
| 27508 | Powering the Hero (easy version) | data structures greedy | Statement | C1 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 27680 | Powering the Hero (hard version) | data structures greedy | Statement | C2 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 30093 | Remove Two Letters | data structures greedy hashing strings | Statement | D | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 4153 | Music Festival | binary search data structures dp greedy sortings | Statement | C | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1250.0 | Codeforces Round #857 Editorial | |
| 7697 | Buying gifts | data structures dp greedy sortings | Statement | B | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1000.0 | Codeforces Round #857 Editorial | |
| 962 | Traveling in Berland | binary search data structures graphs greedy implementation | Statement | F | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 12869 | Almost Increasing Subsequence | data structures greedy | Statement | A | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 500.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 1717 | LuoTianyi and XOR-Tree | data structures dfs and similar dp dsu greedy trees | Statement | C | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 1750.0 | CodeForces Round 872(Div. 1&2) Editorial | 2500 |
| 2363 | Range Sorting (Hard Version) | binary search data structures dp greedy | Statement | B2 | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2400 |
| 1016 | Two Centroids | data structures dfs and similar greedy trees | Statement | D | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 1750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2800 |
| 139 | Copium Permutation | constructive algorithms data structures greedy | Statement | F | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 3500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 3500 |
| 5622 | Survey in Class | constructive algorithms data structures greedy implementation sortings | Statement | D | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 1750.0 | Codeforces Round #879 Editorial | |
| 2723 | Editorial for Two | binary search data structures greedy implementation | Statement | F | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 23083 | Bracket Coloring | constructive algorithms data structures greedy | Statement | D | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 16652 | Lamps | data structures greedy sortings two pointers | Statement | B | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 1000.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 5372 | Pairs of Segments | data structures dp greedy sortings | Statement | D | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 2473 | Fill the Matrix | data structures greedy math | Statement | E | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 1879 | Tenzing and Triangle | data structures dp greedy | Statement | E | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 2000.0 | CodeTON Round 5 Editorial | |
| 6455 | Omsk Metro (simple version) | data structures dfs and similar dp greedy math trees | Statement | F1 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 500 | 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 | |
| 9155 | Rating System | brute force data structures dp greedy implementation math | Statement | D | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 1102 | The Boss's Identity | binary search bitmasks data structures dfs and similar greedy math sortings | Statement | F | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 3000.0 | Tutorial | |
| 14949 | Vampiric Powers, anyone? | bitmasks brute force data structures dp greedy | Statement | C | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 1500.0 | Tutorial | |
| 4303 | Professor Higashikata | brute force data structures dsu greedy implementation sortings | Statement | D | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 2000.0 | Tutorial | |
| 25950 | Vika and the Bridge | binary search data structures greedy implementation math sortings | Statement | B | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 1000.0 | Codeforces Round #885 (Div.2) Editorial | |
| 903 | XOR Partition | binary search bitmasks data structures divide and conquer greedy trees | Statement | F | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 7750 | Lisa and the Martians | bitmasks data structures greedy math sortings strings trees | Statement | F | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 2139 | Ina of the Mountain | data structures dp greedy math | Statement | C | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 1250.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 3235 | Trees and Segments | binary search brute force constructive algorithms data structures dp greedy two pointers | Statement | D | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 2000.0 | Codeforces Round #893 (Div. 2) Editorial | 2200 |
| 8064 | Andrey and Escape from Capygrad | binary search data structures dp dsu greedy sortings two pointers | Statement | D | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1750.0 | Video solutions from Geothermal. | |
| 15894 | Game on Permutation | data structures games greedy | Statement | C | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 12974 | Kolya and Movie Theatre | constructive algorithms data structures greedy | Statement | E | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 2238 | Grouped Carriages | binary search data structures greedy | Statement | G | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 12791 | Salyg1n and the MEX Game | constructive algorithms data structures games greedy interactive | Statement | C | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1250.0 | ||
| 135 | LIS? | data structures greedy implementation | Statement | F | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 3000.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 8112 | Prefix Purchase | binary search data structures greedy | Statement | D | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 1750.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 127 | 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 | |
| 287 | Clubstep | binary search brute force data structures greedy trees | Statement | G | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 3250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 22124 | Iva & Pav | binary search bitmasks data structures greedy | Statement | E | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 10251 | Reverse Madness | data structures greedy | Statement | D | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 259 | Diamond Theft | data structures greedy | Statement | F | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 3967 | Doremy's Drying Plan (Easy Version) | brute force data structures dp greedy sortings | Statement | C1 | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 750.0 | Codeforces Round 906 Editorial | |
| 2766 | Sofia and Strings | data structures greedy strings | Statement | E | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 2000.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 5826 | Set To Max (Hard Version) | binary search constructive algorithms data structures dsu greedy implementation sortings two pointers | Statement | D2 | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 14393 | Largest Subsequence | data structures greedy strings | Statement | C | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 1500.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 13379 | Heavy Intervals | constructive algorithms data structures dsu greedy math sortings | Statement | C | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 36368 | Romantic Glasses | data structures greedy math | Statement | E | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 6395 | Blocking Elements | binary search data structures dp greedy implementation two pointers | Statement | D | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 2000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 27387 | Minimize Inversions | constructive algorithms data structures greedy implementation sortings | Statement | B | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 1000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 29989 | Grouping Increases | data structures dp greedy | Statement | C | Hello 2024 {1919} | PROGRAMMING | 1000.0 | 1400 | |
| 4624 | 01 Tree | data structures divide and conquer greedy implementation sortings trees | Statement | D | Hello 2024 {1919} | PROGRAMMING | 1500.0 | 2100 | |
| 6907 | Berserk Monsters | data structures dfs and similar greedy implementation | Statement | D | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 8496 | Slimes | binary search data structures greedy | Statement | D | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 18735 | Find B | constructive algorithms data structures greedy | Statement | C | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 34939 | Find the Different Ones! | binary search brute force data structures dp greedy two pointers | Statement | D | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 5505 | Microcycle | data structures dfs and similar dsu graphs greedy trees | Statement | F | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 2045 | Paint Charges | data structures dp greedy math | Statement | G | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 5239 | Lonely Mountain Dungeons | binary search brute force data structures greedy math ternary search | Statement | D | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 1750.0 | Codeforces Round 924 Editorial | |
| 8226 | Lexicographically Largest | constructive algorithms data structures greedy sortings | Statement | C | think-cell Round 1 {1930} | PROGRAMMING | 1500.0 | think-cell Round 1 Editorial | |
| 1682 | Distance Learning Courses in MAC | binary search bitmasks data structures greedy implementation math | Statement | E | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 2500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 683 | Bitwise Paradox | bitmasks data structures greedy two pointers | Statement | D | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 2000.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 3387 | Learning to Paint | data structures dp greedy | Statement | D | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 2250.0 | CodeTON Round 8 Editorial | |
| 1002 | Inversion Composition | binary search constructive algorithms data structures greedy | Statement | F | Codeforces Global Round 25 {1951} | PROGRAMMING | 2750.0 | Codeforces Global Round 25 Editorial | |
| 3017 | Chain Reaction | data structures dsu greedy implementation math number theory | Statement | E | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 5779 | Shop Game | data structures greedy math sortings | Statement | D | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 1900 | |
| 1913 | Unique Array | binary search data structures divide and conquer dp greedy | Statement | E | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 2400 | |
| 17037 | Cat, Fox and the Lonely Array | binary search bitmasks data structures greedy math two pointers | Statement | B | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #945 (Div. 2) | 1300 |
| 6117 | Money Buys Less Happiness Now | data structures greedy sortings | Statement | G | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 2000 | |
| 1338 | Splittable Permutations | combinatorics data structures dfs and similar greedy math trees | Statement | E | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 875 | Remove Bridges | data structures dfs and similar dp greedy sortings trees | Statement | F | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 8146 | Nikita and LCM | brute force data structures dp greedy math number theory sortings | Statement | C | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1750.0 | 129858 | 1900 |
| 4671 | Computing Machine | data structures dp greedy implementation | Statement | E | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 2000.0 | 130527 | |
| 13852 | Elections | data structures greedy implementation math | Statement | D | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1500.0 | 130527 | |
| 1305 | Turtle and Intersected Segments | data structures dsu graphs greedy | Statement | E | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 2500.0 | Simplified Chinese Tutorial | |
| 22219 | Boring Day | binary search data structures dp greedy two pointers | Statement | C | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 1000.0 | 130839 | |
| 26303 | Update Queries | data structures greedy sortings | Statement | C | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 4535 | Med-imize | binary search data structures dp greedy | Statement | D | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 10271 | Bouquet (Hard Version) | binary search data structures greedy math sortings two pointers | Statement | B2 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 500.0 | Video Tutorial | |
| 10420 | Squaring | brute force constructive algorithms data structures greedy implementation math number theory | Statement | C | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 2304 | Eliminating Balls With Merging (Easy Version) | binary search brute force data structures divide and conquer dp greedy math | Statement | E1 | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 16493 | Photoshoot for Gorillas | combinatorics data structures greedy math | Statement | E | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 2964 | Cosmic Rays | data structures dfs and similar greedy implementation trees | Statement | E | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 653 | Turtle and Inversions (Hard Version) | brute force constructive algorithms data structures dp greedy two pointers | Statement | E2 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1000.0 | sol-zh.pdf | |
| 899 | Turtle and Inversions (Easy Version) | brute force data structures dp greedy | Statement | E1 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1750.0 | sol-zh.pdf | |
| 835 | Turtle and Three Sequences | data structures dp graphs greedy meet-in-the-middle probabilities two pointers | Statement | F | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 2500.0 | sol-zh.pdf | |
| 13493 | Colored Portals | binary search data structures graphs greedy shortest paths | Statement | D | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 1436 | Make a Palindrome | brute force data structures dp greedy math | Statement | F | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 13727 | Alternating String | brute force data structures dp greedy strings | Statement | E | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 132 | Good Subarray | *special data structures greedy | Statement | F | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | Kotlin Heroes 11 — Editorial | ||
| 7615 | Minimize the Difference | binary search data structures greedy implementation math | Statement | D | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 6006 | Robin Hood Archery | data structures games greedy hashing | Statement | H | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 16253 | Robert Hood and Mrs Hood | data structures greedy sortings | Statement | D | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 246 | Complex Segments (Easy Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E1 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 210 | Complex Segments (Hard Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E2 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 10123 | Tree Pruning | brute force data structures dfs and similar greedy sortings trees | Statement | C | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 2220 | Max Plus Min Plus Size | data structures dp dsu greedy implementation matrices | Statement | D | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 1959 | 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 | |
| 4586 | Adjust The Presentation (Hard Version) | constructive algorithms data structures greedy implementation | Statement | C2 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1000.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 709 | Digital Village (Extreme Version) | data structures dp graphs greedy math | Statement | E3 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1000.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 973 | Boss, Thirsty | data structures dp greedy math | Statement | D | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 2500.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 21761 | Meaning Mean | data structures greedy math sortings | Statement | A | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 500.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 7256 | Skipping | brute force data structures dp graphs greedy shortest paths | Statement | B | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1000.0 | 135341 | |
| 12887 | Action Figures | data structures greedy | Statement | C | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 1935 | The Endspeaker (Hard Version) | binary search combinatorics data structures dp greedy implementation two pointers | Statement | D2 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1000.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 3814 | Alice's Adventures in Cards | constructive algorithms data structures dfs and similar dp graphs greedy implementation shortest paths | Statement | D | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1750.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 7812 | New Rating | binary search data structures dp greedy | Statement | C | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 1750.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 1209 | Orangutan Approved Subarrays | binary search brute force data structures greedy two pointers | Statement | F | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 2500.0 | Codeforces Round 979 Editorial | |
| 10040 | Penchick and Desert Rabbit | data structures dfs and similar dp dsu greedy two pointers | Statement | D | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 2000.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 2751 | Penchick and Chloe's Trees | data structures dfs and similar dp greedy sortings trees | Statement | E | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 2500.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 14454 | Sakurako, Kosuke, and the Permutation | brute force data structures dfs and similar dsu fft greedy math | Statement | E | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 16045 | Rakhsh's Revival | data structures greedy implementation two pointers | Statement | B | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 750.0 | Rayan 2024 Selection Round Editorial | |
| 5900 | Yet Another Real Number Problem | binary search brute force data structures dp greedy implementation math two pointers | Statement | D | Codeforces Global Round 27 {2035} | PROGRAMMING | 1500.0 | Codeforces Global Round 27 Editorial | |
| 14986 | Sharky Surfing | data structures greedy two pointers | Statement | D | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 157 | Barrels | data structures greedy math | Statement | E | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2900 | ||
| 11466 | Sums on Segments | binary search brute force data structures dp greedy math | Statement | C | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 11147 | Move Back at a Cost | binary search data structures greedy sortings | Statement | B | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 750.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 142 | Yandex Cuneiform (Easy Version) | constructive algorithms data structures greedy | Statement | F1 | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2000.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 109 | Yandex Cuneiform (Hard Version) | constructive algorithms data structures greedy | Statement | F2 | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2500.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 8494 | Kevin and Competition Memories | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Global Round 28 {2048} | PROGRAMMING | 1250.0 | Tutorial | |
| 12254 | Best Price | brute force data structures greedy sortings | Statement | E | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 7807 | Refined Product Optimality | binary search data structures greedy implementation math schedules sortings | Statement | D | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1750.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 109 | 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 | |
| 959 | Earnest Matrix Complement | data structures dp greedy implementation | Statement | F | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2500.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 495 | Haystacks | constructive algorithms data structures greedy | Statement | E | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 3000.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 189 | Coffee Break | data structures greedy greedy math | Statement | H | Hello 2025 {2057} | PROGRAMMING | 4500.0 | ||
| 5531 | Gifts Order | data structures greedy math | Statement | D | Hello 2025 {2057} | PROGRAMMING | 2250.0 | ||
| 6712 | Graph and Graph | data structures graphs greedy shortest paths | Statement | D | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 2000.0 | 139094 | |
| 2297 | Kevin and Binary String (Easy Version) | binary search brute force data structures dp greedy implementation strings two pointers | Statement | F1 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 2000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 14926 | Kevin and Geometry | brute force constructive algorithms data structures geometry greedy implementation math two pointers | Statement | B | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 1000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 11018 | Kevin and Numbers | brute force data structures greedy implementation math | Statement | D | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 1500.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 5129 | Game With Triangles | binary search data structures dp greedy math ternary search two pointers | Statement | D | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 2250.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 15009 | 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 | |
| 2411 | Triangle Tree | data structures dfs and similar dp dsu greedy trees | Statement | E | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 2750.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 5980 | Eating | binary search bitmasks data structures greedy two pointers | Statement | D | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 1750.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 7315 | Skibidus and Slay | data structures dfs and similar graphs greedy trees | Statement | F | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 427 | Tropical Season | data structures greedy implementation | Statement | E | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 2000.0 | 139415 | |
| 1903 | Game with Binary String | data structures divide and conquer games greedy math | Statement | E | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | Video Tutorial | ||
| 161 | Arithmetic Exercise | *special data structures dp greedy | Statement | B | XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {2079} | PROGRAMMING | |||
| 517 | Skyscape | constructive algorithms data structures greedy | Statement | F | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 3000.0 | 141155 | |
| 5445 | Serval and Kaitenzushi Buffet | data structures graph matchings greedy | Statement | D | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 1750.0 | Codeforces Round #1011 (Div. 2) Editorial |