Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
< 1 2 3 4 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 22399 | Interesting Sum | data structures greedy math | Statement | B | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1000.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 7663 | Maximum AND | bitmasks brute force divide and conquer greedy math sortings | Statement | D | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 36242 | Mainak and Array | greedy math | Statement | A | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 500.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 2025 | Red-Black Pepper | binary search brute force greedy math number theory sortings ternary search | Statement | E | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 25432 | Colored Balls: Revisited | greedy implementation sortings | Statement | A | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 17912 | Minimum Notation | data structures greedy math sortings | Statement | C | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 1500.0 | Codeforces Round #823 — editorial | 1200 |
| 17163 | Meeting on the Line | binary search greedy implementation math ternary search | Statement | B | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 1000.0 | Codeforces Round #823 — editorial | 1600 |
| 3465 | Graph Cost | dp greedy math number theory | Statement | E | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 2000.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 23651 | Joey Takes Money | greedy math | Statement | A | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 500.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 26606 | Kill Demodogs | greedy math | Statement | B | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 1000.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 15004 | Zero-One (Easy Version) | dp greedy math | Statement | D1 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 28405 | Removing Smallest Multiples | greedy math | Statement | C | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 1250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 22396 | Select Three Sticks | greedy math sortings | Statement | A | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 500.0 | Codeforces Round #822 (Div.2) Editorial | |
| 21046 | Working Week | constructive algorithms greedy math | Statement | A | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 500.0 | Codeforces Round #824 — editorial | |
| 19290 | Tea with Tangerines | greedy math | Statement | B | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 750.0 | Codeforces Round #824 — editorial | |
| 12741 | Even Number Addicts | dp games greedy math | Statement | C | Codeforces Global Round 22 {1738} | PROGRAMMING | 1500.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 24405 | Array Recovery | constructive algorithms greedy math | Statement | B | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 9047 | Knowledge Cards | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1750.0 | Tutorial | 1500 |
| 19336 | Minimize the Thickness | brute force greedy math two pointers | Statement | C | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 38271 | Scuza | binary search greedy math | Statement | E | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 13200 | Orray | bitmasks brute force greedy math | Statement | G | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 24475 | Divisibility by 2^n | greedy math sortings | Statement | D | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 14019 | Permutation Operations | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial | |
| 1655 | Bracket Cost | binary search data structures divide and conquer dp greedy strings | Statement | E | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 2250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 14949 | Factorial Divisibility | greedy math | Statement | B | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 750.0 | Tutorial | 1600 |
| 5478 | Restore the Permutation | binary search data structures greedy math | Statement | G | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 4493 | All Possible Digits | binary search data structures greedy math number theory | Statement | F | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 19361 | Thermostat | greedy math shortest paths | Statement | C | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 22957 | Binary Inversions | data structures greedy math | Statement | E | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 20558 | Divide and Conquer | greedy math number theory | Statement | A | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 500.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 16982 | 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 | |
| 10435 | Doremy's City Construction | constructive algorithms greedy math | Statement | C | Codeforces Global Round 24 {1764} | PROGRAMMING | 1500.0 | Codeforces Global Round 24 Editorial | |
| 6750 | 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 | |
| 10500 | Lucky Chains | brute force dp greedy math number theory | Statement | D | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 25597 | Quick Sort | greedy math | Statement | B | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1000.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 31021 | Greatest Convex | greedy math number theory | Statement | A | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 1599 | Gaining Rating | binary search greedy math sortings | Statement | G | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 26091 | Different Differences | greedy math | Statement | C | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 857 | 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 | |
| 43531 | 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 | |
| 19169 | 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 | |
| 14521 | The Forbidden Permutation | greedy math | Statement | B | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1000.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 24037 | Hall of Fame | constructive algorithms greedy math strings | Statement | A | Hello 2023 {1779} | PROGRAMMING | 500.0 | ||
| 25785 | GCD Partition | brute force greedy math number theory | Statement | B | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1000.0 | 111841 | |
| 2714 | 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 | |
| 8257 | 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 | |
| 14869 | 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 | |
| 22292 | 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 | |
| 19425 | Matching Numbers | constructive algorithms greedy math | Statement | C | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1500.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 3983 | 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 | ||
| 28966 | Taisia and Dice | greedy greedy math | Statement | B | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 16705 | Min Max Sort | binary search brute force greedy math | Statement | C | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 24087 | Stand-up Comedian | greedy math | Statement | B | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 18812 | Yet Another Promotion | greedy math | Statement | A | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 500.0 | Codeforces Round #852 Editorial | |
| 21919 | 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 | |
| 39498 | Not Dividing | constructive algorithms greedy math | Statement | B | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 13994 | 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 |
| 9357 | 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 |
| 12711 | 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 | |
| 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 | |
| 6910 | 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 | |
| 13808 | 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 | |
| 18651 | Lame King | greedy math | Statement | A | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 500.0 | Nebius Welcome Round Editorial | |
| 42992 | 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 | |
| 27659 | Subsequence Addition (Hard Version) | dp greedy implementation math sortings | Statement | G2 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 22309 | Points on Plane | binary search greedy math | Statement | B | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 15129 | Sum on Subarrays | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 34572 | Insert Digit | greedy math strings | Statement | A | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 12447 | Search in Parallel | greedy math sortings | Statement | C | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 15935 | Ian and Array Sorting | greedy implementation math | Statement | A | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #865 | 1300 |
| 5525 | Black Cells | binary search brute force greedy math | Statement | D | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 2696 | Rearrange Brackets | dp greedy math sortings | Statement | E | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 26555 | Karina and Array | greedy math | Statement | B | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 12314 | Making Anti-Palindromes | greedy math strings | Statement | E | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 4300 | Unique Palindromes | binary search constructive algorithms greedy math strings | Statement | D | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2000.0 | 115465 | |
| 13816 | Strongly Composite | greedy math number theory | Statement | C | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 1250.0 | 115465 | |
| 16072 | 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 |
| 15643 | 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 |
| 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 | |
| 45125 | Unit Array | greedy math | Statement | A | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 500.0 | Codeforces Round #879 Editorial | |
| 16975 | Maximum Strength | greedy math | Statement | B | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 1000.0 | Codeforces Round #879 Editorial | |
| 1071 | 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 | |
| 13574 | Astrophysicists | greedy math | Statement | B | Codeforces Round 880 (Div. 2) {1836} | PROGRAMMING | 1000.0 | Codeforces Round 880 Editorial | |
| 17787 | Minimize Permutation Subarrays | constructive algorithms greedy math | Statement | B | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1000.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 18319 | The Good Array | greedy math | Statement | A | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 500.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 9032 | Ranom Numbers | brute force dp greedy math strings | Statement | C | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 2422 | Fill the Matrix | data structures greedy math | Statement | E | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 25342 | 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 | |
| 6329 | 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 | ||
| 32050 | Long Long | greedy math | Statement | B | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 17822 | 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 | |
| 20225 | 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 | |
| 8991 | Rating System | brute force data structures dp greedy implementation math | Statement | D | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 1026 | 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 | |
| 24201 | 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 | |
| 7147 | 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 | |
| 7373 | Lisa and the Martians | bitmasks data structures greedy math sortings strings trees | Statement | F | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 2088 | 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 | |
| 44554 | 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) | |
| 24684 | Maximum Rounding | greedy implementation math | Statement | B | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 78162 | Array Coloring | greedy math | Statement | A | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 12999 | 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 |
| 65597 | Buttons | games greedy math | Statement | A | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 500.0 | Codeforces Round #893 (Div. 2) Editorial | 800 |
| 18616 | Another Permutation Problem | brute force dp greedy math | Statement | C | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1250.0 | Video solutions from Geothermal. | |
| 43578 | 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. | |
| 18834 | 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 | ||
| 7928 | Sorting By Multiplication | dp greedy math | Statement | D | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 16796 | Split Sort | greedy math sortings | Statement | B | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 750.0 | ||
| 2739 | 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 | |
| 8299 | 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 | |
| 16065 | 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 | |
| 20190 | 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 | |
| 43067 | Two Vessels | greedy math | Statement | A | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 62329 | Good Kid | brute force brute force brute force greedy math | Statement | B | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 19617 | Money Trees | greedy greedy greedy math two pointers | Statement | F | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 2169 | 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 | |
| 13852 | 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 | |
| 19131 | 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 | |
| 14673 | Haunted House | greedy math two pointers | Statement | B | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 1000.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 1079 | Brukhovich and Exams | brute force greedy math sortings | Statement | E | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 2000.0 | ||
| 1086 | 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 | |
| 1854 | 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 | ||
| 21557 | Points and Minimum Distance | greedy math sortings | Statement | B | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 14577 | Milena and Admirer | greedy math | Statement | B | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 6600 | Absolute Beauty | greedy math | Statement | D | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 1750.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 8561 | 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 | ||
| 14198 | 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 | ||
| 16901 | Chip and Ribbon | greedy math | Statement | B | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 16915 | 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 | ||
| 2503 | 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 | |
| 23083 | Removal of Unattractive Pairs | constructive algorithms greedy math strings | Statement | C | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 13137 | 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) | |
| 5108 | 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) | |
| 39186 | Quests | greedy math | Statement | C | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 34259 | Romantic Glasses | data structures greedy math | Statement | E | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 12341 | 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) | |
| 16586 | XOR-distance | bitmasks dp greedy implementation math | Statement | C | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 1250.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 32303 | Brick Wall | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 500.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 29517 | 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) | |
| 49442 | Square | greedy math | Statement | A | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 32546 | Sending Messages | greedy math | Statement | C | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 23069 | A Balanced Problemset? | brute force greedy math number theory | Statement | B | Codeforces Round 921 (Div. 2) {1925} | PROGRAMMING | 1000.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 31497 | Choose the Different Ones! | brute force greedy math | Statement | C | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 1976 | Paint Charges | data structures dp greedy math | Statement | G | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 5153 | Lonely Mountain Dungeons | binary search brute force data structures greedy math ternary search | Statement | D | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 1750.0 | Codeforces Round 924 Editorial | |
| 2088 | Modular Sequence | constructive algorithms dp greedy implementation math number theory | Statement | E | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 2250.0 | Codeforces Round 924 Editorial | |
| 24396 | Rectangle Cutting | constructive algorithms geometry greedy math | Statement | A | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 500.0 | Codeforces Round 924 Editorial | |
| 17241 | Sasha and the Casino | binary search brute force dp games greedy math | Statement | C | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 1500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 26697 | Sasha and the Drawing | constructive algorithms greedy math | Statement | B | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 1000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 4843 | Sum over all Substrings (Easy Version) | brute force dp greedy strings | Statement | D1 | think-cell Round 1 {1930} | PROGRAMMING | 1250.0 | think-cell Round 1 Editorial | |
| 3044 | Sum over all Substrings (Hard Version) | dp greedy strings | Statement | D2 | think-cell Round 1 {1930} | PROGRAMMING | 1000.0 | think-cell Round 1 Editorial | |
| 33787 | Make Equal Again | brute force greedy math | Statement | C | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 25527 | Anna and the Valentine's Day Gift | games greedy math sortings | Statement | E | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 42022 | Turtle Puzzle: Rearrange and Negate | greedy math sortings | Statement | A | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 21966 | Yet Another Coin Problem | brute force dp greedy math | Statement | B | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1000.0 | Tutorial | |
| 8057 | Find a Mine | constructive algorithms geometry greedy interactive math | Statement | C | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1500.0 | Tutorial | |
| 27220 | Too Min Too Max | constructive algorithms greedy math | Statement | A | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 500.0 | Tutorial | |
| 1645 | Distance Learning Courses in MAC | binary search bitmasks data structures greedy implementation math | Statement | E | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 2500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 8637 | Bitwise Operation Wizard | bitmasks constructive algorithms greedy interactive math | Statement | A | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 500.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 17284 | Binary Path | greedy implementation | Statement | B | Codeforces Round 930 (Div. 2) {1937} | PROGRAMMING | 1000.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 34665 | Rudolf and 121 | greedy math | Statement | B | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 6861 | Bessie's Birthday Cake (Hard Version) | geometry greedy math | Statement | C2 | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 750.0 | CodeTON Round 8 Editorial | |
| 30286 | Setting up Camp | greedy math | Statement | A | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 23374 | Maximum Sum | greedy math | Statement | B | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 1000.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 11251 | 0, 1, 2, Tree! | greedy math trees | Statement | F | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 4466 | No Palindromes | brute force constructive algorithms greedy hashing implementation strings | Statement | E | Codeforces Global Round 25 {1951} | PROGRAMMING | 2250.0 | Codeforces Global Round 25 Editorial | |
| 6288 | Buying Jewels | constructive algorithms greedy math | Statement | D | Codeforces Global Round 25 {1951} | PROGRAMMING | 1750.0 | Codeforces Global Round 25 Editorial | |
| 22522 | Dual Trigger | greedy math | Statement | A | Codeforces Global Round 25 {1951} | PROGRAMMING | 500.0 | Codeforces Global Round 25 Editorial | |
| 13737 | Ticket Hoarding | greedy math sortings | Statement | C | Codeforces Global Round 25 {1951} | PROGRAMMING | 1500.0 | Codeforces Global Round 25 Editorial | |
| 8005 | Colored Balls | combinatorics dp greedy math sortings | Statement | D | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 2955 | Chain Reaction | data structures dsu greedy implementation math number theory | Statement | E | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 22699 | Long Multiplication | greedy math | Statement | C | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 8686 | Unfair Game | dp games greedy math | Statement | F | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 24454 | Inhabitant of the Deep Sea | greedy implementation math | Statement | C | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 15097 | Nene's Magical Matrix | constructive algorithms greedy math | Statement | C | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 1500.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 16651 | Everything Nim | games greedy math sortings | Statement | A | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 500.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 1400 |
| 2344 | Folding Strip | constructive algorithms greedy strings | Statement | C | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 1500.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 2300 |
| 14908 | Permutation Counting | binary search greedy implementation math sortings | Statement | A | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 750.0 | Tutorial | 1400 |
| 17364 | Permutation Game | brute force dfs and similar games graphs greedy math | Statement | D | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1300 | |
| 5687 | Shop Game | data structures greedy math sortings | Statement | D | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 1900 | |
| 16778 | Cat, Fox and the Lonely Array | binary search bitmasks data structures greedy math two pointers | Statement | B | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #945 (Div. 2) | 1300 |
| 9828 | Cat, Fox and Double Maximum | constructive algorithms greedy implementation math sortings | Statement | C | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #945 (Div. 2) | 1700 |
| 37835 | Phone Desktop | greedy math | Statement | A | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 800 | |
| 21014 | 378QAQ and Mocha's Array | brute force greedy math sortings | Statement | B | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 500.0 | editorial_zh.pdf | 1000 |
| 339 | Zimpha Fan Club | fft greedy math strings | Statement | G | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 3000.0 | editorial_zh.pdf | 3000 |
| 216 | 378QAQ and Core | greedy strings | Statement | H | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 4500.0 | editorial_zh.pdf | 3500 |
| 1298 | Splittable Permutations | combinatorics data structures dfs and similar greedy math trees | Statement | E | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 19862 | Binary Colouring | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1250.0 | 129858 | 1100 |
| 8011 | Nikita and LCM | brute force data structures dp greedy math number theory sortings | Statement | C | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1750.0 | 129858 | 1900 |
| 25285 | New Bakery | binary search greedy math ternary search | Statement | B | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 750.0 | 130527 | |
| 17750 | Manhattan Permutations | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1250.0 | 130527 | |
| 13595 | Elections | data structures greedy implementation math | Statement | D | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1500.0 | 130527 | |
| 17321 | GCD-sequence | greedy implementation math math number theory number theory | Statement | D | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 6329 | Turtle and an Incomplete Sequence | bitmasks constructive algorithms greedy implementation math | Statement | C | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 1500.0 | Simplified Chinese Tutorial | |
| 24224 | Turtle and Piggy Are Playing a Game | brute force greedy math | Statement | A | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 500.0 | Simplified Chinese Tutorial | |
| 27468 | Soccer | greedy implementation math sortings | Statement | A | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 500.0 | 130839 | |
| 11001 | Swap Dilemma | constructive algorithms divide and conquer greedy math sortings | Statement | D | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1750.0 | ||
| 18365 | Corner Twist | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1000.0 | ||
| 28922 | Upload More RAM | greedy math | Statement | A | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 250.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 26939 | Split the Multiset | brute force dp greedy math | Statement | A | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 7082 | Smithing Skill | brute force dp greedy math sortings two pointers | Statement | D | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 14519 | Mad MAD Sum | brute force greedy math | Statement | C | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 7869 | Prime XOR Coloring | bitmasks constructive algorithms graphs greedy math number theory | Statement | D | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 2770 | Triangle Formation | brute force greedy math sortings | Statement | F | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 2500.0 | Video Tutorial | |
| 17668 | Absolute Zero | constructive algorithms greedy math | Statement | C | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 49058 | Only Pluses | brute force constructive algorithms greedy math sortings | Statement | A | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 37864 | Angry Monk | greedy math sortings | Statement | B | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 19429 | Fun Game | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 5470 | Wooden Game | bitmasks greedy math trees | Statement | E | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 7349 | Funny Game | constructive algorithms dsu graphs greedy math number theory | Statement | D | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 10131 | Bouquet (Hard Version) | binary search data structures greedy math sortings two pointers | Statement | B2 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 500.0 | Video Tutorial | |
| 10254 | Squaring | brute force constructive algorithms data structures greedy implementation math number theory | Statement | C | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 26380 | Diagonals | brute force greedy implementation math | Statement | A | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 500.0 | Video Tutorial | |
| 6292 | Bomb | binary search greedy math | Statement | F | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 2277 | Eliminating Balls With Merging (Easy Version) | binary search brute force data structures divide and conquer dp greedy math | Statement | E1 | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 16170 | Photoshoot for Gorillas | combinatorics data structures greedy math | Statement | E | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 6906 | Color Rows and Columns | dp greedy implementation math | Statement | F | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 17655 | Black Circles | brute force constructive algorithms geometry greedy math | Statement | C | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1000.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 13402 | Turtle and a MEX Problem (Easy Version) | greedy math | Statement | D1 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1000.0 | sol-zh.pdf | |
| 1410 | Make a Palindrome | brute force data structures dp greedy math | Statement | F | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 21564 | The Strict Teacher (Hard Version) | binary search greedy math sortings | Statement | B2 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 500.0 | Discussion stream (With Hints) | |
| 24670 | The Strict Teacher (Easy Version) | greedy math sortings | Statement | B1 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 500.0 | Discussion stream (With Hints) | |
| 9292 | Iris and Game on the Tree | games graphs greedy trees | Statement | A | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 750.0 | Tutorial | |
| 6645 | Sakurako's Task | binary search brute force greedy math number theory | Statement | G | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 3580 | Sakurako's Test | binary search brute force greedy math number theory | Statement | H | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 41681 | Sakurako's Exam | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 7440 | Minimize the Difference | binary search data structures greedy implementation math | Statement | D | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 4199 | Prefix GCD | brute force dp greedy math number theory | Statement | E | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2500.0 | 134298 | |
| 28142 | Battle for Survive | constructive algorithms greedy math | Statement | B | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 750.0 | 134298 | |
| 27384 | Robin Hood in Town | binary search divide and conquer greedy math | Statement | C | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 237 | Complex Segments (Easy Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E1 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 203 | Complex Segments (Hard Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E2 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 5161 | Speedbreaker | binary search dp greedy implementation math two pointers | Statement | B | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 12567 | Cards Partition | brute force greedy implementation math | Statement | A | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 325 | Speedbreaker Counting (Easy Version) | combinatorics dp games greedy implementation math | Statement | F1 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 283 | Speedbreaker Counting (Medium Version) | dp greedy math | Statement | F2 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 300 | Speedbreaker Counting (Hard Version) | dp greedy math | Statement | F3 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 25821 | Find Minimum Operations | bitmasks greedy math | Statement | A | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 500.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 1918 | Digital Village (Easy Version) | brute force data structures dp dsu graphs greedy implementation math shortest paths trees | Statement | E1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 18751 | Maximize Mex | brute force greedy math number theory | Statement | B | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 676 | Digital Village (Extreme Version) | data structures dp graphs greedy math | Statement | E3 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1000.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 953 | Boss, Thirsty | data structures dp greedy math | Statement | D | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 2500.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 21483 | Meaning Mean | data structures greedy math sortings | Statement | A | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 500.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 17198 | Bus to Pénjamo | greedy implementation math | Statement | A | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 750.0 | Codeforces Round 978 (Div 2) Editorial | |
| 14471 | Kar Salesman | greedy math | Statement | B | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1000.0 | Codeforces Round 978 (Div 2) Editorial | |
| 1369 | C+K+S | brute force constructive algorithms dfs and similar graphs greedy hashing math strings | Statement | C | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1500.0 | 135341 |