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 3Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 27659 | Subsequence Addition (Hard Version) | dp greedy implementation math sortings | Statement | G2 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 1066 | Two Tanks | binary search dp implementation math | Statement | E | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 8623 | Umka and a Long Flight | constructive algorithms implementation math | Statement | D | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 15935 | Ian and Array Sorting | greedy implementation math | Statement | A | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #865 | 1300 |
| 3593 | Sum Graph | constructive algorithms graphs implementation interactive math shortest paths trees | Statement | B | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #865 | 2000 |
| 1733 | The Fox and the Complete Tree Traversal | constructive algorithms dp games implementation math trees | Statement | C | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 1500.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 | ||
| 15015 | Hits Different | data structures dp implementation math | Statement | G | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1600 | |
| 3372 | Red-Blue Operations (Easy Version) | binary search greedy implementation math | Statement | D1 | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2100 | |
| 2332 | Red-Blue Operations (Hard Version) | binary search constructive algorithms greedy implementation math | Statement | D2 | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2400 | |
| 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 | |
| 8716 | k-th equality | brute force implementation math | Statement | A | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 500.0 | Codeforces Round 880 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 | ||
| 17822 | Particles | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1250.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 8991 | Rating System | brute force data structures dp greedy implementation math | Statement | D | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 1590 | Boxes and Balls | dp implementation math | Statement | E | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 23596 | Come Together | geometry implementation math | Statement | B | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 46877 | Forbidden Integer | implementation math | Statement | A | 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 | |||
| 34727 | Rudolph and Cut the Rope | implementation math | Statement | A | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 24201 | Vika and the Bridge | binary search data structures greedy implementation math sortings | Statement | B | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 1000.0 | Codeforces Round #885 (Div.2) Editorial | |
| 32078 | Morning Sandwich | implementation math | Statement | A | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 34755 | Cardboard for Pictures | binary search geometry implementation math | Statement | E | 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 | ||
| 15373 | The Morning Star | combinatorics data structures geometry implementation math sortings | Statement | G | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 73804 | To My Critics | implementation sortings | Statement | A | 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 | ||
| 17281 | Prefix Permutation Sums | implementation math | Statement | D | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 9207 | Ntarsis' Set | binary search implementation math two pointers | Statement | A | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 500.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 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 | |
| 24684 | Maximum Rounding | greedy implementation math | Statement | B | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 12999 | The Walkway | brute force greedy implementation math number theory | Statement | B | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1250.0 | Codeforces Round #893 (Div. 2) Editorial | 1500 |
| 21401 | Increasing and Decreasing | constructive algorithms implementation math | Statement | A | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 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 | |
| 13084 | Colorful Table | binary search data structures dp implementation math sortings two pointers | Statement | C | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 1500.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 7516 | Selling a Menagerie | dfs and similar dsu graphs implementation math | Statement | F | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 69292 | Target Practice | implementation math | Statement | C | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 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 | |
| 4546 | Suspicious logarithms | binary search brute force implementation math number theory | Statement | D | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 1500.0 | ||
| 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 | ||
| 8561 | Yet Another Monster Fight | binary search greedy implementation math | Statement | D | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 1463 | Trees and XOR Queries Again | bitmasks data structures dfs and similar implementation math trees | Statement | F | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 4598 | Cyclic MEX | binary search constructive algorithms data structures implementation math two pointers | Statement | D | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 2000.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 18910 | Distinct Buttons | implementation math | Statement | A | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 1271 | Evaluate It and Back Again | constructive algorithms implementation math | Statement | E | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 2200 | |
| 9745 | Mathematical Problem | brute force constructive algorithms implementation math strings | Statement | D | Good Bye 2023 {1916} | PROGRAMMING | 1500.0 | ||
| 19841 | Training Before the Olympiad | constructive algorithms games implementation math | Statement | C | Good Bye 2023 {1916} | PROGRAMMING | 1250.0 | ||
| 28259 | 2023 | constructive algorithms implementation math number theory | Statement | A | Good Bye 2023 {1916} | PROGRAMMING | 250.0 | ||
| 12341 | Watering an Array | brute force greedy implementation math | Statement | C | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 16586 | XOR-distance | bitmasks dp greedy implementation math | Statement | C | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 1250.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 32303 | Brick Wall | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 500.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 6472 | Array Repetition | binary search data structures dp implementation math | Statement | D | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2000.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) | ||
| 23318 | Forming Triangles | combinatorics implementation math | Statement | B | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 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 | |
| 14797 | Vlad and an Odd Ordering | binary search bitmasks data structures dp implementation math number theory | Statement | E | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 345 | Digital Patterns | combinatorics data structures implementation math | Statement | F | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 2750.0 | Codeforces Round 924 Editorial | |
| 2088 | Modular Sequence | constructive algorithms dp greedy implementation math number theory | Statement | E | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 2250.0 | Codeforces Round 924 Editorial | |
| 18856 | LR-remainders | brute force data structures implementation math | Statement | C | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 10151 | Final Countdown | implementation math number theory | Statement | E | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 36194 | Turtle Math: Fast Three Task | implementation number theory | Statement | B | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 1645 | Distance Learning Courses in MAC | binary search bitmasks data structures greedy implementation math | Statement | E | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 2500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 3550 | Pinball | binary search implementation math | Statement | B | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 1000.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 24610 | Shuffle Party | implementation math | Statement | A | Codeforces Round 930 (Div. 2) {1937} | PROGRAMMING | 500.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 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 | |
| 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 | |
| 2955 | Chain Reaction | data structures dsu greedy implementation math number theory | Statement | E | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 21464 | Make It Ugly | implementation math | Statement | B | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 24454 | Inhabitant of the Deep Sea | greedy implementation math | Statement | C | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 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) | |
| 14908 | Permutation Counting | binary search greedy implementation math sortings | Statement | A | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 750.0 | Tutorial | 1400 |
| 22006 | Two Friends | constructive algorithms implementation math | Statement | A | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 800 | |
| 7183 | Balanced Shuffle (Easy) | implementation sortings | Statement | A1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1000 | |
| 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 | |
| 9828 | Cat, Fox and Double Maximum | constructive algorithms greedy implementation math sortings | Statement | C | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #945 (Div. 2) | 1700 |
| 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 |
| 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 |
| 17750 | Manhattan Permutations | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1250.0 | 130527 | |
| 13595 | Elections | data structures greedy implementation math | Statement | D | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1500.0 | 130527 | |
| 17321 | GCD-sequence | greedy implementation math math number theory number theory | Statement | D | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 6329 | Turtle and an Incomplete Sequence | bitmasks constructive algorithms greedy implementation math | Statement | C | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 1500.0 | Simplified Chinese Tutorial | |
| 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 | |
| 27468 | Soccer | greedy implementation math sortings | Statement | A | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 500.0 | 130839 | |
| 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 | |
| 41302 | Manhattan Circle | implementation math | Statement | D | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 16141 | Light Switches | implementation math | Statement | C | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 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 | |
| 26098 | Find K Distinct Points with Fixed Center | constructive algorithms implementation math | Statement | A | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 500.0 | Video Tutorial | |
| 23529 | Triple Operations | dp implementation math | Statement | E | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 83203 | A+B Again? | implementation math | Statement | A | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 6906 | Color Rows and Columns | dp greedy implementation math | Statement | F | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 43987 | Primary Task | implementation math strings | Statement | A | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 21297 | Distanced Coloring | constructive algorithms implementation math | Statement | A | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 500.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 33628 | Closest Point | implementation math | Statement | A | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 32846 | The Legend of Freya the Frog | implementation math | Statement | C | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | Codeforces Round 971 (Div. 4) Editorial | ||
| 24667 | Three Brothers | brute force implementation math | Statement | B | Testing Round 19 (Div. 3) {2010} | PROGRAMMING | 800 | ||
| 21214 | Alternating Sum of Numbers | implementation math | Statement | A | Testing Round 19 (Div. 3) {2010} | PROGRAMMING | 800 | ||
| 650 | Game in Tree (Easy Version) | binary search data structures games implementation trees | Statement | F1 | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 7440 | Minimize the Difference | binary search data structures greedy implementation math | Statement | D | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 5161 | Speedbreaker | binary search dp greedy implementation math two pointers | Statement | B | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 12567 | Cards Partition | brute force greedy implementation math | Statement | A | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 325 | Speedbreaker Counting (Easy Version) | combinatorics dp games greedy implementation math | Statement | F1 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 17221 | All Pairs Segments | data structures implementation math | Statement | B | Codeforces Round 975 (Div. 2) {2019} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 18233 | Bitwise Balancing | bitmasks implementation math | Statement | C | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 1250.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 1918 | Digital Village (Easy Version) | brute force data structures dp dsu graphs greedy implementation math shortest paths trees | Statement | E1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 17198 | Bus to Pénjamo | greedy implementation math | Statement | A | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 750.0 | Codeforces Round 978 (Div 2) Editorial | |
| 7835 | Attribute Checks | brute force data structures dp implementation math | Statement | D | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 5814 | Sums of Segments | binary search data structures dp implementation math | Statement | D | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 22010 | Rectangle Arrangement | geometry implementation math | Statement | A | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 500.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 13231 | Alice's Adventures in Permuting | binary search implementation math | Statement | B | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1000.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 | |
| 1389 | Balanced | constructive algorithms data structures implementation math | Statement | E | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 2250.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 20539 | Medians | constructive algorithms greedy hashing implementation math | Statement | B | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 24642 | Circuit | greedy implementation math number theory | Statement | A | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 500.0 | Codeforces Round 983 (Div. 2) 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 | |
| 5809 | Yet Another Real Number Problem | binary search brute force data structures dp greedy implementation math two pointers | Statement | D | Codeforces Global Round 27 {2035} | PROGRAMMING | 1500.0 | Codeforces Global Round 27 Editorial | |
| 17964 | Insane Problem | binary search greedy implementation math | Statement | E | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 2571 | Hard Demon Problem | data structures dp implementation math | Statement | H | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 17801 | Alyona and a Square Jigsaw Puzzle | implementation math | Statement | A | Codeforces Round 990 (Div. 2) {2047} | PROGRAMMING | 500.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 22814 | Kevin and Combination Lock | brute force implementation math number theory | Statement | A | Codeforces Global Round 28 {2048} | PROGRAMMING | 250.0 | Tutorial | |
| 7662 | Refined Product Optimality | binary search data structures greedy implementation math schedules sortings | Statement | D | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1750.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 21240 | Tender Carpenter | dp geometry implementation math | Statement | A | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 500.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 17777 | Find the Permutation | dfs and similar graphs implementation sortings | Statement | B | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 1250.0 | Codeforces Round #997 (Div. 2) 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 | |
| 14621 | Kevin and Geometry | brute force constructive algorithms data structures geometry greedy implementation math two pointers | Statement | B | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 1000.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 | |
| 1520 | Counting Is Not Fun (Easy Version) | combinatorics data structures dfs and similar dsu implementation math | Statement | F1 | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1750.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 19599 | Robot Program | brute force implementation math | Statement | B | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | Video Tutorial | ||
| 1073 | Infinite Sequence (Hard Version) | bitmasks constructive algorithms data structures dp implementation math | Statement | D2 | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1250.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 40564 | New World, New Me, New Array | greedy greedy implementation math | Statement | A | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 2462 | Counting Necessary Nodes | bitmasks divide and conquer implementation math | Statement | F | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | Codeforces Round 1009 (Div. 3) — Editorial | ||
| 3642 | Finding OR Sum | bitmasks constructive algorithms implementation interactive math | Statement | B | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 1000.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 338 | Maximum Polygon | brute force data structures implementation math | Statement | D | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2250.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 2301 | Binary Subsequence Value Sum | combinatorics dp fft implementation math | Statement | C | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 1500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 18221 | Vicious Labyrinth | constructive algorithms graphs greedy implementation math | Statement | B | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 750.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 28254 | Kamilka and the Sheep | greedy implementation math sortings | Statement | A | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 500.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 24690 | Lady Bug | implementation math | Statement | B | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 750.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 711 | Numbers and Strings | brute force dfs and similar dp implementation math | Statement | F | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 12003 | Maximum Subarray Sum | binary search constructive algorithms implementation math | Statement | C | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 1500.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 14479 | SUMdamental Decomposition | bitmasks constructive algorithms greedy implementation math | Statement | B | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 1250.0 | Codeforces Round 1022 Editorial | |
| 17794 | Fibonacci Cubes | brute force dp implementation math | Statement | B | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 20653 | Energy Crystals | greedy implementation math | Statement | A | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 14575 | Come a Little Closer | brute force greedy implementation math | Statement | D | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 2481 | Red Light, Green Light (Hard version) | binary search dfs and similar dp dsu graphs implementation number theory | Statement | D2 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 50772 | Only One Digit | implementation math | Statement | A | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 104 | Inter Active (Hard Version) | binary search bitmasks constructive algorithms graphs implementation interactive math probabilities | Statement | G2 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2750.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 8772 | From 1 to Infinity | binary search dp implementation math | Statement | D | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 30849 | Redstone? | brute force implementation math | Statement | A | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 500.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 26457 | Painting With Two Colors | constructive algorithms implementation math | Statement | A | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 500.0 | 145832 | |
| 22777 | Maximum Even Sum | brute force greedy implementation math | Statement | C | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 10096 | Mexification | implementation math | Statement | E | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 633 | Antiamuny and Slider Movement | binary search brute force combinatorics implementation math | Statement | D | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 2500.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 749 | Attraction Theory | combinatorics dp implementation math | Statement | D | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 704 | Query Jungle | data structures data structures implementation math math trees | Statement | G | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 4000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 13422 | No Cost Too Great (Easy Version) | greedy implementation math number theory | Statement | C1 | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 1250.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 25048 | El fucho | implementation math | Statement | A | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 500.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 12756 | Expansion Plan 2 | implementation math | Statement | B | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 1000.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 3246 | Palindrome Flipping | brute force constructive algorithms implementation strings | Statement | D | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 2000.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 15653 | Round Trip | games greedy implementation math | Statement | A | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 500.0 | ||
| 4917 | Copy String | binary search greedy implementation strings | Statement | D | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 1750.0 | Codeforces Global Round 30 Editorial | |
| 8987 | khba Loves to Sleep! | binary search data structures geometry implementation math | Statement | E | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 8453 | Removal of a Sequence (Easy Version) | binary search bitmasks geometry implementation math number theory | Statement | D1 | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 2251 | Removal of a Sequence (Hard Version) | binary search constructive algorithms divide and conquer greedy implementation math number theory probabilities | Statement | D2 | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 21455 | Impost or Sus | greedy implementation strings | Statement | B | Good Bye 2025 {2178} | PROGRAMMING | 750.0 | ||
| 3233 | Mixing MEXes | data structures implementation math | Statement | G | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 20407 | OutOfMemoryError | data structures implementation math two pointers | Statement | D | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 18088 | Offshores | greedy implementation math | Statement | B | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1000.0 | Codeforces Round #1078 Editorial | |
| 15664 | Simons and Cakes for Success | implementation math | Statement | B | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 750.0 | Tutorial | |
| 15347 | Antimedian Deletion | implementation math | Statement | A | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 500.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 766 | RReeppeettiittiioonn | binary search brute force implementation math number theory | Statement | B | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 1250.0 | ||
| 3003 | Flip the Bit (Hard Version) | greedy implementation math | Statement | D | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 1500.0 | ||
| 31369 | The 67th Integer Problem | brute force games implementation math | Statement | A | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | |||
| 3110 | The 67th Iteration of "Counting is Fun" | dfs and similar implementation math | Statement | G | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING |