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 ... 8 9 10 11 12 13 14 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 28859 | Count the Number of Pairs | greedy strings | Statement | B | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 4153 | Music Festival | binary search data structures dp greedy sortings | Statement | C | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1250.0 | Codeforces Round #857 Editorial | |
| 7697 | Buying gifts | data structures dp greedy sortings | Statement | B | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1000.0 | Codeforces Round #857 Editorial | |
| 2929 | The way home | dp graphs greedy shortest paths sortings | Statement | D | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1750.0 | Codeforces Round #857 Editorial | |
| 16761 | Likes | greedy implementation | Statement | A | Codeforces Round 857 (Div. 2) {1802} | PROGRAMMING | 500.0 | Codeforces Round #857 Editorial | |
| 13973 | 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 | |
| 5323 | Accommodation | dp greedy | Statement | D | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1500.0 | Nebius Welcome Round Editorial | |
| 15752 | Vaccination | greedy implementation two pointers | Statement | B | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1000.0 | Nebius Welcome Round Editorial | |
| 18748 | Lame King | greedy math | Statement | A | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 500.0 | Nebius Welcome Round Editorial | |
| 9478 | 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) | |
| 532 | 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) | |
| 20267 | 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) | |
| 19912 | Mex Master | constructive algorithms greedy | Statement | B | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1000.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 46384 | Walking Master | geometry greedy math | Statement | A | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 482 | 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 | |
| 487 | GCD Master (hard version) | greedy math sortings | Statement | F2 | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 22685 | Subsequence Addition (Easy Version) | brute force dp greedy implementation sortings | Statement | G1 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 29251 | Subsequence Addition (Hard Version) | dp greedy implementation math sortings | Statement | G2 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 50079 | Grab the Candies | greedy | Statement | B | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 34735 | Find and Replace | greedy implementation strings | Statement | C | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 4394 | Unlucky Numbers | brute force greedy implementation | Statement | C | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1500.0 | Codeforces Round #861 (Div. 2) editorial | 1900 |
| 962 | Traveling in Berland | binary search data structures graphs greedy implementation | Statement | F | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 7373 | Binary String Sorting | binary search dp greedy | Statement | D | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 22627 | Points on Plane | binary search greedy math | Statement | B | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 15381 | Sum on Subarrays | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 21993 | Beautiful Sequence | brute force greedy | Statement | A | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 500.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 16716 | 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!) | |
| 22441 | Restore the Array | constructive algorithms greedy | Statement | C | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 34927 | Insert Digit | greedy math strings | Statement | A | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 12590 | Search in Parallel | greedy math sortings | Statement | C | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 16157 | Ian and Array Sorting | greedy implementation math | Statement | A | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #865 | 1300 |
| 2398 | 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 |
| 16818 | Grid Reconstruction | constructive algorithms greedy | Statement | B | Codeforces Round 865 (Div. 2) {1816} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #865 | 1000 |
| 12869 | Almost Increasing Subsequence | data structures greedy | Statement | A | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 500.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 345 | Half-sum | divide and conquer greedy | Statement | E | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 2500.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 14547 | Politics | greedy implementation | Statement | A | Codeforces Round 869 (Div. 2) {1818} | PROGRAMMING | 500.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 14724 | 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 | |
| 4299 | 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 | |
| 5586 | Black Cells | binary search brute force greedy math | Statement | D | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 29916 | Sort the Subarray | brute force greedy | Statement | B | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 2757 | Rearrange Brackets | dp greedy math sortings | Statement | E | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 26722 | Karina and Array | greedy math | Statement | B | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 12545 | Making Anti-Palindromes | greedy math strings | Statement | E | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 4354 | Unique Palindromes | binary search constructive algorithms greedy math strings | Statement | D | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2000.0 | 115465 | |
| 13977 | Strongly Composite | greedy math number theory | Statement | C | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 1250.0 | 115465 | |
| 12625 | 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 |
| 1717 | LuoTianyi and XOR-Tree | data structures dfs and similar dp dsu greedy trees | Statement | C | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 1750.0 | CodeForces Round 872(Div. 1&2) Editorial | 2500 |
| 16268 | 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 |
| 20921 | 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 |
| 17477 | 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 |
| 15864 | 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 |
| 15690 | Running Miles | brute force dp greedy | Statement | D | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 2000.0 | Codeforces Round #870 (Div. 2) Editorial | 1700 |
| 4603 | 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 |
| 2363 | Range Sorting (Hard Version) | binary search data structures dp greedy | Statement | B2 | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2400 |
| 1016 | Two Centroids | data structures dfs and similar greedy trees | Statement | D | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 1750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2800 |
| 946 | 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 |
| 139 | Copium Permutation | constructive algorithms data structures greedy | Statement | F | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 3500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 3500 |
| 32860 | Mr. Perfectly Fine | bitmasks greedy implementation | Statement | C | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 800 | |
| 37339 | Array merging | constructive algorithms greedy | Statement | B | Codeforces Round 875 (Div. 2) {1831} | PROGRAMMING | 750.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 36358 | Contrast Value | greedy implementation | Statement | C | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 1200 | |
| 3443 | Red-Blue Operations (Easy Version) | binary search greedy implementation math | Statement | D1 | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2100 | |
| 2394 | 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 | |
| 6492 | Ksyusha and Chinchilla | dfs and similar dp dsu greedy implementation trees | Statement | G | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 28030 | Vlad Building Beautiful Array | greedy | Statement | C | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 29846 | Restore the Weather | greedy sortings | Statement | B | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 5622 | Survey in Class | constructive algorithms data structures greedy implementation sortings | Statement | D | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 1750.0 | Codeforces Round #879 Editorial | |
| 48844 | Unit Array | greedy math | Statement | A | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 500.0 | Codeforces Round #879 Editorial | |
| 17195 | Maximum Strength | greedy math | Statement | B | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 1000.0 | Codeforces Round #879 Editorial | |
| 1116 | 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 | |
| 13653 | Astrophysicists | greedy math | Statement | B | Codeforces Round 880 (Div. 2) {1836} | PROGRAMMING | 1000.0 | Codeforces Round 880 Editorial | |
| 2723 | Editorial for Two | binary search data structures greedy implementation | Statement | F | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 23083 | Bracket Coloring | constructive algorithms data structures greedy | Statement | D | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 24848 | Best Binary String | constructive algorithms greedy | Statement | C | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 53182 | Comparison String | greedy | Statement | B | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 17889 | Minimize Permutation Subarrays | constructive algorithms greedy math | Statement | B | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1000.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 1570 | Decreasing Game | constructive algorithms dp greedy interactive | Statement | E | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 2750.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 13543 | Insert Zero and Invert Prefix | constructive algorithms greedy | Statement | C | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 1500.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 16652 | Lamps | data structures greedy sortings two pointers | Statement | B | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 1000.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 18371 | The Good Array | greedy math | Statement | A | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 500.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 16626 | Wooden Toy Festival | binary search greedy sortings | Statement | D | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 9218 | Ranom Numbers | brute force dp greedy math strings | Statement | C | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 5372 | Pairs of Segments | data structures dp greedy sortings | Statement | D | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 2473 | Fill the Matrix | data structures greedy math | Statement | E | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 26997 | 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 | |
| 4815 | 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 | |
| 1875 | 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 | |
| 1879 | Tenzing and Triangle | data structures dp greedy | Statement | E | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 2000.0 | CodeTON Round 5 Editorial | |
| 174 | Tenzing and Necklace | divide and conquer dp greedy | Statement | I | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 5000.0 | CodeTON Round 5 Editorial | |
| 16839 | Tenzing and Balls | dp greedy | Statement | C | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 1000.0 | CodeTON Round 5 Editorial | |
| 6455 | Omsk Metro (simple version) | data structures dfs and similar dp greedy math trees | Statement | F1 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 32423 | Long Long | greedy math | Statement | B | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 37593 | Sasha and Array Coloring | greedy sortings | Statement | A | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 500 | Min Cost Permutation (Hard Version) | binary search data structures graphs greedy sortings | Statement | F2 | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 18049 | 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 | |
| 20382 | 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 | |
| 936 | Min Cost Permutation (Easy Version) | greedy | Statement | F1 | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 2000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 17021 | Strong Password | binary search dp greedy strings | Statement | C | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 9155 | Rating System | brute force data structures dp greedy implementation math | Statement | D | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 5872 | Rudolf and CodeVid-23 | bitmasks dp graphs greedy shortest paths | Statement | G | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 3772 | Rudolph and Mimic | constructive algorithms greedy implementation interactive | Statement | F | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 21783 | Rudolf and the Another Competition | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 1102 | The Boss's Identity | binary search bitmasks data structures dfs and similar greedy math sortings | Statement | F | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 3000.0 | Tutorial | |
| 14949 | Vampiric Powers, anyone? | bitmasks brute force data structures dp greedy | Statement | C | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 1500.0 | Tutorial | |
| 22498 | Hamon Odyssey | bitmasks greedy implementation | Statement | B | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 1000.0 | Tutorial | |
| 4303 | Professor Higashikata | brute force data structures dsu greedy implementation sortings | Statement | D | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 2000.0 | Tutorial | |
| 22956 | The Man who became a God | greedy sortings | Statement | A | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 500.0 | Tutorial | |
| 25950 | Vika and the Bridge | binary search data structures greedy implementation math sortings | Statement | B | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 1000.0 | Codeforces Round #885 (Div.2) Editorial | |
| 7240 | 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 | |
| 903 | XOR Partition | binary search bitmasks data structures divide and conquer greedy trees | Statement | F | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 10478 | Array Painting | brute force constructive algorithms dp greedy | Statement | D | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 47064 | Monsters | greedy sortings | Statement | B | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 64233 | Balanced Round | brute force greedy implementation sortings | Statement | D | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 10159 | The Third Letter | dfs and similar graphs greedy implementation | Statement | H | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 7750 | Lisa and the Martians | bitmasks data structures greedy math sortings strings trees | Statement | F | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 13526 | Nastya and Potions | dfs and similar dp graphs greedy shortest paths sortings | Statement | E | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 26113 | Tiles Comeback | greedy implementation | Statement | C | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 630 | Miriany and Matchstick | constructive algorithms dp greedy | Statement | D | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 2000.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 5533 | 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 | |
| 2139 | Ina of the Mountain | data structures dp greedy math | Statement | C | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 1250.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 59440 | Desorting | brute force greedy | Statement | A | Codeforces Round 887 (Div. 2) {1853} | PROGRAMMING | 500.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 47748 | 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) | |
| 5607 | Counting Graphs | combinatorics divide and conquer dsu graphs greedy sortings | Statement | G | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 24890 | Maximum Rounding | greedy implementation math | Statement | B | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 83283 | Array Coloring | greedy math | Statement | A | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 44017 | Assembly via Minimums | greedy sortings | Statement | C | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 13136 | 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 |
| 3235 | Trees and Segments | binary search brute force constructive algorithms data structures dp greedy two pointers | Statement | D | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 2000.0 | Codeforces Round #893 (Div. 2) Editorial | 2200 |
| 70287 | Buttons | games greedy math | Statement | A | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 500.0 | Codeforces Round #893 (Div. 2) Editorial | 800 |
| 8064 | Andrey and Escape from Capygrad | binary search data structures dp dsu greedy sortings two pointers | Statement | D | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1750.0 | Video solutions from Geothermal. | |
| 18839 | Another Permutation Problem | brute force dp greedy math | Statement | C | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1250.0 | Video solutions from Geothermal. | |
| 46398 | 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. | |
| 19136 | 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 | ||
| 15894 | Game on Permutation | data structures games greedy | Statement | C | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 24243 | Two Binary Strings | constructive algorithms dfs and similar greedy | Statement | B | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 8101 | Sorting By Multiplication | dp greedy math | Statement | D | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 12974 | Kolya and Movie Theatre | constructive algorithms data structures greedy | Statement | E | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 36584 | Gift Carpet | greedy implementation strings | Statement | A | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 10888 | Two-Colored Dominoes | constructive algorithms greedy | Statement | D | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 1250.0 | ||
| 18929 | Channel | greedy implementation | Statement | A | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 500.0 | ||
| 16903 | Split Sort | greedy math sortings | Statement | B | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 750.0 | ||
| 7719 | Matrix Cascade | brute force constructive algorithms dp greedy | Statement | D | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 110 | Future Dominators | graphs greedy | Statement | I | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 4250.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 16764 | 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 | |
| 2238 | Grouped Carriages | binary search data structures greedy | Statement | G | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 1595 | Digital Wallet | dp greedy | Statement | D | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 549 | Most Different Tree | brute force constructive algorithms dfs and similar greedy hashing | Statement | F | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 4000.0 | ||
| 12791 | Salyg1n and the MEX Game | constructive algorithms data structures games greedy interactive | Statement | C | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1250.0 | ||
| 6941 | Cyclic Operations | constructive algorithms dfs and similar graphs greedy implementation | Statement | D | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.0 | ||
| 2802 | 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 | |
| 8420 | 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 | |
| 135 | LIS? | data structures greedy implementation | Statement | F | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 3000.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 120 | Min-Sum-Max | dp greedy | Statement | E | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 2500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 8112 | Prefix Purchase | binary search data structures greedy | Statement | D | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 1750.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 16438 | 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 | |
| 20308 | 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 | |
| 127 | Standard Graph Problem | data structures graphs greedy trees | Statement | H | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 4000.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 43552 | Two Vessels | greedy math | Statement | A | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 63987 | Good Kid | brute force brute force brute force greedy math | Statement | B | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 17205 | ABBC or BACB | greedy | Statement | G | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 20206 | Money Trees | greedy greedy greedy math two pointers | Statement | F | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 43913 | 1D Eraser | greedy implementation | Statement | D | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 19602 | 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 | |
| 2228 | 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 | |
| 14073 | 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 | |
| 50229 | Jellyfish and Undertale | greedy | Statement | A | Codeforces Round 901 (Div. 2) {1875} | PROGRAMMING | 500.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 287 | Clubstep | binary search brute force data structures greedy trees | Statement | G | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 3250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 37555 | 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 | |
| 22124 | Iva & Pav | binary search bitmasks data structures greedy | Statement | E | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 10251 | Reverse Madness | data structures greedy | Statement | D | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 83558 | How Much Does Daytona Cost? | greedy | Statement | A | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 28570 | Make it Alternating | combinatorics dp greedy | Statement | C | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 1300 | |
| 24663 | Rigged! | greedy | Statement | A | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 800 | |
| 25244 | Chips on the Board | constructive algorithms greedy | Statement | B | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 900 | |
| 17556 | Sets and Union | bitmasks brute force constructive algorithms greedy | Statement | B | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 1000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 7275 | 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 | |
| 1247 | 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 | |
| 14591 | Card Game | dp greedy | Statement | C | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 1500.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 27413 | Increasing Sequence | greedy | Statement | A | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 500.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 10093 | Look Back | bitmasks greedy | Statement | E | Codeforces Round 905 (Div. 3) {1883} | PROGRAMMING | 2500.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 19233 | 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 | |
| 14917 | Haunted House | greedy math two pointers | Statement | B | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 1000.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 259 | Diamond Theft | data structures greedy | Statement | F | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 3967 | Doremy's Drying Plan (Easy Version) | brute force data structures dp greedy sortings | Statement | C1 | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 750.0 | Codeforces Round 906 Editorial | |
| 15489 | Qingshan Loves Strings 2 | constructive algorithms greedy | Statement | A | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 750.0 | Codeforces Round 906 Editorial | |
| 8712 | Doremy's Connecting Plan | greedy sortings | Statement | B | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 1250.0 | Codeforces Round 906 Editorial | |
| 1111 | Brukhovich and Exams | brute force greedy math sortings | Statement | E | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 2000.0 | ||
| 21405 | Smilo and Monsters | constructive algorithms greedy sortings two pointers | Statement | C | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 1000.0 | ||
| 3263 | 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 | |
| 1121 | 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 | |
| 11798 | 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 | |
| 1902 | 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 | ||
| 21721 | Points and Minimum Distance | greedy math sortings | Statement | B | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 11810 | 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 | |
| 18760 | 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 | |
| 2766 | Sofia and Strings | data structures greedy strings | Statement | E | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 2000.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 14802 | Milena and Admirer | greedy math | Statement | B | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 6795 | Absolute Beauty | greedy math | Statement | D | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 1750.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 18560 | Queue Sort | greedy implementation sortings | Statement | E | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 36920 | Yarik and Array | greedy two pointers | Statement | C | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 8753 | 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 | ||
| 14477 | 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 | ||
| 2026 | 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 | ||
| 17169 | Chip and Ribbon | greedy math | Statement | B | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 17441 | 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 | ||
| 7409 | Maximum And Queries (easy version) | binary search bitmasks brute force greedy | Statement | D1 | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 15024 | StORage room | bitmasks brute force constructive algorithms greedy | Statement | B | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1000.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 85842 | Halloumi Boxes | brute force greedy | Statement | A | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 2577 | 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 | |
| 14728 | Theofanis' Nightmare | constructive algorithms dp greedy | Statement | C | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 5826 | Set To Max (Hard Version) | binary search constructive algorithms data structures dsu greedy implementation sortings two pointers | Statement | D2 | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 29784 | 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 | |
| 8791 | Set To Max (Easy Version) | brute force constructive algorithms greedy | Statement | D1 | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 1250.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 14393 | Largest Subsequence | data structures greedy strings | Statement | C | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 1500.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 18820 | Begginer's Zelda | greedy trees | Statement | B | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 1000.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 3523 | Triangle Construction | greedy | Statement | M | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 2401 | Lights | constructive algorithms dfs and similar graphs greedy implementation | Statement | G | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 23435 | Removal of Unattractive Pairs | constructive algorithms greedy math strings | Statement | C | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 6059 | Shift and Reverse | greedy sortings | Statement | F | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 13379 | Heavy Intervals | constructive algorithms data structures dsu greedy math sortings | Statement | C | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 5185 | 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) | |
| 809 | Security Guard | *special greedy | Statement | B | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 413 | Remove and Add | *special greedy | Statement | D | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 79 | Pool Records | *special greedy | Statement | G | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 225 | Build Railway Stations | *special greedy trees | Statement | F | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 17694 | Game with Multiset | binary search bitmasks greedy | Statement | C | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 14421 | 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 | ||
| 5109 | Programming Competition | dfs and similar greedy trees | Statement | F | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 14951 | Game with Marbles (Hard Version) | games greedy sortings | Statement | E2 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 41797 | Quests | greedy math | Statement | C | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 36368 | Romantic Glasses | data structures greedy math | Statement | E | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 10209 | Bicycles | dp graphs greedy implementation shortest paths sortings | Statement | G | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 35502 | Unnatural Language Processing | dp greedy implementation strings | Statement | D | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 12559 | 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) | |
| 6395 | Blocking Elements | binary search data structures dp greedy implementation two pointers | Statement | D | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 2000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 1162 | 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 | |
| 17080 | XOR-distance | bitmasks dp greedy implementation math | Statement | C | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 1250.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 27387 | Minimize Inversions | constructive algorithms data structures greedy implementation sortings | Statement | B | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 1000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 32558 | Brick Wall | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 500.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 29989 | Grouping Increases | data structures dp greedy | Statement | C | Hello 2024 {1919} | PROGRAMMING | 1000.0 | 1400 | |
| 4624 | 01 Tree | data structures divide and conquer greedy implementation sortings trees | Statement | D | Hello 2024 {1919} | PROGRAMMING | 1500.0 | 2100 | |
| 31764 | Plus-Minus Split | greedy | Statement | B | Hello 2024 {1919} | PROGRAMMING | 500.0 | 800 | |
| 29782 | 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) | |
| 23365 | Summation Game | dp games greedy sortings | Statement | B | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 11589 | Eat the Chip | brute force games greedy | Statement | E | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 36768 | Arranging Cats | greedy implementation | Statement | B | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 50161 | Square | greedy math | Statement | A | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 32918 | Sending Messages | greedy math | Statement | C | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 24513 | Very Different Array | greedy sortings two pointers | Statement | D | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 6907 | Berserk Monsters | data structures dfs and similar greedy implementation | Statement | D | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 22339 | Closest Cities | greedy | Statement | C | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial |