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 2Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 389 | 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 | |
| 4874 | Expression Evaluation Error | constructive algorithms greedy implementation math | Statement | D | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 1750.0 | Codeforces Round #742 Editorial | |
| 25450 | Permutation Minimization by Deque | constructive algorithms greedy math | Statement | E1 | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 12582 | Diameter of Graph | constructive algorithms graphs greedy math | Statement | B | Codeforces Round 745 (Div. 2) {1581} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 1200 |
| 883 | Weights | constructive algorithms greedy two pointers | Statement | A | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | Tutorial | ||
| 3280 | Treelabeling | bitmasks constructive algorithms dfs and similar games graphs greedy trees | Statement | D | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2000.0 | tutorial | 2100 |
| 1003 | Max Sum Array | combinatorics constructive algorithms greedy sortings | Statement | G | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 10281 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 4413 | The Winter Hike | constructive algorithms greedy math | Statement | D | Hello 2022 {1621} | PROGRAMMING | 1750.0 | ||
| 27002 | Division by Two and Permutation | constructive algorithms flows graph matchings greedy math | Statement | C | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 17119 | Meximum Array | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 500.0 | 99276 | |
| 3598 | Grid Xor | constructive algorithms greedy implementation interactive math | Statement | C | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 1250.0 | 99276 | |
| 4791 | Finding Zero | constructive algorithms greedy interactive | Statement | D | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2000.0 | Codeforces Round #770 (Div. 2) editorial | |
| 2750 | 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 | |
| 2174 | Towers | constructive algorithms dfs and similar dp greedy trees | Statement | F | Codeforces Global Round 19 {1637} | PROGRAMMING | 3250.0 | Tutorial | |
| 690 | Playing Around the Table | constructive algorithms greedy implementation | Statement | F | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 3000.0 | Codeforces Round #774 (Div. 2) Editorial | 2900 |
| 22774 | Quality vs Quantity | brute force constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 1000.0 | Codeforces Round #774 (Div. 2) Editorial | 800 |
| 14611 | 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 |
| 12063 | Bit Flipping | bitmasks constructive algorithms greedy strings | Statement | B | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 750.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 4466 | 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 | |
| 32354 | Red Versus Blue | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 8124 | Matrix and Shifts | constructive algorithms greedy implementation | Statement | E | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 34356 | Array Cloning Technique | constructive algorithms greedy sortings | Statement | B | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 750.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 14063 | Unequal Array | constructive algorithms greedy implementation | Statement | C | Codeforces Global Round 20 {1672} | PROGRAMMING | 750.0 | Global Round 20 Editorial | 1100 |
| 6975 | Cyclic Rotation | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Global Round 20 {1672} | PROGRAMMING | 1000.0 | Global Round 20 Editorial | 1700 |
| 2530 | notepad.exe | binary search constructive algorithms greedy interactive | Statement | E | Codeforces Global Round 20 {1672} | PROGRAMMING | 1500.0 | Global Round 20 Editorial | 2200 |
| 968 | Anti-Theft Road Planning | bitmasks constructive algorithms divide and conquer greedy interactive math | Statement | F | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 3250.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 7341 | Breaking the Wall | binary search brute force constructive algorithms greedy math | Statement | E | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 759 | 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 | |
| 16549 | LIS or Reverse LIS? | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 1500.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 10814 | Traps | constructive algorithms greedy sortings | Statement | D | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 1500.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 1700 |
| 3655 | 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 |
| 18667 | Circular Local MiniMax | constructive algorithms greedy sortings | Statement | A | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 500.0 | 103198 | 1100 |
| 4169 | 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 | |
| 11476 | The Enchanted Forest | constructive algorithms greedy math | Statement | A | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 796 | |
| 19078 | Patchouli's Magical Talisman | bitmasks constructive algorithms greedy sortings | Statement | B | Codeforces Round 796 (Div. 2) {1688} | PROGRAMMING | 750.0 | Tutorial | |
| 13730 | Infected Tree | constructive algorithms dfs and similar dp greedy trees | Statement | C | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 17327 | Sum of Substrings | brute force constructive algorithms greedy math strings | Statement | C | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 1250.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 36704 | Shoe Shuffling | constructive algorithms greedy implementation two pointers | Statement | B | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 32285 | Beat The Odds | constructive algorithms greedy math | Statement | A | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 500.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 2472 | Tree Queries (Easy Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D1 | 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 | |
| 2307 | Tree Queries (Hard Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D2 | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 6044 | 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 | |
| 12611 | Fishingprince Plays With Array | constructive algorithms greedy implementation | Statement | C | Codeforces Global Round 21 {1696} | PROGRAMMING | 1500.0 | Editorial of Codeforces Global Round 21 | |
| 15866 | 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 | ||
| 1842 | PermutationForces II | binary search brute force combinatorics constructive algorithms greedy sortings | Statement | E | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 2000.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 21496 | Rising Sand | constructive algorithms greedy implementation | Statement | B | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 9551 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 7761 | Chopping Carrots (Easy Version) | binary search brute force constructive algorithms dp greedy number theory | Statement | D1 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 22435 | Woeful Permutation | constructive algorithms greedy number theory | Statement | B | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 1000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 6274 | Tournament Countdown | constructive algorithms fft greedy greedy interactive number theory probabilities | Statement | D | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 2000.0 | Codeforces Round #812 (Div. 2) Editorial | 1800 |
| 3713 | Build a Tree and That Is It | brute force constructive algorithms greedy implementation trees | Statement | F | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 24410 | Crossmarket | constructive algorithms greedy math | Statement | A | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 500.0 | Codeforces Round #816 (Div. 2) editorial | |
| 34925 | Beautiful Array | constructive algorithms greedy math | Statement | B | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 1000.0 | Codeforces Round #816 (Div. 2) editorial | |
| 21102 | Working Week | constructive algorithms greedy math | Statement | A | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 500.0 | Codeforces Round #824 — editorial | |
| 2794 | Equal Binary Subsequences | constructive algorithms greedy strings | Statement | D | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 1398 | 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> | |
| 24566 | Array Recovery | constructive algorithms greedy math | Statement | B | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 12398 | Bricks and Bags | constructive algorithms games greedy sortings | Statement | C | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1500.0 | Tutorial | 1400 |
| 9106 | Knowledge Cards | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1750.0 | Tutorial | 1500 |
| 5113 | 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 |
| 14187 | Smaller | constructive algorithms greedy strings | Statement | F | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 20772 | Save the Magazines | constructive algorithms greedy sortings string suffix structures | Statement | C | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 1100 | |
| 14150 | Permutation Operations | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial | |
| 14808 | Elimination of a Ring | constructive algorithms greedy implementation | Statement | B | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1000.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 17053 | Absolute Maximization | bitmasks constructive algorithms greedy math | Statement | A | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 500.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 10498 | Doremy's City Construction | constructive algorithms greedy math | Statement | C | Codeforces Global Round 24 {1764} | PROGRAMMING | 1500.0 | Codeforces Global Round 24 Editorial | |
| 15805 | Elemental Decompress | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 20002 | Gardener and the Capybaras (hard version) | constructive algorithms greedy strings | Statement | A2 | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 2052 | Anya's Simultaneous Exhibition | constructive algorithms data structures graphs greedy interactive sortings | Statement | E | Hello 2023 {1779} | PROGRAMMING | 2250.0 | ||
| 24113 | Hall of Fame | constructive algorithms greedy math strings | Statement | A | Hello 2023 {1779} | PROGRAMMING | 500.0 | ||
| 2756 | The Harmonization of XOR | bitmasks constructive algorithms greedy math | Statement | E | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 2250.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 22530 | Sum of Two Numbers | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1000.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 19576 | Matching Numbers | constructive algorithms greedy math | Statement | C | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1500.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 41803 | Not Dividing | constructive algorithms greedy math | Statement | B | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 9005 | Li Hua and Chess | brute force constructive algorithms greedy hashing interactive | Statement | C | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1500.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 14522 | Shocking Arrangement | constructive algorithms greedy math | Statement | D | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round 860 (Div. 2) | 1600 |
| 12856 | Equalize by Divide | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1000.0 | Codeforces Round #854 Editorial | |
| 1414 | City Union | constructive algorithms dp geometry greedy implementation math | Statement | E | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 2250.0 | Codeforces Round #854 Editorial | |
| 6994 | Double Lexicographically Minimum | constructive algorithms greedy implementation strings | Statement | C | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1500.0 | Codeforces Round #854 Editorial | |
| 15323 | Sum on Subarrays | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 2382 | 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 |
| 4333 | Unique Palindromes | binary search constructive algorithms greedy math strings | Statement | D | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2000.0 | 115465 | |
| 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 |
| 2374 | Red-Blue Operations (Hard Version) | binary search constructive algorithms greedy implementation math | Statement | D2 | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2400 | |
| 5604 | 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 | |
| 17859 | Minimize Permutation Subarrays | constructive algorithms greedy math | Statement | B | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1000.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 1554 | Decreasing Game | constructive algorithms dp greedy interactive | Statement | E | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 2750.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 4786 | 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 | |
| 17980 | Particles | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1250.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 20347 | Permutations & Primes | constructive algorithms greedy math | Statement | B | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 3761 | Rudolph and Mimic | constructive algorithms greedy implementation interactive | Statement | F | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 21697 | Rudolf and the Another Competition | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 5507 | Imbalanced Arrays | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 750.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 3218 | 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 |
| 45674 | Olya and Game with Arrays | constructive algorithms greedy math sortings | Statement | B | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1000.0 | Video solutions from Geothermal. | |
| 511 | Most Different Tree | brute force constructive algorithms dfs and similar greedy hashing | Statement | F | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 4000.0 | ||
| 12743 | Salyg1n and the MEX Game | constructive algorithms data structures games greedy interactive | Statement | C | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1250.0 | ||
| 6917 | Cyclic Operations | constructive algorithms dfs and similar graphs greedy implementation | Statement | D | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.0 | ||
| 2781 | 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 | |
| 8384 | 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 | |
| 20293 | MEXanized Array | constructive algorithms greedy math | Statement | A | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 500.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 1239 | Two Permutations (Easy Version) | brute force constructive algorithms greedy number theory | Statement | E1 | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 19205 | Simple Design | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 500.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 21128 | Smilo and Monsters | constructive algorithms greedy sortings two pointers | Statement | C | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 1000.0 | ||
| 1094 | Colorful Constructive | constructive algorithms greedy math | Statement | D | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 2250.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 11710 | Neutral Tonality | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 1000.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 11740 | Matching Arrays | binary search constructive algorithms greedy sortings | Statement | C | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 1500.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 14393 | Add, Divide and Floor | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 17294 | Insert and Equalize | brute force constructive algorithms greedy math number theory | Statement | C | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 2539 | Geo Game | constructive algorithms dp games greedy interactive math | Statement | E | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 2250.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 5798 | 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 | |
| 2361 | Lights | constructive algorithms dfs and similar graphs greedy implementation | Statement | G | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 23336 | Removal of Unattractive Pairs | constructive algorithms greedy math strings | Statement | C | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 13310 | 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) | |
| 27256 | 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 | |
| 32469 | Brick Wall | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 500.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 16922 | Did We Get Everything Covered? | constructive algorithms dp greedy strings | Statement | A | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 500.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 31269 | We Got Everything Covered! | constructive algorithms greedy strings | Statement | A | Codeforces Round 921 (Div. 2) {1925} | PROGRAMMING | 500.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 38440 | Following the String | constructive algorithms greedy strings | Statement | B | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 2135 | Modular Sequence | constructive algorithms dp greedy implementation math number theory | Statement | E | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 2250.0 | Codeforces Round 924 Editorial | |
| 24505 | Rectangle Cutting | constructive algorithms geometry greedy math | Statement | A | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 500.0 | Codeforces Round 924 Editorial | |
| 26800 | Sasha and the Drawing | constructive algorithms greedy math | Statement | B | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 1000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 35169 | Sasha and the Beautiful Array | constructive algorithms greedy sortings | Statement | A | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 8200 | Lexicographically Largest | constructive algorithms data structures greedy sortings | Statement | C | think-cell Round 1 {1930} | PROGRAMMING | 1500.0 | think-cell Round 1 Editorial | |
| 23739 | Turtle Tenacity: Continual Mods | constructive algorithms greedy number theory sortings | Statement | D | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 8159 | Find a Mine | constructive algorithms geometry greedy interactive math | Statement | C | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1500.0 | Tutorial | |
| 27350 | Too Min Too Max | constructive algorithms greedy math | Statement | A | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 500.0 | Tutorial | |
| 612 | Andrey's Tree | binary search constructive algorithms dsu greedy implementation trees | Statement | F | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 3000.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 8725 | Bitwise Operation Wizard | bitmasks constructive algorithms greedy interactive math | Statement | A | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 500.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 2647 | Tree Compass | constructive algorithms dfs and similar greedy trees | Statement | C | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 1250.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 5653 | Birthday Gift | bitmasks brute force constructive algorithms greedy implementation | Statement | D | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 1750.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 4511 | No Palindromes | brute force constructive algorithms greedy hashing implementation strings | Statement | E | Codeforces Global Round 25 {1951} | PROGRAMMING | 2250.0 | Codeforces Global Round 25 Editorial | |
| 6345 | Buying Jewels | constructive algorithms greedy math | Statement | D | Codeforces Global Round 25 {1951} | PROGRAMMING | 1750.0 | Codeforces Global Round 25 Editorial | |
| 4827 | Nene and the Mex Operator | bitmasks brute force constructive algorithms divide and conquer dp greedy implementation | Statement | D | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 1750.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 15283 | Nene's Magical Matrix | constructive algorithms greedy math | Statement | C | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 1500.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 20639 | A BIT of a Construction | bitmasks constructive algorithms greedy implementation | Statement | B | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1000.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 1100 |
| 8222 | Missing Subsequence Sum | bitmasks constructive algorithms greedy number theory | Statement | B | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 1250.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 1800 |
| 2373 | Folding Strip | constructive algorithms greedy strings | Statement | C | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 1500.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 2300 |
| 9924 | Cat, Fox and Double Maximum | constructive algorithms greedy implementation math sortings | Statement | C | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #945 (Div. 2) | 1700 |
| 17947 | Ingenuity-2 | constructive algorithms greedy implementation | Statement | D | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 1400 | |
| 20023 | Binary Colouring | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1250.0 | 129858 | 1100 |
| 17938 | Manhattan Permutations | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1250.0 | 130527 | |
| 7922 | Fixing a Binary String | bitmasks brute force constructive algorithms greedy hashing strings | Statement | D | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 2000.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 6407 | Turtle and an Incomplete Sequence | bitmasks constructive algorithms greedy implementation math | Statement | C | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 1500.0 | Simplified Chinese Tutorial | |
| 11338 | Swap Dilemma | constructive algorithms divide and conquer greedy math sortings | Statement | D | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1750.0 | ||
| 18531 | Corner Twist | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1000.0 | ||
| 1825 | Shuffle | constructive algorithms dp greedy trees | Statement | E | Codeforces Global Round 26 {1984} | PROGRAMMING | 3000.0 | Codeforces Global Round 26 Editorial | |
| 7952 | Prime XOR Coloring | bitmasks constructive algorithms graphs greedy math number theory | Statement | D | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 5185 | Coloring Game | constructive algorithms games graphs greedy interactive | Statement | E | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 172 | Grid Game | constructive algorithms games greedy interactive | Statement | I | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 4000.0 | Video Tutorial | |
| 17868 | Absolute Zero | constructive algorithms greedy math | Statement | C | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 49687 | Only Pluses | brute force constructive algorithms greedy math sortings | Statement | A | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 19751 | Fun Game | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 7621 | Funny Game | constructive algorithms dsu graphs greedy math number theory | Statement | D | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 10386 | 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 | |
| 6500 | Longest Max Min Subsequence | brute force constructive algorithms greedy two pointers | Statement | D | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 26182 | Generate Permutation | constructive algorithms greedy implementation | Statement | B | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 17880 | Black Circles | brute force constructive algorithms geometry greedy math | Statement | C | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1000.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 649 | 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 | |
| 21855 | Turtle and Good Pairs | constructive algorithms greedy strings | Statement | C | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1000.0 | sol-zh.pdf | |
| 42102 | Sakurako's Exam | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 28512 | Battle for Survive | constructive algorithms greedy math | Statement | B | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 750.0 | 134298 | |
| 4567 | 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 | |
| 1388 | C+K+S | brute force constructive algorithms dfs and similar graphs greedy hashing math strings | Statement | C | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1500.0 | 135341 | |
| 16754 | Concatenation of Arrays | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 500.0 | 135341 | |
| 3794 | 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 | |
| 1937 | Alice's Adventures in the Rabbit Hole | constructive algorithms dfs and similar dp greedy math probabilities trees | Statement | E | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 2000.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 3574 | Common Generator | brute force constructive algorithms greedy math number theory | Statement | E | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2500.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 20926 | Medians | constructive algorithms greedy hashing implementation math | Statement | B | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 2038 | Permutations Harmony | brute force combinatorics constructive algorithms greedy hashing implementation math | Statement | E | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 | Rayan 2024 Selection Round Editorial | |
| 6713 | Darius' Wisdom | constructive algorithms greedy implementation sortings | Statement | D | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 1500.0 | Rayan 2024 Selection Round Editorial | |
| 20787 | Everyone Loves Tres | constructive algorithms greedy math number theory | Statement | B | Codeforces Global Round 27 {2035} | PROGRAMMING | 500.0 | Codeforces Global Round 27 Editorial | |
| 25804 | Superultra's Favorite Permutation | constructive algorithms greedy math number theory | Statement | C | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 17501 | Shohag Loves Strings | constructive algorithms greedy implementation strings | Statement | B | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 1000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 7082 | Shohag Loves GCD | constructive algorithms greedy math number theory | Statement | D | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 5905 | Non Prime Tree | brute force constructive algorithms dfs and similar greedy number theory trees two pointers | Statement | D | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2000.0 | Codeforces Round #992 (Div.2) Editorial | |
| 24374 | Paint a Strip | constructive algorithms greedy math | Statement | B | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1000.0 | Codeforces Round #992 (Div.2) Editorial | |
| 10934 | Ordered Permutations | constructive algorithms greedy math | Statement | C | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1500.0 | Codeforces Round #992 (Div.2) Editorial | |
| 24348 | Harder Problem | constructive algorithms greedy math | Statement | D | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 13817 | MEX Cycle | constructive algorithms greedy implementation | Statement | C | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 1000.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 17441 | The Trail | constructive algorithms greedy math | Statement | C | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 1500.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 13970 | Trip to the Olympiad | bitmasks constructive algorithms greedy math | Statement | C | Hello 2025 {2057} | PROGRAMMING | 1500.0 | ||
| 12728 | Customer Service | brute force constructive algorithms graph matchings greedy math sortings | Statement | C | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 897 | Stop Gaming (Easy Version) | brute force constructive algorithms greedy hashing | Statement | E1 | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 18985 | Cost of the Array | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1000.0 | 139094 | |
| 29328 | Milya and Two Arrays | constructive algorithms greedy sortings | Statement | A | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 500.0 | 139094 | |
| 14863 | 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 | |
| 22445 | Kevin and Arithmetic | constructive algorithms greedy math | Statement | A | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 500.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 20315 | Variety is Discouraged | constructive algorithms constructive algorithms greedy greedy | Statement | B | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 1000.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 5538 | White Magic | constructive algorithms greedy implementation | Statement | B | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 750.0 | 139415 | |
| 1937 | A, B, AB and BA | constructive algorithms greedy sortings strings | Statement | E | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | 139774 | ||
| 21131 | Perfecto | brute force constructive algorithms greedy math probabilities | Statement | B | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1000.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 12506 | Do You Love Your Hero and His Two-Hit Multi-Target Attacks? | binary search constructive algorithms geometry greedy math | Statement | E | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 14816 | Breach of Faith | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 18512 | Vicious Labyrinth | constructive algorithms graphs greedy implementation math | Statement | B | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 750.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 1217 | MST in Modulo Graph | constructive algorithms dsu graphs greedy math number theory sortings | Statement | D | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1750.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 9024 | Arcology On Permafrost | binary search brute force constructive algorithms greedy math | Statement | D | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 1750.0 | 141155 | |
| 11903 | You Soared Afar With Grace | constructive algorithms greedy implementation | Statement | C | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 1500.0 | 141155 | |
| 1545 | Gleb and Boating | brute force constructive algorithms data structures dp graphs greedy math shortest paths | Statement | G | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 6955 | Mishkin Energizer | brute force constructive algorithms greedy implementation strings | Statement | D | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 1750.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 433 | Andryusha and CCB | brute force constructive algorithms greedy math number theory strings | Statement | F | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 3000.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 22909 | Asuna and the Mosquitoes | constructive algorithms greedy math | Statement | C | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 1250.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 28681 | St. Chroma | constructive algorithms greedy math | Statement | B | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 953 | Ain and Apple Tree | constructive algorithms greedy math trees | Statement | E | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 2750.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 14748 | SUMdamental Decomposition | bitmasks constructive algorithms greedy implementation math | Statement | B | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 1250.0 | Codeforces Round 1022 Editorial | |
| 1441 | Puzzle | brute force constructive algorithms greedy math | Statement | F | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 12226 | Creating a Schedule | constructive algorithms data structures greedy sortings | Statement | D | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 15545 | Gellyfish and Flaming Peony | brute force constructive algorithms dp greedy math number theory shortest paths | Statement | A | Codeforces Round 1028 (Div. 1) {2115} | PROGRAMMING | 500.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 1444 | Grid Coloring | constructive algorithms greedy sortings | Statement | E | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 2500.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 12854 | Divine Tree | constructive algorithms greedy math sortings trees | Statement | C | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 1250.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 32713 | Above the Clouds | constructive algorithms greedy strings | Statement | B | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 8892 | Manhattan Pairs | constructive algorithms greedy math sortings | Statement | C | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 1500.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 3160 | Ancient Tree | constructive algorithms data structures dfs and similar dsu greedy trees | Statement | E | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2500.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 20182 | Mix Mex Max | constructive algorithms greedy math | Statement | A | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 500.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 21909 | Deque Process | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1000.0 | Codeforces Round #1039 — Editorial | |
| 901 | Sea, You & copriMe | brute force combinatorics constructive algorithms graphs greedy math number theory | Statement | H | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 31326 | Alternating Series | constructive algorithms greedy math | Statement | B | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 21471 | Like the Bitset | constructive algorithms greedy two pointers | Statement | B | Codeforces Round 1046 (Div. 2) {2136} | PROGRAMMING | 1000.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 10967 | Max Sum OR (Easy Version) | bitmasks constructive algorithms divide and conquer greedy trees | Statement | D1 | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 470 | Isaac's Queries | brute force constructive algorithms dfs and similar divide and conquer greedy interactive math probabilities | Statement | G | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 3000.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 9960 | Meximum Array 2 | constructive algorithms greedy math | Statement | C | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 1500.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 14435 | Split | constructive algorithms greedy math | Statement | B | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 1250.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 13027 | Loyalty | constructive algorithms greedy sortings two pointers | Statement | C | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 1750.0 | ||
| 9622 | Beautiful Palindromes | constructive algorithms greedy schedules | Statement | E | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 14819 | Cyclic Merging | brute force constructive algorithms graphs greedy trees | Statement | A | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 500.0 | 148452 | |
| 36659 | Isamatdin and His Magic Wand! | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 1627 | Locate | binary search constructive algorithms greedy interactive | Statement | B | Testing Round 20 (Unrated, Communication Problems) {2168} | PROGRAMMING | Testing Round 20 Editorial (officially unofficial) | ||
| 2340 | Removal of a Sequence (Hard Version) | binary search constructive algorithms divide and conquer greedy implementation math number theory probabilities | Statement | D2 | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 1725 | Almost Roman | constructive algorithms greedy implementation | Statement | D | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 3734 | Anisphia Wynn Palettia and Good Permutations | constructive algorithms greedy number theory | Statement | E | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 6880 | Xmas or Hysteria | constructive algorithms graphs greedy implementation | Statement | D | Good Bye 2025 {2178} | PROGRAMMING | 1750.0 | ||
| 13895 | Blackslex and Penguin Civilization | bitmasks constructive algorithms greedy math | Statement | D | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 6609 | XOR-factorization | bitmasks constructive algorithms dp greedy number theory | Statement | C | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 1500.0 | Codeforces Global Round 31 | |
| 154 | Elevator Against Humanity | brute force constructive algorithms greedy sortings | Statement | E | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 2544 | Tree Coloring (Hard Version) | constructive algorithms data structures dfs and similar greedy implementation trees | Statement | D2 | Hello 2026 {2183} | PROGRAMMING | 2000.0 | ||
| 9163 | Tree Coloring (Easy Version) | constructive algorithms dfs and similar greedy trees | Statement | D1 | Hello 2026 {2183} | PROGRAMMING | 1000.0 | ||
| 16419 | Restricted Sorting | binary search constructive algorithms greedy sortings | Statement | A | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 750.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 11204 | Sub-RBS (Easy Version) | combinatorics constructive algorithms dp greedy strings two pointers | Statement | B1 | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 2213 | Swap to Rearrange | constructive algorithms dfs and similar graph matchings graphs greedy strings | Statement | E | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 2250.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 56 | Bowser's Castle (Easy Version) | binary search constructive algorithms divide and conquer greedy interactive trees | Statement | H1 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 3250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 4600 | Tree Orientation (Easy Version) | constructive algorithms dfs and similar dsu graphs greedy trees | Statement | D1 | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 23986 | A Simple Sequence | constructive algorithms dp greedy number theory | Statement | A | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 500.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 3442 | Interval Mod | constructive algorithms dp greedy math | Statement | A | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 750.0 | 152930 | |
| 29615 | The 67th Permutation Problem | constructive algorithms greedy math | Statement | C | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 8170 | Zhily and Mex and Max | constructive algorithms greedy math sortings | Statement | B | Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026) {2224} | PROGRAMMING | 750.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 12822 | Palindromex | binary search brute force constructive algorithms data structures greedy implementation two pointers | Statement | D | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 3430 | Maximum Prefix Sums | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2000.0 | ||
| 720 | Quadratic Jumps | constructive algorithms greedy math number theory | Statement | F | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2750.0 | ||
| 5017 | Fullmetal Bitchemist | constructive algorithms greedy math | Statement | D | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 1750.0 |