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 5 6 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 34572 | Insert Digit | greedy math strings | Statement | A | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 6286 | Unmysterious Language | *special interactive strings | Statement | J | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 419 | Bosco and Particle | dp math number theory strings | Statement | E | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #865 | 3100 |
| 327 | Entangled Substrings | string suffix structures | Statement | F | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 3000.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 14562 | 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 | |
| 174 | Willy-nilly, Crack, Into Release! | data structures dp | Statement | F | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 3000.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 17611 | Yura's New Name | implementation strings | Statement | A | Codeforces Round 866 (Div. 2) {1820} | PROGRAMMING | 500.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 22822 | JoJo's Incredible Adventures | math strings two pointers | Statement | B | Codeforces Round 866 (Div. 2) {1820} | PROGRAMMING | 1000.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 16184 | Tear It Apart | brute force implementation math strings | Statement | C | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 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 | |
| 20731 | 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 |
| 1645 | Palindrome Partition | binary search brute force data structures dp hashing strings | Statement | C | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 1500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2600 |
| 556 | Bus Routes | binary search constructive algorithms dfs and similar greedy trees | Statement | E | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 2500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 3400 |
| 33229 | Gold Rush | brute force dfs and similar dp implementation | Statement | D | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1000 | |
| 70305 | Love Story | implementation strings | Statement | A | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 800 | |
| 2168 | Hyperregular Bracket Strings | combinatorics hashing number theory sortings two pointers | Statement | C | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 1750.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 28929 | New Palindrome | strings | Statement | A | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 800 | |
| 27851 | Vlad Building Beautiful Array | greedy | Statement | C | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 15001 | Game with Reversing | games strings | Statement | C | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 1250.0 | Codeforces Round #879 Editorial | |
| 21402 | Destroyer | sortings | Statement | A | Codeforces Round 880 (Div. 2) {1836} | PROGRAMMING | 750.0 | Codeforces Round 880 Editorial | |
| 24539 | Best Binary String | constructive algorithms greedy | Statement | C | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 3691 | Bracket Walk | constructive algorithms data structures implementation sortings strings | Statement | D | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1750.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 9281 | Character Blocking | data structures implementation | Statement | E | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 37976 | Cipher Shifer | implementation strings two pointers | Statement | A | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 9032 | Ranom Numbers | brute force dp greedy math strings | Statement | C | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 24054 | Keep it Beautiful | implementation strings | Statement | B | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 169 | 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 | |
| 2105 | Omsk Metro (hard version) | data structures dfs and similar divide and conquer dp implementation math trees | Statement | F2 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) 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 | ||
| 2151 | Great Grids | constructive algorithms dfs and similar dsu graphs math | Statement | E | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 2000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 13810 | Row Major | constructive algorithms math number theory strings | Statement | D | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 16741 | Strong Password | binary search dp greedy strings | Statement | C | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 5617 | Rudolf and CodeVid-23 | bitmasks dp graphs greedy shortest paths | Statement | G | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 28881 | Rudolph and Tic-Tac-Toe | brute force implementation strings | Statement | B | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 4254 | Professor Higashikata | brute force data structures dsu greedy implementation sortings | Statement | D | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 2000.0 | Tutorial | |
| 12494 | Binary String Copying | binary search brute force data structures hashing strings | Statement | C | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 73804 | To My Critics | implementation sortings | Statement | A | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 53332 | Word on the Paper | implementation strings | Statement | C | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 7373 | Lisa and the Martians | bitmasks data structures greedy math sortings strings trees | Statement | F | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 17281 | Prefix Permutation Sums | implementation math | Statement | D | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 32417 | Parity Sort | sortings two pointers | Statement | B | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 27370 | Good Arrays | constructive algorithms implementation math | Statement | B | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 750.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 78162 | Array Coloring | greedy math | Statement | A | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 23528 | Not a Substring | constructive algorithms dp strings | Statement | A | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 23970 | 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 | ||
| 12284 | Queries for the Array | data structures dfs and similar implementation strings trees | Statement | C | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 36201 | Gift Carpet | greedy implementation strings | Statement | A | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 23010 | Flower City Fence | implementation | Statement | C | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 3035 | Guess Game | bitmasks combinatorics constructive algorithms data structures games math probabilities strings trees | Statement | E | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 2000.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 16586 | 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 | |
| 18611 | XOR Palindromes | bitmasks constructive algorithms strings | Statement | B | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1000.0 | ||
| 6863 | Cyclic Operations | constructive algorithms dfs and similar graphs greedy implementation | Statement | D | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.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 | |
| 552 | Lazy Numbers | binary search math | Statement | F | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 3250.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 70985 | Short Sort | brute force implementation | Statement | A | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 9465 | Mad City | dfs and similar dsu graphs shortest paths | Statement | H | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 77850 | How Much Does Daytona Cost? | greedy | Statement | A | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 57134 | Vasilije in Cacak | math | Statement | C | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 4920 | Vasilije Loves Number Theory | math number theory | Statement | F | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 2877 | Anya and the Mysterious String | binary search data structures implementation | Statement | G | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 58683 | Don't Try to Count | brute force strings | Statement | A | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 28641 | Three Threadlets | math | Statement | B | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 28182 | Divide and Equalize | math number theory | Statement | D | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 14479 | In Love | data structures | Statement | D | Codeforces Round 905 (Div. 3) {1883} | PROGRAMMING | 1750.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 59082 | Chemistry | strings | Statement | B | Codeforces Round 905 (Div. 3) {1883} | PROGRAMMING | 1000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 16463 | Decreasing String | constructive algorithms strings | Statement | C | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 1253 | Split | binary search data structures divide and conquer math two pointers | Statement | D | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 1250.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 15269 | Qingshan Loves Strings 2 | constructive algorithms greedy | Statement | A | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 750.0 | Codeforces Round 906 Editorial | |
| 56379 | Doremy's Paint 3 | constructive algorithms | Statement | A | Codeforces Round 906 (Div. 2) {1890} | PROGRAMMING | 500.0 | Codeforces Round 906 Editorial | |
| 18721 | Qingshan Loves Strings | implementation | Statement | B | Codeforces Round 906 (Div. 2) {1890} | PROGRAMMING | 750.0 | Codeforces Round 906 Editorial | |
| 12991 | Torn Lucky Ticket | brute force dp hashing implementation math | Statement | C | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 11571 | 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 | |
| 6987 | Ones and Twos | data structures math two pointers | Statement | D | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 2000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 116 | Cyclic Hamming (Easy Version) | divide and conquer dp fft math number theory | Statement | H1 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 4000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 141 | Cyclic Hamming (Hard Version) | dp fft math number theory | Statement | H2 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 1000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 18359 | 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 | |
| 17402 | Milica and String | brute force implementation strings | Statement | A | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 500.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 2710 | 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) | |
| 5567 | Collapsing Strings | binary search data structures dfs and similar hashing strings trees | Statement | E | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 14805 | 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 | |
| 5666 | 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 | |
| 8586 | 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 | |
| 14175 | Largest Subsequence | data structures greedy strings | Statement | C | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 1500.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 1085 | Twin Friends | combinatorics dp | Statement | H | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 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 | ||
| 30266 | YetnotherrokenKeoard | data structures implementation strings | Statement | B | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 649 | Pumping Lemma | hashing string suffix structures strings | Statement | G | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 4000.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 64 | Inverse Problem | *special combinatorics dp | Statement | I | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 8582 | LOL Lovers | strings | Statement | L | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 800 | |
| 536 | Palindromic Problem | binary search data structures hashing strings | Statement | F | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 50788 | Swap and Delete | strings | Statement | B | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 35086 | Problemsolving Log | implementation strings | Statement | A | 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 | ||
| 34985 | Unnatural Language Processing | dp greedy implementation strings | Statement | D | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 53840 | Can I Square? | implementation | Statement | C | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 9745 | Mathematical Problem | brute force constructive algorithms implementation math strings | Statement | D | Good Bye 2023 {1916} | PROGRAMMING | 1500.0 | ||
| 28259 | 2023 | constructive algorithms implementation math number theory | Statement | A | Good Bye 2023 {1916} | PROGRAMMING | 250.0 | ||
| 36034 | Erase First or Second Letter | brute force combinatorics dp strings | Statement | B | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 3369 | Counting Binary Strings | combinatorics dp math strings | Statement | E | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2250.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 32546 | Sending Messages | greedy math | Statement | C | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 28784 | Tricky Template | constructive algorithms implementation strings | Statement | A | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 533 | Shrink-Reverse | binary search greedy string suffix structures strings | Statement | F | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 18401 | Find B | constructive algorithms data structures greedy | Statement | C | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 19836 | Monsters Attack! | dp greedy implementation | Statement | B | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 16681 | Did We Get Everything Covered? | constructive algorithms dp greedy strings | Statement | A | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 500.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 31114 | We Got Everything Covered! | constructive algorithms greedy strings | Statement | A | Codeforces Round 921 (Div. 2) {1925} | PROGRAMMING | 500.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 61856 | Vlad and the Best of Five | implementation | Statement | A | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 31497 | Choose the Different Ones! | brute force greedy math | Statement | C | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 37987 | Following the String | constructive algorithms greedy strings | Statement | B | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 51264 | Make it White | greedy strings | Statement | A | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 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. | |
| 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 | |
| 100 | Counting Is Fun | combinatorics | Statement | I | think-cell Round 1 {1930} | PROGRAMMING | 5000.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 | |
| 39864 | Recovering a Small String | brute force strings | Statement | A | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 11921 | Chat Screenshots | combinatorics dfs and similar graphs implementation | Statement | F | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 35289 | Make Equal | greedy | Statement | B | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 23455 | Turtle Tenacity: Continual Mods | constructive algorithms greedy number theory sortings | Statement | D | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 30293 | Entertainment in MAC | constructive algorithms strings | Statement | A | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 500.0 | Codeforces Round #932 (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 | |
| 39071 | Rudolf and the Ugly String | dp strings | Statement | C | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 34665 | Rudolf and 121 | greedy math | Statement | B | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 4528 | Non-Palindromic Substring | data structures hashing implementation math strings | Statement | B | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 1250.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 140 | Minimum Hamming Distance | dp | Statement | F | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 4500.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 850 | GCD is Greater | bitmasks brute force number theory | Statement | H | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 12232 | Tandem Repeats? | brute force dp strings two pointers | Statement | D | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 6039 | Shuffling Songs | bitmasks dp graphs implementation strings | Statement | G | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 17378 | Nearly Shortest Repeating Substring | brute force implementation number theory strings | Statement | E | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 26438 | Product of Binary Decimals | dp implementation number theory | Statement | D | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 69061 | Stair, Peak, or Neither? | implementation | Statement | A | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 46749 | Clock Conversion | implementation math | Statement | C | 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 | |
| 14088 | Are You a Robot, Again? | expression parsing graphs strings | Statement | A | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 12320 | Is it stated? | strings | Statement | B | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 355 | Unique Strings | combinatorics dp math | Statement | F | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 32211 | Progressive Square | constructive algorithms data structures implementation sortings | Statement | B | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 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 |
| 17174 | Rectangle Filling | constructive algorithms implementation | Statement | B | Codeforces Round 941 (Div. 2) {1966} | PROGRAMMING | 1000.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 1100 |
| 6899 | Equal XOR Segments | binary search data structures | Statement | F | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1800 | |
| 5268 | Division + LCP (easy version) | binary search data structures dp hashing string suffix structures strings | Statement | G1 | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1900 | |
| 2494 | Division + LCP (hard version) | binary search brute force data structures dp hashing math string suffix structures strings | Statement | G2 | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 2200 | |
| 31351 | Prefiquence | greedy two pointers | Statement | B | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 800 | |
| 22285 | Shifts and Sorting | constructive algorithms greedy | Statement | B | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 1000 | |
| 937 | Arithmancy (Easy) | brute force constructive algorithms interactive strings | Statement | D1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2100 | |
| 308 | Arithmancy (Medium) | constructive algorithms interactive probabilities strings | Statement | D2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2600 | |
| 160 | Arithmancy (Hard) | interactive | Statement | D3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 3100 | |
| 30478 | Binary Cut | dp greedy implementation sortings strings | Statement | D | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1100 | |
| 44424 | Different String | implementation strings | Statement | B | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 800 | |
| 41363 | Clock and Strings | implementation | Statement | C | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 900 | |
| 25331 | Coin Games | games | Statement | B | Codeforces Round 942 (Div. 2) {1972} | PROGRAMMING | 750.0 | Tutorial | 900 |
| 34355 | Symmetric Encoding | implementation sortings strings | Statement | B | 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 |
| 2861 | Chain Queries | binary search data structures dfs and similar implementation trees | Statement | E | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 2000.0 | editorial_zh.pdf | 2100 |
| 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 |
| 20673 | Bazoka and Mocha's Array | brute force greedy implementation sortings | Statement | A | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 250.0 | editorial_zh.pdf | 800 |
| 5773 | Invertible Bracket Sequences | binary search combinatorics data structures divide and conquer implementation two pointers | Statement | D | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 39020 | Little Nikita | math | Statement | A | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 500.0 | 129858 | 800 |
| 17750 | Manhattan Permutations | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1250.0 | 130527 | |
| 4593 | Computing Machine | data structures dp greedy implementation | Statement | E | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 2000.0 | 130527 | |
| 7833 | Fixing a Binary String | bitmasks brute force constructive algorithms greedy hashing strings | Statement | D | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 2000.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 1689 | Yasya and the Mysterious Tree | bitmasks data structures dfs and similar graphs strings trees | Statement | G | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 12961 | Permutation of Rows and Columns | constructive algorithms data structures hashing math matrices sortings | Statement | E | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 17321 | GCD-sequence | greedy implementation math math number theory number theory | Statement | D | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 38370 | Choosing Cubes | sortings sortings | Statement | B | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 9709 | Beauty of the mountains | brute force data structures implementation math number theory | Statement | D | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 1750.0 | 130839 | |
| 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 | ||
| 20911 | Large Addition | constructive algorithms implementation math | Statement | B | Codeforces Global Round 26 {1984} | PROGRAMMING | 750.0 | Codeforces Global Round 26 Editorial | |
| 3869 | ''a'' String Problem | hashing implementation math string suffix structures strings | Statement | D | Codeforces Global Round 26 {1984} | PROGRAMMING | 2500.0 | Codeforces Global Round 26 Editorial | |
| 71805 | Creating Words | implementation strings | Statement | A | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 26399 | Make Majority | greedy | Statement | B | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 23267 | Substring and Subsequence | bitmasks brute force dp graphs greedy hashing strings trees | Statement | B | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 26792 | Submission Bait | brute force games greedy sortings | Statement | A | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 500.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 | |
| 559 | Prime Split Game | fft games math number theory | Statement | H | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 3500.0 | Video Tutorial | |
| 10727 | Novice's Mistake | brute force constructive algorithms math strings | Statement | E | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 23931 | Test of Love | dp greedy implementation | Statement | D | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 1617 | Minecraft | bitmasks brute force dp math | Statement | G | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2750.0 | 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 | |
| 1523 | Stardew Valley | constructive algorithms dfs and similar graphs | Statement | F | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2500.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 | |
| 2877 | Cases | bitmasks brute force combinatorics dfs and similar dp graphs greedy strings | Statement | D | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 2250.0 | Video Tutorial | |
| 27923 | Sort | strings | Statement | C | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 32583 | Slavic's Exam | greedy implementation strings | Statement | D | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 41488 | Showering | implementation | Statement | C | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 31279 | Numeric String Template | data structures strings | Statement | C | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 43987 | Primary Task | implementation math strings | Statement | A | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 40522 | Seating in a Bus | two pointers | Statement | B | 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 | |
| 21589 | Turtle and Good Pairs | constructive algorithms greedy strings | Statement | C | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1000.0 | sol-zh.pdf | |
| 32606 | Turtle and Good Strings | greedy strings | Statement | A | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 500.0 | sol-zh.pdf | |
| 13205 | Colored Portals | binary search data structures graphs greedy shortest paths | Statement | D | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 420 | Substring Compression | data structures matrices | Statement | G | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 8650 | Lazy Narek | dp implementation | Statement | C | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 1500.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 | |
| 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 | ||
| 13131 | Alternating String | brute force data structures dp greedy strings | Statement | E | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 32893 | Square or Not | math strings | Statement | B | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 9218 | Message Transmission Error (easy version) | strings | Statement | C1 | Testing Round 19 (Div. 3) {2010} | PROGRAMMING | 1400 | ||
| 4562 | Message Transmission Error (hard version) | hashing strings two pointers | Statement | C2 | Testing Round 19 (Div. 3) {2010} | PROGRAMMING | 1700 | ||
| 182 | Rock-Paper-Scissors Bot | *special greedy strings | Statement | E | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | Kotlin Heroes 11 — Editorial | ||
| 14481 | Password Cracking | brute force constructive algorithms interactive strings | Statement | C | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 1250.0 | 134298 | |
| 33124 | Robin Hood and the Major Oak | math | Statement | B | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 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 | |
| 28484 | Two Screens | binary search greedy strings two pointers | Statement | A | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 533 | Alice's Adventures in Addition | bitmasks dp implementation | Statement | F | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 2500.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 20251 | Alice's Adventures in ''Chess'' | brute force implementation math strings | Statement | A | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 500.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 848 | Palindrome Everywhere | constructive algorithms greedy | Statement | F | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 3000.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 11692 | Replacement | games greedy strings | Statement | B | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 1250.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 1155 | Orangutan Approved Subarrays | binary search brute force data structures greedy two pointers | Statement | F | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 2500.0 | Codeforces Round 979 Editorial | |
| 23626 | Minimise Oneness | brute force combinatorics constructive algorithms | Statement | B | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 500.0 | Codeforces Round 979 Editorial | |
| 19765 | A TRUE Battle | brute force games greedy | Statement | C | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 1000.0 | Codeforces Round 979 Editorial | |
| 2015 | Permutations Harmony | brute force combinatorics constructive algorithms greedy hashing implementation math | Statement | E | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 | Rayan 2024 Selection Round Editorial | |
| 22150 | Anya and 1100 | brute force data structures implementation | Statement | C | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 40578 | Quintomania | implementation | Statement | A | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 7349 | Kachina's Favorite Binary String | greedy interactive two pointers | Statement | E | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 746 | Polyathlon | data structures hashing string suffix structures strings | Statement | I | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2500 | ||
| 17241 | Shohag Loves Strings | constructive algorithms greedy implementation strings | Statement | B | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 1000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 24402 | Game of Division | brute force games math | Statement | A | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 500.0 | Codeforces Round #992 (Div.2) Editorial | |
| 671 | Auto Complete | data structures implementation sortings strings trees | Statement | I | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | Problem Analysis and Hints (PDF) | ||
| 51612 | Normal Problem | strings | Statement | B | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 7162 | Saraga | greedy strings | Statement | C | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 1400 | |
| 794 | Missing Separators | dp sortings string suffix structures strings | Statement | H | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 2200 | |
| 19188 | Replace Character | brute force combinatorics greedy strings | Statement | B | Codeforces Round 990 (Div. 2) {2047} | PROGRAMMING | 1000.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 15081 | Kevin and Binary Strings | bitmasks brute force greedy strings | Statement | C | Codeforces Global Round 28 {2048} | PROGRAMMING | 1000.0 | Tutorial | |
| 22814 | Kevin and Combination Lock | brute force implementation math number theory | Statement | A | Codeforces Global Round 28 {2048} | PROGRAMMING | 250.0 | Tutorial | |
| 3478 | Kevin and Bipartite Graph | constructive algorithms graphs greedy | Statement | E | Codeforces Global Round 28 {2048} | PROGRAMMING | 1750.0 | Tutorial | |
| 245 | Kevin and Strange Operation | data structures dp | Statement | H | Codeforces Global Round 28 {2048} | PROGRAMMING | 2750.0 | Tutorial | |
| 18867 | pspspsps | brute force constructive algorithms implementation | Statement | B | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 750.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 24905 | Uninteresting Number | brute force dp math | Statement | C | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 18894 | Digital string maximization | brute force greedy math strings | Statement | D | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 14406 | Three Strings | dp implementation strings | Statement | E | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 224 | Naive String Splits | brute force greedy hashing strings | Statement | G | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 4250.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 89 | Cosmic Divide | brute force geometry hashing math strings | Statement | F | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 3500.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 33516 | Two Frogs | constructive algorithms games greedy | Statement | A | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 500.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 1280 | Bugged Sort | dp greedy sortings | Statement | G | Codeforces Round 998 (Div. 3) {2060} | PROGRAMMING | Codeforces Round 998 (Div. 3) Editorial | ||
| 26130 | Subtract Min Sort | greedy | Statement | D | Codeforces Round 998 (Div. 3) {2060} | PROGRAMMING | Codeforces Round 998 (Div. 3) Editorial | ||
| 2259 | Kevin and Binary String (Easy Version) | binary search brute force data structures dp greedy implementation strings two pointers | Statement | F1 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 2000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 10709 | Kevin and Numbers | brute force data structures greedy implementation math | Statement | D | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 1500.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 23648 | Clockwork | greedy | Statement | B | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 1000.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 28218 | String | greedy strings | Statement | A | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 500.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 27016 | Brogramming Contest | greedy strings | Statement | A | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 500.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 27646 | Skibidus and Fanum Tax (easy version) | binary search greedy | Statement | C1 | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 18708 | Skibidus and Fanum Tax (hard version) | binary search greedy | Statement | C2 | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial |