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 ... 5 6 7 8 9 10 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 22961 | Binary Inversions | data structures greedy math | Statement | E | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 53193 | Atilla's Favorite Problem | greedy implementation strings | Statement | B | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 14685 | 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 | |
| 20561 | Divide and Conquer | greedy math number theory | Statement | A | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 500.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 16983 | 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 | |
| 1424 | Doremy's Number Line | binary search dp greedy sortings | Statement | E | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 10436 | Doremy's City Construction | constructive algorithms greedy math | Statement | C | Codeforces Global Round 24 {1764} | PROGRAMMING | 1500.0 | Codeforces Global Round 24 Editorial | |
| 6751 | Torus Path | dp greedy math | Statement | K | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1500 | |
| 10503 | Lucky Chains | brute force dp greedy math number theory | Statement | D | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 23736 | Notepad# | brute force greedy implementation | Statement | B | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 21919 | Block Towers | greedy sortings | Statement | B | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 15684 | Elemental Decompress | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 25601 | Quick Sort | greedy math | Statement | B | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1000.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 31024 | Greatest Convex | greedy math number theory | Statement | A | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 1600 | Gaining Rating | binary search greedy math sortings | Statement | G | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 26098 | Different Differences | greedy math | Statement | C | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 3948 | Two Chess Pieces | dfs and similar dp greedy trees | Statement | E | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 2000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 858 | Laboratory on Pluto | brute force combinatorics dp fft greedy math | Statement | F | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 3000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 19925 | 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 | |
| 893 | Spinach Pizza | games geometry greedy interactive | Statement | I | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 981 | Library game | games greedy interactive sortings | Statement | C | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 43557 | Everybody Likes Good Arrays! | greedy math | Statement | A | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 500.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 19171 | Emordnilap | greedy math | Statement | B | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 1000.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 25705 | Flip Flop Sum | greedy implementation | Statement | A | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 500.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 14522 | The Forbidden Permutation | greedy math | Statement | B | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1000.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 2025 | Anya's Simultaneous Exhibition | constructive algorithms data structures graphs greedy interactive sortings | Statement | E | Hello 2023 {1779} | PROGRAMMING | 2250.0 | ||
| 24040 | Hall of Fame | constructive algorithms greedy math strings | Statement | A | Hello 2023 {1779} | PROGRAMMING | 500.0 | ||
| 25805 | GCD Partition | brute force greedy math number theory | Statement | B | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1000.0 | 111841 | |
| 1430 | Rectangle Shrinking | binary search data structures greedy implementation two pointers | Statement | E | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 2750.0 | Tutorial | |
| 10388 | Equal Frequencies | greedy implementation | Statement | C | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 1500.0 | Tutorial | |
| 10842 | Yet Another Tournament | binary search greedy sortings | Statement | C | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 2715 | 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 | |
| 8259 | Remove the Bracket | dp greedy math | Statement | C | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 1750.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 14873 | Number Factorization | greedy math number theory | Statement | B | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 1000.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 22298 | 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 | |
| 19432 | Matching Numbers | constructive algorithms greedy math | Statement | C | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1500.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 993 | Serval and Brain Power | brute force dp dp greedy implementation | Statement | F | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 2750.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 3984 | Timofey and Black-White Tree | brute force dfs and similar divide and conquer graphs greedy math shortest paths trees | Statement | F | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 31287 | Matryoshkas | data structures greedy sortings | Statement | D | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 28968 | Taisia and Dice | greedy greedy math | Statement | B | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 5871 | Teleporters (Hard Version) | binary search greedy sortings | Statement | G2 | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 48940 | Distinct Split | brute force greedy strings | Statement | D | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 41024 | Negatives and Positives | greedy sortings | Statement | E | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 33698 | Teleporters (Easy Version) | greedy sortings | Statement | G1 | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 16709 | Min Max Sort | binary search brute force greedy math | Statement | C | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 24091 | Stand-up Comedian | greedy math | Statement | B | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 30932 | GamingForces | greedy sortings | Statement | A | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 1333 | Velepin and Marketing | data structures dp greedy sortings | Statement | E | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 2500.0 | Codeforces Round #852 Editorial | |
| 7119 | Moscow Gorillas | dp greedy implementation two pointers | Statement | D | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 1750.0 | Codeforces Round #852 Editorial | |
| 18814 | Yet Another Promotion | greedy math | Statement | A | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 500.0 | Codeforces Round #852 Editorial | |
| 21931 | Scoring Subsequences | binary search greedy math two pointers | Statement | C | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1250.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 39520 | Not Dividing | constructive algorithms greedy math | Statement | B | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 1028 | Colored Subgraphs | data structures dp greedy trees | Statement | E | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 8904 | 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 | |
| 18775 | 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 |
| 13996 | 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 |
| 9358 | Candy Store | greedy math number theory | Statement | C | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 860 (Div. 2) | 1700 |
| 21041 | Showstopper | greedy implementation sortings | Statement | A | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 860 (Div. 2) | 800 |
| 12712 | 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 | |
| 1075 | Halve or Subtract | brute force flows greedy sortings | Statement | F | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 2500.0 | Codeforces Round #854 Editorial | |
| 1399 | 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 | |
| 6911 | 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 | |
| 12311 | 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 | |
| 29234 | Remove Two Letters | data structures greedy hashing strings | Statement | D | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 28349 | Count the Number of Pairs | greedy strings | Statement | B | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 4092 | Music Festival | binary search data structures dp greedy sortings | Statement | C | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1250.0 | Codeforces Round #857 Editorial | |
| 7523 | Buying gifts | data structures dp greedy sortings | Statement | B | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1000.0 | Codeforces Round #857 Editorial | |
| 2854 | The way home | dp graphs greedy shortest paths sortings | Statement | D | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1750.0 | Codeforces Round #857 Editorial | |
| 16649 | Likes | greedy implementation | Statement | A | Codeforces Round 857 (Div. 2) {1802} | PROGRAMMING | 500.0 | Codeforces Round #857 Editorial | |
| 13812 | Pull Your Luck | brute force greedy math number theory | Statement | C | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1000.0 | Nebius Welcome Round Editorial | |
| 15591 | Vaccination | greedy implementation two pointers | Statement | B | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1000.0 | Nebius Welcome Round Editorial | |
| 18651 | Lame King | greedy math | Statement | A | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 500.0 | Nebius Welcome Round Editorial | |
| 8921 | A Wide, Wide Graph | dfs and similar dp dsu greedy trees | Statement | D | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 509 | Survival of the Weakest (hard version) | greedy sortings two pointers | Statement | F2 | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 19852 | The String Has a Target | greedy strings | Statement | B | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 43023 | Walking Master | geometry greedy math | Statement | A | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 463 | GCD Master (easy version) | greedy math number theory sortings | Statement | F1 | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 465 | GCD Master (hard version) | greedy math sortings | Statement | F2 | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 22196 | Subsequence Addition (Easy Version) | brute force dp greedy implementation sortings | Statement | G1 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 27671 | Subsequence Addition (Hard Version) | dp greedy implementation math sortings | Statement | G2 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 34257 | Find and Replace | greedy implementation strings | Statement | C | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 4316 | Unlucky Numbers | brute force greedy implementation | Statement | C | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1500.0 | Codeforces Round #861 (Div. 2) editorial | 1900 |
| 930 | Traveling in Berland | binary search data structures graphs greedy implementation | Statement | F | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 22315 | Points on Plane | binary search greedy math | Statement | B | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 15134 | Sum on Subarrays | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 16522 | Make It Permutation | brute force greedy sortings | Statement | C | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 1000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 34575 | Insert Digit | greedy math strings | Statement | A | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 12448 | Search in Parallel | greedy math sortings | Statement | C | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 15939 | Ian and Array Sorting | greedy implementation math | Statement | A | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #865 | 1300 |
| 2351 | 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 |
| 14368 | Politics | greedy implementation | Statement | A | Codeforces Round 869 (Div. 2) {1818} | PROGRAMMING | 500.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 14564 | Constructive Problem | brute force greedy implementation | Statement | A | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 750.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 4197 | The Butcher | greedy implementation sortings two pointers | Statement | B | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 1250.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 5527 | Black Cells | binary search brute force greedy math | Statement | D | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 2697 | Rearrange Brackets | dp greedy math sortings | Statement | E | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 26565 | Karina and Array | greedy math | Statement | B | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 12322 | Making Anti-Palindromes | greedy math strings | Statement | E | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 4302 | Unique Palindromes | binary search constructive algorithms greedy math strings | Statement | D | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2000.0 | 115465 | |
| 13819 | Strongly Composite | greedy math number theory | Statement | C | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 1250.0 | 115465 | |
| 12505 | LuoTianyi and the Show | greedy implementation | Statement | A | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 500.0 | CodeForces Round 872(Div. 1&2) Editorial | 1400 |
| 1680 | 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 |
| 16073 | LuoTianyi and the Table | greedy math | Statement | B | Codeforces Round 872 (Div. 2) {1825} | PROGRAMMING | 1000.0 | CodeForces Round 872(Div. 1&2) Editorial | 1000 |
| 20735 | LuoTianyi and the Palindrome String | greedy strings | Statement | A | Codeforces Round 872 (Div. 2) {1825} | PROGRAMMING | 500.0 | CodeForces Round 872(Div. 1&2) Editorial | 800 |
| 17246 | Trust Nobody | brute force greedy implementation sortings | Statement | A | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 500.0 | Codeforces Round #870 (Div. 2) Editorial | 1200 |
| 15648 | Dreaming of Freedom | greedy math number theory | Statement | C | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 1500.0 | Codeforces Round #870 (Div. 2) Editorial | 1300 |
| 4527 | Range Sorting (Easy Version) | binary search dp dsu greedy trees two pointers | Statement | B1 | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2000 |
| 967 | 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 |
| 556 | 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 |
| 32400 | Mr. Perfectly Fine | bitmasks greedy implementation | Statement | C | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 800 | |
| 34134 | Contrast Value | greedy implementation | Statement | C | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 1200 | |
| 3372 | Red-Blue Operations (Easy Version) | binary search greedy implementation math | Statement | D1 | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2100 | |
| 2332 | 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 | |
| 6367 | Ksyusha and Chinchilla | dfs and similar dp dsu greedy implementation trees | Statement | G | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 29569 | Restore the Weather | greedy sortings | Statement | B | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 5537 | 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 | |
| 45175 | Unit Array | greedy math | Statement | A | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 500.0 | Codeforces Round #879 Editorial | |
| 16977 | Maximum Strength | greedy math | Statement | B | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 1000.0 | Codeforces Round #879 Editorial | |
| 1073 | Lottery | binary search brute force greedy math sortings two pointers | Statement | B | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 1250.0 | Codeforces Round 880 Editorial | |
| 13575 | Astrophysicists | greedy math | Statement | B | Codeforces Round 880 (Div. 2) {1836} | PROGRAMMING | 1000.0 | Codeforces Round 880 Editorial | |
| 2655 | Editorial for Two | binary search data structures greedy implementation | Statement | F | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 17788 | Minimize Permutation Subarrays | constructive algorithms greedy math | Statement | B | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1000.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 1534 | Decreasing Game | constructive algorithms dp greedy interactive | Statement | E | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 2750.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 16532 | Lamps | data structures greedy sortings two pointers | Statement | B | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 1000.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 18321 | The Good Array | greedy math | Statement | A | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 500.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 16248 | Wooden Toy Festival | binary search greedy sortings | Statement | D | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 9034 | Ranom Numbers | brute force dp greedy math strings | Statement | C | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 5274 | Pairs of Segments | data structures dp greedy sortings | Statement | D | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 2423 | Fill the Matrix | data structures greedy math | Statement | E | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 25357 | Tenzing and Books | bitmasks greedy math | Statement | B | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 500.0 | CodeTON Round 5 Editorial | |
| 4719 | 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 | |
| 1802 | Tenzing and Tree | brute force dfs and similar greedy trees | Statement | F | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 2500.0 | CodeTON Round 5 Editorial | |
| 6331 | 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 | ||
| 32054 | Long Long | greedy math | Statement | B | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 37270 | Sasha and Array Coloring | greedy sortings | Statement | A | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 475 | 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 | |
| 17828 | 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 | |
| 20228 | 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 | |
| 16745 | Strong Password | binary search dp greedy strings | Statement | C | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 8993 | Rating System | brute force data structures dp greedy implementation math | Statement | D | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 5621 | Rudolf and CodeVid-23 | bitmasks dp graphs greedy shortest paths | Statement | G | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 3711 | Rudolph and Mimic | constructive algorithms greedy implementation interactive | Statement | F | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 21443 | Rudolf and the Another Competition | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 1027 | 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 | |
| 22260 | Hamon Odyssey | bitmasks greedy implementation | Statement | B | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 1000.0 | Tutorial | |
| 4257 | Professor Higashikata | brute force data structures dsu greedy implementation sortings | Statement | D | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 2000.0 | Tutorial | |
| 22892 | The Man who became a God | greedy sortings | Statement | A | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 500.0 | Tutorial | |
| 24219 | 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 | |
| 7153 | Vika and Price Tags | greedy math number theory | Statement | C | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 1500.0 | Codeforces Round #885 (Div.2) Editorial | |
| 877 | 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 | ||
| 44035 | Monsters | greedy sortings | Statement | B | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 60320 | Balanced Round | brute force greedy implementation sortings | Statement | D | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 9941 | The Third Letter | dfs and similar graphs greedy implementation | Statement | H | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 7374 | Lisa and the Martians | bitmasks data structures greedy math sortings strings trees | Statement | F | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 13249 | Nastya and Potions | dfs and similar dp graphs greedy shortest paths sortings | Statement | E | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 25844 | Tiles Comeback | greedy implementation | Statement | C | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 5447 | 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 | |
| 2089 | 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 | |
| 44575 | Longest Divisors Interval | brute force combinatorics greedy math number theory | Statement | B | Codeforces Round 889 (Div. 2) {1855} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 5451 | Counting Graphs | combinatorics divide and conquer dsu graphs greedy sortings | Statement | G | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 24688 | Maximum Rounding | greedy implementation math | Statement | B | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 78208 | Array Coloring | greedy math | Statement | A | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 41449 | Assembly via Minimums | greedy sortings | Statement | C | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 13002 | The Walkway | brute force greedy implementation math number theory | Statement | B | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1250.0 | Codeforces Round #893 (Div. 2) Editorial | 1500 |
| 3186 | 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 |
| 65650 | Buttons | games greedy math | Statement | A | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 500.0 | Codeforces Round #893 (Div. 2) Editorial | 800 |
| 7978 | 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. | |
| 18619 | Another Permutation Problem | brute force dp greedy math | Statement | C | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1250.0 | Video solutions from Geothermal. | |
| 43604 | 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. | |
| 18836 | Fancy Coins | binary search brute force greedy math | Statement | B | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 7929 | Sorting By Multiplication | dp greedy math | Statement | D | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 36207 | Gift Carpet | greedy implementation strings | Statement | A | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 18866 | Channel | greedy implementation | Statement | A | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 500.0 | ||
| 16797 | Split Sort | greedy math sortings | Statement | B | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 750.0 | ||
| 16588 | Swap and Reverse | greedy sortings strings | Statement | B | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1000.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 508 | Most Different Tree | brute force constructive algorithms dfs and similar greedy hashing | Statement | F | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 4000.0 | ||
| 12655 | Salyg1n and the MEX Game | constructive algorithms data structures games greedy interactive | Statement | C | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1250.0 | ||
| 6864 | Cyclic Operations | constructive algorithms dfs and similar graphs greedy implementation | Statement | D | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.0 | ||
| 2741 | 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 | |
| 8302 | 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 | |
| 96 | LIS? | data structures greedy implementation | Statement | F | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 3000.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 16066 | Friendly Arrays | bitmasks greedy math | Statement | B | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 750.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 20191 | 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 | |
| 121 | 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 | |
| 43078 | Two Vessels | greedy math | Statement | A | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 62347 | Good Kid | brute force brute force brute force greedy math | Statement | B | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 19626 | Money Trees | greedy greedy greedy math two pointers | Statement | F | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 42867 | 1D Eraser | greedy implementation | Statement | D | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 19347 | Jellyfish and Game | brute force greedy implementation | Statement | A | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 500.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 2171 | Jellyfish and EVA | dp graphs greedy math probabilities | Statement | C | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 1500.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 13856 | Jellyfish and Green Apple | bitmasks greedy math number theory | Statement | C | Codeforces Round 901 (Div. 2) {1875} | PROGRAMMING | 1000.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 276 | 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 | |
| 34647 | Helmets in Night Light | greedy sortings | Statement | A | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 500.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 7066 | Tree XOR | bitmasks dfs and similar dp greedy trees | Statement | D | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 1209 | 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 | |
| 19132 | 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 | |
| 14678 | Haunted House | greedy math two pointers | Statement | B | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 1000.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 3903 | 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 | |
| 8602 | Doremy's Connecting Plan | greedy sortings | Statement | B | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 1250.0 | Codeforces Round 906 Editorial | |
| 1079 | Brukhovich and Exams | brute force greedy math sortings | Statement | E | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 2000.0 | ||
| 20216 | Smilo and Monsters | constructive algorithms greedy sortings two pointers | Statement | C | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 1000.0 | ||
| 3189 | Freedom of Choice | brute force greedy implementation | Statement | C | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 1250.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 1089 | 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 | |
| 11418 | 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 | |
| 1855 | Infinite Card Game | brute force dfs and similar games graphs greedy sortings | Statement | E | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 21560 | Points and Minimum Distance | greedy math sortings | Statement | B | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 11573 | 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 | |
| 18361 | AB Flipping | greedy strings | Statement | B | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 1000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 2713 | 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) | |
| 14583 | Milena and Admirer | greedy math | Statement | B | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 6602 | Absolute Beauty | greedy math | Statement | D | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 1750.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 18209 | Queue Sort | greedy implementation sortings | Statement | E | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 34570 | Yarik and Array | greedy two pointers | Statement | C | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 8565 | Yet Another Monster Fight | binary search greedy implementation math | Statement | D | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 14202 | 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 | ||
| 1973 | Compressed Tree | dfs and similar dp graphs greedy trees | Statement | E | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 16905 | Chip and Ribbon | greedy math | Statement | B | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 16921 | 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 | ||
| 2504 | 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 | |
| 5668 | 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 | |
| 27652 | Collecting Game | binary search dp greedy two pointers | Statement | B | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 14176 | Largest Subsequence | data structures greedy strings | Statement | C | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 1500.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 18555 | Begginer's Zelda | greedy trees | Statement | B | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 1000.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 2324 | Lights | constructive algorithms dfs and similar graphs greedy implementation | Statement | G | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 23087 | Removal of Unattractive Pairs | constructive algorithms greedy math strings | Statement | C | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 5985 | Shift and Reverse | greedy sortings | Statement | F | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 13138 | 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) | |
| 5109 | Split Plus K | greedy math number theory | Statement | D | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 2000.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 217 | Build Railway Stations | *special greedy trees | Statement | F | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 14209 | Game with Marbles (Easy Version) | brute force games greedy sortings | Statement | E1 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 4980 | Programming Competition | dfs and similar greedy trees | Statement | F | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 14712 | Game with Marbles (Hard Version) | games greedy sortings | Statement | E2 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 39213 | Quests | greedy math | Statement | C | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 34287 | Romantic Glasses | data structures greedy math | Statement | E | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 9600 | Bicycles | dp graphs greedy implementation shortest paths sortings | Statement | G | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 34993 | Unnatural Language Processing | dp greedy implementation strings | Statement | D | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 12343 | Watering an Array | brute force greedy implementation math | Statement | C | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 6145 | 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 | |
| 1095 | Caterpillar on a Tree | binary search dfs and similar graphs greedy implementation trees | Statement | F | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 3000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 16591 | XOR-distance | bitmasks dp greedy implementation math | Statement | C | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 1250.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 26944 | 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 | |
| 32308 | Brick Wall | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 500.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 4555 | 01 Tree | data structures divide and conquer greedy implementation sortings trees | Statement | D | Hello 2024 {1919} | PROGRAMMING | 1500.0 | 2100 | |
| 29521 | Satisfying Constraints | brute force greedy math schedules | Statement | A | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 500.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 23084 | Summation Game | dp games greedy sortings | Statement | B | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 36512 | Arranging Cats | greedy implementation | Statement | B | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 49452 | Square | greedy math | Statement | A | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 32553 | Sending Messages | greedy math | Statement | C | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 24185 | Very Different Array | greedy sortings two pointers | Statement | D | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 6760 | 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 | ||
| 533 | Shrink-Reverse | binary search greedy string suffix structures strings | Statement | F | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial |