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 ... 9 10 11 12 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 33688 | Vlad and a Sum of Sum of Digits | dp implementation | Statement | C | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 64098 | Vlad and the Best of Five | implementation | Statement | A | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 36905 | Vlad and Shapes | implementation | Statement | B | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 497 | Digital Patterns | combinatorics data structures implementation math | Statement | F | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 2750.0 | Codeforces Round 924 Editorial | |
| 2269 | 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 | |
| 12843 | Chat Screenshots | combinatorics dfs and similar graphs implementation | Statement | F | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 19400 | LR-remainders | brute force data structures implementation math | Statement | C | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 34580 | Thorns and Coins | dp greedy implementation | Statement | A | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 13742 | Card Game | greedy implementation | Statement | D | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 10525 | Final Countdown | implementation math number theory | Statement | E | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 37220 | Turtle Math: Fast Three Task | implementation number theory | Statement | B | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 1693 | 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 | |
| 693 | Andrey's Tree | binary search constructive algorithms dsu greedy implementation trees | Statement | F | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 3000.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 3644 | Pinball | binary search implementation math | Statement | B | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 1000.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 17633 | Binary Path | greedy implementation | Statement | B | Codeforces Round 930 (Div. 2) {1937} | PROGRAMMING | 1000.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 24939 | Shuffle Party | implementation math | Statement | A | Codeforces Round 930 (Div. 2) {1937} | PROGRAMMING | 500.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 275 | Three Arrays | *special constructive algorithms implementation sortings | Statement | B | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 21388 | Rudolf and the Ball Game | dp implementation | Statement | D | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 4694 | 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 | |
| 955 | Cook and Porridge | binary search constructive algorithms data structures implementation | Statement | G | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 14237 | Tree Cutting | binary search dp greedy implementation trees | Statement | C | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 1500.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 5720 | 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 | |
| 28958 | Median of an Array | greedy implementation | Statement | A | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 500.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 26659 | Array Fix | brute force dp greedy implementation | Statement | B | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 565 | Amanda the Amoeba | graphs implementation trees two pointers | Statement | J | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 6438 | Shuffling Songs | bitmasks dp graphs implementation strings | Statement | G | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 17836 | 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 | ||
| 26857 | Product of Binary Decimals | dp implementation number theory | Statement | D | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 71748 | Stair, Peak, or Neither? | implementation | Statement | A | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 44984 | Upscaling | implementation | Statement | B | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 47715 | Clock Conversion | implementation math | Statement | C | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 4627 | 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 | |
| 913 | 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 | ||
| 3124 | 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 | ||
| 22057 | Make It Ugly | implementation math | Statement | B | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 10848 | Long Inversions | brute force greedy implementation sortings | Statement | E | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 32905 | Progressive Square | constructive algorithms data structures implementation sortings | Statement | B | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 25149 | Inhabitant of the Deep Sea | greedy implementation math | Statement | C | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 4890 | 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) | |
| 1698 | 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) | |
| 1146 | 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) | |
| 20814 | A BIT of a Construction | bitmasks constructive algorithms greedy implementation | Statement | B | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1000.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 1100 |
| 17529 | 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 |
| 15318 | Permutation Counting | binary search greedy implementation math sortings | Statement | A | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 750.0 | Tutorial | 1400 |
| 1007 | Long Way to be Non-decreasing | binary search dfs and similar graphs implementation shortest paths two pointers | Statement | D | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1750.0 | Tutorial | 2800 |
| 105 | Next and Prev | brute force data structures implementation | Statement | F | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 3500.0 | Tutorial | 3200 |
| 12015 | Minimizing the Sum | dp implementation | Statement | C | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 1700 | |
| 415 | Card Pairing | dp greedy hashing implementation | Statement | F | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 3000 | |
| 22369 | Two Friends | constructive algorithms implementation math | Statement | A | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 800 | |
| 7556 | Balanced Shuffle (Easy) | implementation sortings | Statement | A1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1000 | |
| 662 | Playing Quidditch (Easy) | implementation | Statement | F1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2300 | |
| 540 | Playing Quidditch (Medium) | implementation | Statement | F2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2300 | |
| 560 | Playing Quidditch (Hard) | implementation | Statement | F3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2300 | |
| 31184 | Binary Cut | dp greedy implementation sortings strings | Statement | D | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1100 | |
| 12862 | 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 | |
| 61295 | My First Sorting Problem | implementation sortings | Statement | A | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 800 | |
| 45759 | Different String | implementation strings | Statement | B | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 800 | |
| 42658 | Clock and Strings | implementation | Statement | C | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 900 | |
| 10031 | 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 |
| 358 | 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 |
| 29052 | 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 |
| 18129 | Ingenuity-2 | constructive algorithms greedy implementation | Statement | D | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 1400 | |
| 4494 | 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 | |
| 34927 | Symmetric Encoding | implementation sortings strings | Statement | B | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 800 | |
| 2994 | 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 |
| 20962 | 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 |
| 5963 | 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 | ||
| 12718 | Job Interview | binary search dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 25414 | Increase/Decrease/Copy | greedy implementation | Statement | B | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 32980 | Verify Password | implementation sortings | Statement | A | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 18135 | Manhattan Permutations | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1250.0 | 130527 | |
| 4717 | Computing Machine | data structures dp greedy implementation | Statement | E | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 2000.0 | 130527 | |
| 13957 | Elections | data structures greedy implementation math | Statement | D | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1500.0 | 130527 | |
| 32111 | Guess the Maximum | brute force greedy implementation | Statement | A | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 500.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 17805 | GCD-sequence | greedy implementation math math number theory number theory | Statement | D | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 6470 | 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 | |
| 10306 | 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 | |
| 20118 | Collatz Conjecture | brute force implementation math number theory | Statement | B | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 1000.0 | 130839 | |
| 27703 | Soccer | greedy implementation math sortings | Statement | A | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 500.0 | 130839 | |
| 15003 | 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 | ||
| 18678 | Corner Twist | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1000.0 | ||
| 21294 | Large Addition | constructive algorithms implementation math | Statement | B | Codeforces Global Round 26 {1984} | PROGRAMMING | 750.0 | Codeforces Global Round 26 Editorial | |
| 307 | Magic Trick II | constructive algorithms implementation sortings | Statement | G | Codeforces Global Round 26 {1984} | PROGRAMMING | 4000.0 | Codeforces Global Round 26 Editorial | |
| 3991 | ''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 | |
| 7491 | 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 | ||
| 1995 | Maximize the Largest Component (Hard Version) | data structures dfs and similar dsu implementation | Statement | H2 | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 41298 | Good Prefixes | greedy implementation | Statement | C | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 42230 | Manhattan Circle | implementation math | Statement | D | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 74910 | Creating Words | implementation strings | Statement | A | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 1861 | 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) | |
| 29763 | Catch the Coin | implementation | Statement | A | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 24612 | Maximize the Last Element | greedy implementation | Statement | A | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 250.0 | Video Tutorial | |
| 24664 | Test of Love | dp greedy implementation | Statement | D | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 33492 | Question Marks | greedy implementation | Statement | A | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 16526 | Light Switches | implementation math | Statement | C | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 10506 | 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 | |
| 26609 | Diagonals | brute force greedy implementation math | Statement | A | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 500.0 | Video Tutorial | |
| 12955 | Decode | brute force combinatorics implementation | Statement | E | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 37327 | Scale | implementation | Statement | B | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 3903 | Level Up | binary search brute force data structures implementation | Statement | E | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 33791 | Strong Password | implementation | Statement | A | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 939 | Eliminating Balls With Merging (Hard Version) | binary search brute force data structures divide and conquer implementation | Statement | E2 | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 26319 | Find K Distinct Points with Fixed Center | constructive algorithms implementation math | Statement | A | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 500.0 | Video Tutorial | |
| 42861 | Card Game | brute force implementation | Statement | B | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 24411 | Triple Operations | dp implementation math | Statement | E | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 33368 | Slavic's Exam | greedy implementation strings | Statement | D | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 42365 | Showering | implementation | Statement | C | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 87898 | A+B Again? | implementation math | Statement | A | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 2380 | Ksyusha and the Loaded Set | binary search data structures dp implementation trees | Statement | H | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 7279 | Color Rows and Columns | dp greedy implementation math | Statement | F | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 29978 | Right Left Wrong | greedy implementation two pointers | Statement | D | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 45021 | Primary Task | implementation math strings | Statement | A | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 26323 | Generate Permutation | constructive algorithms greedy implementation | Statement | B | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 33219 | Make All Equal | greedy implementation | Statement | A | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 500.0 | Video Tutorial | |
| 5200 | DFS Checker (Easy Version) | constructive algorithms data structures dfs and similar hashing implementation | Statement | D1 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 2947 | DFS Checker (Hard Version) | constructive algorithms data structures dfs and similar hashing implementation trees | Statement | D2 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 21487 | 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 | |
| 3021 | Cosmic Rays | data structures dfs and similar greedy implementation trees | Statement | E | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 4742 | Turtle and a MEX Problem (Hard Version) | dfs and similar dp graphs greedy implementation | Statement | D2 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1250.0 | sol-zh.pdf | |
| 32338 | Game with Doors | brute force implementation | Statement | B | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 34039 | Closest Point | implementation math | Statement | A | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 3391 | Subtangle Game (Easy Version) | dp games greedy implementation | Statement | E1 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 1500.0 | Discussion stream (With Hints) | |
| 1098 | Subtangle Game (Hard Version) | dp games greedy implementation | Statement | E2 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 2000.0 | Discussion stream (With Hints) | |
| 8889 | Lazy Narek | dp implementation | Statement | C | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 1500.0 | Discussion stream (With Hints) | |
| 54628 | osu!mania | brute force implementation | Statement | B | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | Codeforces Round 971 (Div. 4) Editorial | ||
| 33978 | The Legend of Freya the Frog | implementation math | Statement | C | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | Codeforces Round 971 (Div. 4) Editorial | ||
| 25097 | Three Brothers | brute force implementation math | Statement | B | Testing Round 19 (Div. 3) {2010} | PROGRAMMING | 800 | ||
| 21612 | Alternating Sum of Numbers | implementation math | Statement | A | Testing Round 19 (Div. 3) {2010} | PROGRAMMING | 800 | ||
| 686 | Game in Tree (Easy Version) | binary search data structures games implementation trees | Statement | F1 | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 7690 | Minimize the Difference | binary search data structures greedy implementation math | Statement | D | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 1849 | Milky Days | data structures implementation | Statement | G | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 46706 | Robin Helps | implementation | Statement | A | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 5352 | 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) | |
| 12918 | 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) | |
| 346 | 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) | |
| 2265 | Max Plus Min Plus Size | data structures dp dsu greedy implementation matrices | Statement | D | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 17658 | 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) | |
| 18871 | 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 | |
| 1977 | 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 | |
| 4620 | Adjust The Presentation (Hard Version) | constructive algorithms data structures greedy implementation | Statement | C2 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1000.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 4170 | Asesino (Easy Version) | binary search constructive algorithms implementation interactive | Statement | D1 | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1750.0 | Codeforces Round 978 (Div 2) Editorial | |
| 6843 | Gerrymandering | dp implementation | Statement | C | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1750.0 | Codeforces Round 978 (Div 2) Editorial | |
| 17490 | Bus to Pénjamo | greedy implementation math | Statement | A | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 750.0 | Codeforces Round 978 (Div 2) Editorial | |
| 19589 | New Game | binary search brute force greedy implementation two pointers | Statement | C | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 8123 | 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 | ||
| 6188 | 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 | ||
| 424 | Bermart Ice Cream | data structures dfs and similar divide and conquer dp implementation trees | Statement | F | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 1955 | The Endspeaker (Hard Version) | binary search combinatorics data structures dp greedy implementation two pointers | Statement | D2 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1000.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 7203 | The Endspeaker (Easy Version) | binary search dp graphs greedy implementation two pointers | Statement | D1 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1250.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 22352 | Rectangle Arrangement | geometry implementation math | Statement | A | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 500.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 13690 | 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 | |
| 563 | 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 | |
| 20826 | 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 | |
| 3858 | Alice's Adventures in Cards | constructive algorithms data structures dfs and similar dp graphs greedy implementation shortest paths | Statement | D | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1750.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 8942 | QED's Favorite Permutation | bitmasks data structures implementation sortings | Statement | D | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 1500.0 | Codeforces Round 979 Editorial | |
| 1433 | Balanced | constructive algorithms data structures implementation math | Statement | E | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 2250.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 21171 | Medians | constructive algorithms greedy hashing implementation math | Statement | B | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 25016 | Circuit | greedy implementation math number theory | Statement | A | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 500.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 2067 | 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 | |
| 9430 | Trapped in the Witch's Labyrinth | constructive algorithms dfs and similar graphs implementation | Statement | C | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 1500.0 | Rayan 2024 Selection Round Editorial | |
| 6839 | Darius' Wisdom | constructive algorithms greedy implementation sortings | Statement | D | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 1500.0 | Rayan 2024 Selection Round Editorial | |
| 16250 | Rakhsh's Revival | data structures greedy implementation two pointers | Statement | B | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 750.0 | Rayan 2024 Selection Round Editorial | |
| 85 | Simurgh's Watch (Easy Version) | greedy implementation | Statement | G1 | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 3000.0 | Rayan 2024 Selection Round Editorial | |
| 88 | Simurgh's Watch (Hard Version) | greedy implementation | Statement | G2 | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 3000.0 | Rayan 2024 Selection Round Editorial | |
| 5959 | 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 | |
| 22630 | Anya and 1100 | brute force data structures implementation | Statement | C | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 16384 | I Love 1543 | brute force implementation matrices | Statement | D | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 41376 | Quintomania | implementation | Statement | A | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 25872 | Intercepted Inputs | brute force implementation | Statement | B | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 36495 | Twice | implementation | Statement | A | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 910 | Divide OR Conquer | bitmasks data structures dp implementation | Statement | D | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2400 | ||
| 342 | Royal Flush | dp implementation | Statement | M | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2800 | ||
| 8923 | Waiting for... | greedy implementation | Statement | J | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 800 | ||
| 11515 | Fixing the Expression | implementation | Statement | N | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 800 | ||
| 17751 | 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) | |
| 107 | Cool Swap Walk (Easy Version) | constructive algorithms implementation implementation sortings sortings | Statement | H1 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2250.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 102 | Cool Swap Walk (Hard Version) | constructive algorithms constructive algorithms constructive algorithms implementation sortings | Statement | H2 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2500.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | 3500 |
| 696 | 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) | ||
| 1375 | Selection Sort | greedy | Statement | M | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | Problem Analysis and Hints (PDF) | ||
| 11667 | The Bento Box Adventure | implementation | Statement | A | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | Problem Analysis and Hints (PDF) | ||
| 5555 | Recommendations | binary search data structures implementation sortings | Statement | D | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 948 | Two Subarrays | data structures dp implementation matrices | Statement | F | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 1879 | Matrix Transformation | bitmasks brute force dfs and similar graphs implementation | Statement | E | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 18678 | Insane Problem | binary search greedy implementation math | Statement | E | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 2710 | Hard Demon Problem | data structures dp implementation math | Statement | H | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 4069 | Medium Demon Problem (hard version) | dfs and similar dp dsu graphs implementation trees | Statement | G2 | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 2335 | Mirror Maze | brute force dfs and similar graphs implementation | Statement | M | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 1800 | |
| 568 | For the Emperor! | flows graphs | Statement | D | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2500.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 18076 | 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) | |
| 23080 | Kevin and Combination Lock | brute force implementation math number theory | Statement | A | Codeforces Global Round 28 {2048} | PROGRAMMING | 250.0 | Tutorial | |
| 608 | MEX OR Mania | bitmasks data structures implementation | Statement | F | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 2750.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 19342 | pspspsps | brute force constructive algorithms implementation | Statement | B | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 750.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 14033 | MEX Cycle | constructive algorithms greedy implementation | Statement | C | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 1000.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 6202 | Shift + Esc | dp implementation | Statement | D | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 1750.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 24380 | MEX Destruction | greedy implementation | Statement | A | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 500.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 15168 | Three Strings | dp implementation strings | Statement | E | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 37007 | Line Breaks | implementation | Statement | A | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 28666 | Preparing for the Exam | constructive algorithms implementation | Statement | C | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 7857 | 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 | |
| 86 | Delicate Anti-monotonous Operations | constructive algorithms implementation | Statement | H | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 4500.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 974 | Earnest Matrix Complement | data structures dp greedy implementation | Statement | F | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2500.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 4608 | Resourceful Caterpillar Sequence | dfs and similar dp games graphs implementation trees | Statement | E | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 21425 | 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 | |
| 18276 | 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 | |
| 2319 | 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 | |
| 15040 | 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 | |
| 11142 | 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 | |
| 1585 | 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 | |
| 57278 | Skibidus and Amog'u | brute force constructive algorithms implementation strings | Statement | A | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 5622 | White Magic | constructive algorithms greedy implementation | Statement | B | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 750.0 | 139415 | |
| 469 | Tropical Season | data structures greedy implementation | Statement | E | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 2000.0 | 139415 | |
| 7420 | Object Identification | graphs implementation interactive | Statement | A | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 750.0 | 139415 | |
| 20109 | Robot Program | brute force implementation math | Statement | B | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | Video Tutorial | ||
| 1136 | 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 | |
| 18112 | For Wizards, the Exam Is Easy, but I Couldn't Handle It | brute force greedy implementation | Statement | D | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 41386 | 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 | ||
| 2541 | Counting Necessary Nodes | bitmasks divide and conquer implementation math | Statement | F | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | Codeforces Round 1009 (Div. 3) — Editorial | ||
| 12424 | Counting Points | brute force geometry implementation two pointers | Statement | D | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | Codeforces Round 1009 (Div. 3) — Editorial | ||
| 45334 | Draw a Square | implementation | Statement | A | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | Codeforces Round 1009 (Div. 3) — Editorial | ||
| 539 | Beautiful Sequence Returns | binary search data structures implementation | Statement | F | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | Educational Codeforces Round 176 Editorial | ||
| 3802 | 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 | |
| 397 | 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 | |
| 2449 | 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 | |
| 18708 | 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 | |
| 92 | Quantifier | combinatorics dp implementation | Statement | E | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 2250.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 12114 | You Soared Afar With Grace | constructive algorithms greedy implementation | Statement | C | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 1500.0 | 141155 | |
| 24041 | Serval and String Theory | constructive algorithms implementation | Statement | A | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 500.0 | Codeforces Round #1011 (Div. 2) Editorial | |
| 17554 | Serval and Final MEX | constructive algorithms implementation | Statement | B | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 1250.0 | Codeforces Round #1011 (Div. 2) Editorial | |
| 16660 | Disappearing Permutation | dfs and similar dsu graphs greedy implementation | Statement | C | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 6545 | Dining Hall | greedy implementation sortings sortings | Statement | C | Codeforces Round 1012 (Div. 2) {2090} | PROGRAMMING | 1750.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 16950 | Pushing Balls | implementation | Statement | B | Codeforces Round 1012 (Div. 2) {2090} | PROGRAMMING | 1000.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 7040 | Mishkin Energizer | brute force constructive algorithms greedy implementation strings | Statement | D | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 1750.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 28876 | 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 | |
| 25517 | Lady Bug | implementation math | Statement | B | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 750.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 12622 | Skibidi Table | bitmasks implementation | Statement | D | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 502 | Wonderful Impostors | data structures implementation two pointers | Statement | F | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) {2096} | PROGRAMMING | 2750.0 | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial | |
| 8508 | Wonderful City | dp implementation | Statement | C | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) {2096} | PROGRAMMING | 1500.0 | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial | |
| 2106 | Wonderful Teddy Bears | greedy implementation sortings | Statement | E | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) {2096} | PROGRAMMING | 2000.0 | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial | |
| 15651 | Mex in the Grid | constructive algorithms implementation | Statement | A | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 500.0 | 142788 | |
| 2239 | Mani and Segments | data structures implementation two pointers | Statement | D | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 2500.0 | 142788 | |
| 652 | Maximize Nor | bitmasks data structures implementation | Statement | F | Codeforces Round 1019 (Div. 2) {2103} | PROGRAMMING | 3000.0 | 142149 | |
| 4088 | Local Construction | constructive algorithms dfs and similar graphs implementation two pointers | Statement | D | Codeforces Round 1019 (Div. 2) {2103} | PROGRAMMING | 2000.0 | 142149 | |
| 754 | 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 | ||
| 663 | Baudelaire (hard version) | binary search dfs and similar divide and conquer implementation interactive trees | Statement | G2 | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 12583 | 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 | |
| 3656 | Apple Tree Traversing | brute force dfs and similar greedy implementation trees | Statement | D | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 2000.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 14986 | SUMdamental Decomposition | bitmasks constructive algorithms greedy implementation math | Statement | B | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 1250.0 | Codeforces Round 1022 Editorial | |
| 942 | Spruce Dispute | constructive algorithms dfs and similar graphs implementation shortest paths trees | Statement | E | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 2750.0 | Codeforces Round 1022 Editorial | |
| 15302 | Neo's Escape | data structures dsu graphs greedy implementation | Statement | C | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 1500.0 | Codeforces Round 1022 Editorial | |
| 27303 | It's Time To Duel | implementation | Statement | A | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 500.0 | Codeforces Round 1025 (Div. 2) Editorial |