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 7 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1928 | Serval and Shift-Shift-Shift | bitmasks brute force constructive algorithms implementation | Statement | D | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 1750.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 964 | Serval and Music Game | brute force combinatorics implementation math number theory | Statement | E | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 2000.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 993 | Serval and Brain Power | brute force dp dp greedy implementation | Statement | F | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 2750.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 32616 | Serval and Mocha's Array | brute force math number theory | Statement | A | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 500.0 | Codeforces Round #853 (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 | ||
| 26791 | Premutation | brute force implementation math | Statement | C | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 15463 | Range Update Point Query | binary search brute force data structures | Statement | F | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 48902 | Distinct Split | brute force greedy strings | Statement | D | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 16705 | Min Max Sort | binary search brute force greedy math | Statement | C | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 501 | Graph Coloring (hard version) | brute force fft | Statement | F2 | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 1626 | Rebrending | brute force data structures dp implementation | Statement | F | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 3250.0 | Codeforces Round #852 Editorial | |
| 24627 | Two Towers | brute force implementation strings | Statement | A | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 12143 | Maximum Set | binary search brute force combinatorics dp math | Statement | C | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 8903 | Li Hua and Chess | brute force constructive algorithms greedy hashing interactive | Statement | C | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1500.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 4627 | Li Hua and Tree | brute force data structures dfs and similar dp implementation trees | Statement | D | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1750.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 1634 | Li Hua and Array | brute force data structures math number theory | Statement | E | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 2250.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 18772 | Three Sevens | brute force data structures greedy implementation | Statement | B | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 860 (Div. 2) | 1000 |
| 2053 | Multitest Generator | brute force dp | Statement | E | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round 860 (Div. 2) | 2300 |
| 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 | |
| 1072 | Halve or Subtract | brute force flows greedy sortings | Statement | F | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 2500.0 | Codeforces Round #854 Editorial | |
| 15223 | Unforgivable Curse (hard version) | brute force constructive algorithms constructive algorithms dsu graphs greedy | Statement | E2 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 15542 | Unforgivable Curse (easy version) | brute force constructive algorithms dsu graphs greedy | Statement | E1 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) 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 | |
| 41461 | We Need the Zero | bitmasks brute force | Statement | A | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 1322 | Survival of the Weakest (easy version) | brute force math sortings | Statement | F1 | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 8634 | Sequence Master | brute force constructive algorithms math | Statement | C | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1750.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 3427 | Tree Master | brute force data structures dfs and similar hashing trees | Statement | E | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2250.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 7294 | Bouncy Ball | brute force brute force dfs and similar implementation | Statement | F | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 22192 | Subsequence Addition (Easy Version) | brute force dp greedy implementation sortings | Statement | G1 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 4314 | Unlucky Numbers | brute force greedy implementation | Statement | C | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1500.0 | Codeforces Round #861 (Div. 2) editorial | 1900 |
| 1588 | Minibuses on Venus (easy version) | brute force combinatorics dp | Statement | E1 | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1750.0 | Codeforces Round #861 (Div. 2) editorial | 2200 |
| 564 | Minibuses on Venus (hard version) | brute force combinatorics dp math | Statement | E3 | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 750.0 | Codeforces Round #861 (Div. 2) editorial | 2800 |
| 20573 | Lucky Numbers | brute force implementation | Statement | A | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 750.0 | Codeforces Round #861 (Div. 2) editorial | 900 |
| 3896 | Monsters | brute force data structures dfs and similar dsu graphs implementation trees | Statement | E | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 21884 | Beautiful Sequence | brute force greedy | Statement | A | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 500.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 16520 | Make It Permutation | brute force greedy sortings | Statement | C | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 1000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 6050 | Was it Rated? | *special *special *special brute force implementation | Statement | B | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 1021 | Balancing Weapons | binary search brute force two pointers | Statement | D | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 917 | Communication Towers | brute force divide and conquer dsu | Statement | F | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 11534 | Long Legs | brute force math | Statement | B | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 5074 | Fish Graph | brute force constructive algorithms dfs and similar graphs trees | Statement | B | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 1000.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 | |
| 5525 | Black Cells | binary search brute force greedy math | Statement | D | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 28132 | Sort the Subarray | brute force greedy | Statement | B | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 16184 | Tear It Apart | brute force implementation math strings | Statement | C | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 7599 | Gardening Friends | brute force dfs and similar dp graphs trees | Statement | F | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 25993 | TubeTube Feed | brute force implementation sortings | Statement | A | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 9414 | Magic Triples (Easy Version) | brute force math number theory | Statement | G1 | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 3029 | Magic Triples (Hard Version) | brute force math number theory | Statement | G2 | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 18077 | Sort with Step | brute force math sortings | Statement | B | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 1000.0 | 115465 | |
| 17242 | Trust Nobody | brute force greedy implementation sortings | Statement | A | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 500.0 | Codeforces Round #870 (Div. 2) Editorial | 1200 |
| 14825 | Running Miles | brute force dp greedy | Statement | D | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 2000.0 | Codeforces Round #870 (Div. 2) Editorial | 1700 |
| 1946 | Walk the Runway | bitmasks brute force data structures dp graphs implementation sortings | Statement | E | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 2500.0 | Codeforces Round #870 (Div. 2) Editorial | 2400 |
| 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 |
| 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 | |
| 5814 | The BOSS Can Count Pairs | brute force data structures math | Statement | B | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 1000.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 923 | Mex Tree | brute force dp trees | Statement | D | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 2250.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 35201 | Maximum Sum | brute force sortings two pointers | Statement | B | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 1100 | |
| 2531 | Combinatorics Problem | brute force combinatorics dp | Statement | E | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2200 | |
| 15061 | Flipper | brute force constructive algorithms | Statement | D | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 2761 | MEX of LCM | binary search brute force data structures implementation math number theory two pointers | Statement | E | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 2500.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 | |
| 8716 | k-th equality | brute force implementation math | Statement | A | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 500.0 | Codeforces Round 880 Editorial | |
| 2781 | In Search of Truth (Easy Version) | brute force constructive algorithms interactive math probabilities | Statement | G1 | 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 | ||
| 4715 | Tenzing and His Animal Friends | brute force constructive algorithms graphs greedy shortest paths | Statement | D | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 1500.0 | CodeTON Round 5 Editorial | |
| 1801 | Tenzing and Tree | brute force dfs and similar greedy trees | Statement | F | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 2500.0 | CodeTON Round 5 Editorial | |
| 8991 | Rating System | brute force data structures dp greedy implementation math | Statement | D | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 25022 | Rudolf and Snowflakes (simple version) | binary search brute force implementation math | Statement | E1 | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 8480 | Rudolf and Snowflakes (hard version) | binary search brute force implementation math | Statement | E2 | 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 | |||
| 14730 | Vampiric Powers, anyone? | bitmasks brute force data structures dp greedy | Statement | C | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 1500.0 | Tutorial | |
| 4254 | Professor Higashikata | brute force data structures dsu greedy implementation sortings | Statement | D | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 2000.0 | Tutorial | |
| 2973 | Vika and Bonuses | binary search brute force math ternary search | Statement | D | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 2000.0 | Codeforces Round #885 (Div.2) Editorial | |
| 923 | Vika and Stone Skipping | brute force math number theory | Statement | E | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 2250.0 | Codeforces Round #885 (Div.2) Editorial | |
| 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 | ||
| 10281 | Array Painting | brute force constructive algorithms dp greedy | Statement | D | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 60275 | Balanced Round | brute force greedy implementation sortings | Statement | D | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 24477 | We Were Both Children | brute force implementation math number theory | Statement | F | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 31471 | Escalator Conversations | brute force constructive algorithms implementation math | Statement | A | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 19686 | Fibonaccharsis | binary search brute force math | Statement | B | Codeforces Round 887 (Div. 2) {1853} | PROGRAMMING | 1000.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 55512 | Desorting | brute force greedy | Statement | A | Codeforces Round 887 (Div. 2) {1853} | PROGRAMMING | 500.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 4187 | Earn or Unlock | bitmasks brute force dp | Statement | B | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 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) | |
| 18175 | To Become Max | binary search brute force data structures dp | Statement | C | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 1250.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 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 |
| 3185 | Trees and Segments | binary search brute force constructive algorithms data structures dp greedy two pointers | Statement | D | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 2000.0 | Codeforces Round #893 (Div. 2) Editorial | 2200 |
| 1537 | Rollbacks (Easy Version) | brute force data structures dfs and similar trees | Statement | E1 | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1750.0 | Codeforces Round #893 (Div. 2) Editorial | 2500 |
| 18616 | Another Permutation Problem | brute force dp greedy math | Statement | C | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1250.0 | Video solutions from Geothermal. | |
| 2108 | Maximum Monogonosity | brute force dp math | Statement | E | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 2250.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 | ||
| 7572 | Magic Will Save the World | binary search bitmasks brute force dp | Statement | F | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 3181 | Speedrun | brute force data structures dfs and similar dp graphs sortings | Statement | E | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 1750.0 | ||
| 7614 | Matrix Cascade | brute force constructive algorithms dp greedy | Statement | D | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 1637 | Exotic Queries | brute force data structures implementation sortings | Statement | F | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 2500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 875 | Lihmuf Balling | brute force math | Statement | L | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 508 | Most Different Tree | brute force constructive algorithms dfs and similar greedy hashing | Statement | F | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 4000.0 | ||
| 5013 | Replace With Product | brute force math two pointers | Statement | G | 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 | ||
| 70985 | Short Sort | brute force implementation | Statement | A | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 19343 | Jellyfish and Game | brute force greedy implementation | Statement | A | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 500.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 276 | Clubstep | binary search brute force data structures greedy trees | Statement | G | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 3250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 1565 | Interactive Game with Coloring | brute force constructive algorithms graphs implementation interactive math trees | Statement | E | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 2400 | |
| 19208 | Perfect Square | brute force implementation | Statement | C | 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 | ||
| 17390 | Sets and Union | bitmasks brute force constructive algorithms greedy | Statement | B | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 1000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 1209 | Two Permutations (Easy Version) | brute force constructive algorithms greedy number theory | Statement | E1 | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 4030 | Counting Rhyme | brute force combinatorics dp math number theory sortings | Statement | D | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 2500.0 | Codeforces Round #904 (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 | |
| 4168 | Monocarp and the Set | brute force combinatorics math | Statement | D | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 27682 | Sum of Three | brute force constructive algorithms math | Statement | A | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 3901 | Doremy's Drying Plan (Easy Version) | brute force data structures dp greedy sortings | Statement | C1 | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 750.0 | Codeforces Round 906 Editorial | |
| 4546 | Suspicious logarithms | binary search brute force implementation math number theory | Statement | D | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 1500.0 | ||
| 1079 | Brukhovich and Exams | brute force greedy math sortings | Statement | E | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 2000.0 | ||
| 3186 | Freedom of Choice | brute force greedy implementation | Statement | C | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 1250.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 15045 | Anonymous Informant | brute force implementation | Statement | A | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 500.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 | ||
| 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 | ||
| 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) | |
| 33081 | 250 Thousand Tons of TNT | brute force implementation number theory | Statement | B | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 5338 | Small GCD | brute force math number theory | Statement | D | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 2000.0 | Codeforces Round 911 (Div. 2) 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 | ||
| 7083 | Maximum And Queries (easy version) | binary search bitmasks brute force greedy | Statement | D1 | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 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 | |
| 78513 | Halloumi Boxes | brute force greedy | Statement | A | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 23375 | Array Game | binary search brute force data structures sortings | Statement | C | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 1000.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 39978 | Forked! | brute force | Statement | A | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 500.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 | |
| 747 | Field Should Not Be Empty | brute force data structures divide and conquer | Statement | F | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 2250.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 6003 | Easy As ABC | brute force | Statement | A | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 15661 | Good Triples | brute force combinatorics number theory | Statement | E | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 1675 | Multiple Lamps | brute force constructive algorithms number theory | Statement | E | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 2500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 2385 | Light Bulbs (Easy Version) | brute force combinatorics dfs and similar dp dsu graphs math | Statement | G1 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 37736 | Three Activities | brute force dp implementation sortings | Statement | D | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 14204 | Game with Marbles (Easy Version) | brute force games greedy sortings | Statement | E1 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 50031 | Not Quite Latin Square | brute force implementation | Statement | B | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 713 | Matrix Rank (Easy Version) | brute force combinatorics dp math matrices | Statement | H1 | Good Bye 2023 {1916} | PROGRAMMING | 2750.0 | ||
| 9745 | Mathematical Problem | brute force constructive algorithms implementation math strings | Statement | D | Good Bye 2023 {1916} | PROGRAMMING | 1500.0 | ||
| 2632 | Happy Life in University | brute force data structures dfs and similar dp implementation trees | Statement | E | Good Bye 2023 {1916} | PROGRAMMING | 2000.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) | |
| 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) | |
| 654 | Permutation of Given | brute force constructive algorithms | Statement | G | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 3250.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) | |
| 19771 | Partitioning the Array | brute force number theory | Statement | C | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 4964 | Sum of Progression | brute force data structures implementation math | Statement | F | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 11378 | Eat the Chip | brute force games greedy | Statement | E | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 3272 | Space Harbour | brute force data structures implementation math sortings | Statement | B | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 1000.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 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 | |
| 2087 | Vlad and Avoiding X | bitmasks brute force constructive algorithms dfs and similar dp implementation | Statement | F | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 32887 | Find the Different Ones! | binary search brute force data structures dp greedy two pointers | Statement | D | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 31497 | Choose the Different Ones! | brute force greedy math | Statement | C | 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 | |
| 10328 | Physical Education Lesson | brute force math number theory | Statement | C | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 1500.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. | |
| 2065 | Sasha and the Happy Tree Cutting | bitmasks brute force dp fft graphs greedy trees | Statement | E | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 2500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 935 | Maximize the Difference | bitmasks brute force dfs and similar | Statement | F | think-cell Round 1 {1930} | PROGRAMMING | 2750.0 | think-cell Round 1 Editorial | |
| 17621 | Permutation Printing | brute force constructive algorithms math | Statement | B | think-cell Round 1 {1930} | PROGRAMMING | 1000.0 | think-cell Round 1 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 | |
| 33787 | Make Equal Again | brute force greedy math | Statement | C | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 39864 | Recovering a Small String | brute force strings | Statement | A | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 18856 | LR-remainders | brute force data structures implementation math | Statement | C | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 1177 | Turtle Magic: Royal Turtle Shell Pattern | bitmasks brute force combinatorics math | Statement | G | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 25325 | Turtle Fingers: Count the Values of k | brute force number theory | Statement | C | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 340 | Weird LCM Operations | brute force constructive algorithms | Statement | E | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 3250.0 | Tutorial | |
| 21966 | Yet Another Coin Problem | brute force dp greedy math | Statement | B | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1000.0 | Tutorial | |
| 9747 | Messenger in MAC | binary search brute force constructive algorithms data structures dp sortings | Statement | C | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 1500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 47595 | Rudolf and the Ticket | brute force math sortings two pointers | Statement | A | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 529 | MEX Game 2 (Easy Version) | binary search brute force greedy | Statement | E1 | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 2000.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 21422 | MEX Game 1 | brute force games greedy | Statement | A | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 500.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 | ||
| 17359 | Left and Right Houses | brute force | Statement | C | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 5591 | Birthday Gift | bitmasks brute force constructive algorithms greedy implementation | Statement | D | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 1750.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 1234 | Nobody is needed | brute force data structures dp math number theory | Statement | F | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 2750.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 872 | MST with Matching | bitmasks brute force trees | Statement | G | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 30908 | Special Characters | brute force constructive algorithms | Statement | A | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 26234 | Array Fix | brute force dp greedy implementation | Statement | B | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 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 | ||
| 4871 | Charming Meals | binary search brute force greedy sortings | Statement | B | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) 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 | ||
| 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 | |
| 3260 | They Have Fooled | brute force | Statement | C | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 899 | Help, what does it mean to be "Based" | brute force combinatorics constructive algorithms games implementation sortings | Statement | J | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 1952 | Grid | brute force divide and conquer matrices | Statement | F | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 1514 | The Most Reckless Defense | bitmasks brute force constructive algorithms dp flows graph matchings | Statement | H | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 5864 | GCD on a grid | brute force dfs and similar dp math number theory | Statement | G | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 10523 | Long Inversions | brute force greedy implementation sortings | Statement | E | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 4753 | Nene and the Mex Operator | bitmasks brute force constructive algorithms divide and conquer dp greedy implementation | Statement | D | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 1750.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 24144 | Nene's Game | brute force greedy | Statement | A | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 500.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 1667 | Nene vs. Monsters (Easy Version) | brute force implementation math | Statement | E1 | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 1500.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 1116 | Nene vs. Monsters (Hard Version) | brute force implementation math | Statement | E2 | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 750.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 5775 | A BIT of an Inequality | bitmasks brute force dp math | Statement | D | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1750.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 1900 |
| 1616 | Carousel of Combinations | brute force combinatorics dp math number theory | Statement | E | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 2250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2400 |
| 16003 | Reverse Card (Easy Version) | brute force math number theory | Statement | B1 | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 500.0 | Tutorial | 1400 |
| 4837 | Reverse Card (Hard Version) | brute force math number theory | Statement | B2 | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 750.0 | Tutorial | 2200 |
| 2227 | Fenwick Tree | bitmasks brute force combinatorics data structures dp math trees | Statement | C | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1250.0 | Tutorial | 2300 |
| 97 | Next and Prev | brute force data structures implementation | Statement | F | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 3500.0 | Tutorial | 3200 |
| 17364 | Permutation Game | brute force dfs and similar games graphs greedy math | Statement | D | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1300 | |
| 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 | |
| 39344 | Maximize? | brute force math number theory | Statement | A | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 800 | |
| 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 | |
| 867 | Min-Fund Prison (Medium) | brute force dfs and similar dp graphs trees | Statement | G2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2200 | |
| 598 | Balanced Unshuffle (Medium) | brute force constructive algorithms trees | Statement | A2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2400 | |
| 12422 | Circle Perimeter | binary search brute force dfs and similar geometry implementation math | Statement | F | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1600 | |
| 25870 | Contest Proposal | brute force greedy two pointers | Statement | A | Codeforces Round 942 (Div. 2) {1972} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 2245 | Cat, Fox and Maximum Array Split | brute force interactive math | Statement | D | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 2000.0 | Editorial for Codeforces Round #945 (Div. 2) | 2400 |
| 319 | Maximum GCD Sum Queries | bitmasks brute force dp implementation number theory | Statement | F | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #945 (Div. 2) | 3100 |
| 28470 | Chess For Three | brute force dp implementation math | Statement | A | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 500.0 | Editorial for Codeforces Round #945 (Div. 2) | 900 |
| 4388 | Cutting Game | binary search brute force data structures implementation sortings two pointers | Statement | F | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 1900 | |
| 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 |
| 17125 | Chamo and Mocha's Array | binary search brute force greedy | Statement | C | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 1000.0 | editorial_zh.pdf | 1200 |
| 7474 | Paint the Tree | brute force dfs and similar dp greedy shortest paths trees | Statement | D | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 1500.0 | editorial_zh.pdf | 1700 |
| 1035 | Set | bitmasks brute force combinatorics dfs and similar divide and conquer dp math | Statement | F | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 2500.0 | editorial_zh.pdf | 2600 |
| 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 |
| 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 |
| 2333 | XORificator | bitmasks brute force greedy hashing | Statement | D | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 2000.0 | 129858 | 2300 |
| 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 | |
| 436 | Kostyanych's Theorem | brute force graphs interactive | Statement | F | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 3000.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 31726 | Guess the Maximum | brute force greedy implementation | Statement | A | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 500.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 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 | |
| 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 | |
| 19727 | Collatz Conjecture | brute force implementation math number theory | Statement | B | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 1000.0 | 130839 | |
| 14682 | Have Your Cake and Eat It Too | binary search brute force dp greedy implementation | Statement | C | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1250.0 | ||
| 283 | Your Loss | bitmasks brute force trees | Statement | G | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 3000.0 | ||
| 1138 | Reconstruction | brute force dp | Statement | F | Codeforces Global Round 26 {1984} | PROGRAMMING | 3000.0 | Codeforces Global Round 26 Editorial | |
| 19928 | Final Boss | binary search brute force data structures | Statement | F | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 23470 | Secret Box | brute force combinatorics math | Statement | E | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 7206 | Maximize the Largest Component (Easy Version) | brute force data structures dfs and similar dsu graphs implementation | Statement | H1 | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 56418 | Maximum Multiple Sum | brute force math | Statement | B | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 1905 | Permutation Problem (Simple Version) | brute force combinatorics math number theory | Statement | G1 | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 1436 | Permutation Problem (Hard Version) | brute force data structures hashing math number theory | Statement | G2 | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 17932 | Mathematical Problem | brute force dp two pointers | Statement | D | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 30087 | Matrix Stabilization | brute force greedy sortings | Statement | B | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 47859 | X Axis | brute force math sortings | Statement | A | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 4059 | Wonderful Tree! | brute force dfs and similar dp flows greedy trees | Statement | E | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 1750.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 1783 | Range Minimum Sum | binary search brute force data structures implementation | Statement | E | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 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) | |
| 5986 | The Omnipotent Monster Killer | brute force dp trees | Statement | D | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 2000.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 | ||
| 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 | ||
| 26792 | Submission Bait | brute force games greedy sortings | Statement | A | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 500.0 | Video Tutorial | |
| 14519 | Mad MAD Sum | brute force greedy math | Statement | C | Codeforces Round 960 (Div. 2) {1990} | 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 | |
| 49058 | Only Pluses | brute force constructive algorithms greedy math sortings | Statement | A | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's 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 | ||
| 1182 | Dyn-scripted Robot (Easy Version) | brute force chinese remainder theorem constructive algorithms math number theory | Statement | F1 | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 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 | |
| 20914 | Bouquet (Easy Version) | binary search brute force greedy sortings sortings two pointers | Statement | B1 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 1000.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 | |
| 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 |