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 ... 6 7 8 9 10 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 19836 | Monsters Attack! | dp greedy implementation | Statement | B | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 26346 | Moving Chips | greedy implementation | Statement | A | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 16681 | Did We Get Everything Covered? | constructive algorithms dp greedy strings | Statement | A | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 500.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 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 | |
| 31114 | We Got Everything Covered! | constructive algorithms greedy strings | Statement | A | Codeforces Round 921 (Div. 2) {1925} | PROGRAMMING | 500.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 4506 | Vlad and Trouble at MIT | dfs and similar dp flows graphs greedy implementation trees | Statement | G | 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 | ||
| 37987 | Following the String | constructive algorithms greedy strings | Statement | B | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 5360 | Microcycle | data structures dfs and similar dsu graphs greedy trees | Statement | F | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 1976 | Paint Charges | data structures dp greedy math | Statement | G | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 51264 | Make it White | greedy strings | Statement | A | 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 | |
| 20703 | Equalize | binary search greedy sortings two pointers | Statement | B | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 1000.0 | Codeforces Round 924 Editorial | |
| 2088 | Modular Sequence | constructive algorithms dp greedy implementation math number theory | Statement | E | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 2250.0 | Codeforces Round 924 Editorial | |
| 24396 | Rectangle Cutting | constructive algorithms geometry greedy math | Statement | A | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 500.0 | Codeforces Round 924 Editorial | |
| 17241 | Sasha and the Casino | binary search brute force dp games greedy math | Statement | C | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 1500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 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. | |
| 26697 | Sasha and the Drawing | constructive algorithms greedy math | Statement | B | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 1000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 34870 | Sasha and the Beautiful Array | constructive algorithms greedy sortings | Statement | A | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 4843 | Sum over all Substrings (Easy Version) | brute force dp greedy strings | Statement | D1 | think-cell Round 1 {1930} | PROGRAMMING | 1250.0 | think-cell Round 1 Editorial | |
| 8134 | Lexicographically Largest | constructive algorithms data structures greedy sortings | Statement | C | think-cell Round 1 {1930} | PROGRAMMING | 1500.0 | think-cell Round 1 Editorial | |
| 3044 | Sum over all Substrings (Hard Version) | dp greedy strings | Statement | D2 | think-cell Round 1 {1930} | PROGRAMMING | 1000.0 | think-cell Round 1 Editorial | |
| 20259 | Maximise The Score | greedy sortings | Statement | A | think-cell Round 1 {1930} | PROGRAMMING | 500.0 | think-cell Round 1 Editorial | |
| 33787 | Make Equal Again | brute force greedy math | Statement | C | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 25527 | Anna and the Valentine's Day Gift | games greedy math sortings | Statement | E | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 33801 | Thorns and Coins | dp greedy implementation | Statement | A | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 13405 | Card Game | greedy implementation | Statement | D | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 23455 | Turtle Tenacity: Continual Mods | constructive algorithms greedy number theory sortings | Statement | D | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 42022 | Turtle Puzzle: Rearrange and Negate | greedy math sortings | Statement | A | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 1748 | XOR Break --- Game Version | bitmasks games greedy interactive | Statement | D2 | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1250.0 | Tutorial | |
| 21966 | Yet Another Coin Problem | brute force dp greedy math | Statement | B | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1000.0 | Tutorial | |
| 8057 | Find a Mine | constructive algorithms geometry greedy interactive math | Statement | C | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1500.0 | Tutorial | |
| 27220 | Too Min Too Max | constructive algorithms greedy math | Statement | A | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 500.0 | Tutorial | |
| 1645 | Distance Learning Courses in MAC | binary search bitmasks data structures greedy implementation math | Statement | E | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 2500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 600 | 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 | |
| 8637 | Bitwise Operation Wizard | bitmasks constructive algorithms greedy interactive math | Statement | A | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 500.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 622 | Bitwise Paradox | bitmasks data structures greedy two pointers | Statement | D | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 2000.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 17284 | Binary Path | greedy implementation | Statement | B | Codeforces Round 930 (Div. 2) {1937} | PROGRAMMING | 1000.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 7372 | Rudolf and Imbalance | binary search greedy two pointers | Statement | F | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 34665 | Rudolf and 121 | greedy math | Statement | B | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 6861 | Bessie's Birthday Cake (Hard Version) | geometry greedy math | Statement | C2 | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 750.0 | CodeTON Round 8 Editorial | |
| 370 | MEX Game 2 (Hard Version) | binary search greedy two pointers | Statement | E2 | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 1500.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 2590 | Tree Compass | constructive algorithms dfs and similar greedy trees | Statement | C | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 1250.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 30286 | Setting up Camp | greedy math | Statement | A | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 13674 | 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 | |
| 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 | |
| 28528 | Median of an Array | greedy implementation | Statement | A | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 500.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 23374 | Maximum Sum | greedy math | Statement | B | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 1000.0 | Codeforces Round #936 (Div. 2) 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 | ||
| 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 | ||
| 2516 | Annual Ants' Gathering | dfs and similar greedy trees | Statement | C | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 1406 | Dating | greedy sortings trees | Statement | F | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 11251 | 0, 1, 2, Tree! | greedy math trees | Statement | F | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 4466 | No Palindromes | brute force constructive algorithms greedy hashing implementation strings | Statement | E | Codeforces Global Round 25 {1951} | PROGRAMMING | 2250.0 | Codeforces Global Round 25 Editorial | |
| 6288 | Buying Jewels | constructive algorithms greedy math | Statement | D | Codeforces Global Round 25 {1951} | PROGRAMMING | 1750.0 | Codeforces Global Round 25 Editorial | |
| 357 | Thanos Snap | dp games greedy trees | Statement | H | Codeforces Global Round 25 {1951} | PROGRAMMING | 3500.0 | Codeforces Global Round 25 Editorial | |
| 22522 | Dual Trigger | greedy math | Statement | A | Codeforces Global Round 25 {1951} | PROGRAMMING | 500.0 | Codeforces Global Round 25 Editorial | |
| 13737 | Ticket Hoarding | greedy math sortings | Statement | C | Codeforces Global Round 25 {1951} | PROGRAMMING | 1500.0 | Codeforces Global Round 25 Editorial | |
| 8005 | Colored Balls | combinatorics dp greedy math sortings | Statement | D | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 2955 | Chain Reaction | data structures dsu greedy implementation math number theory | Statement | E | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 22699 | Long Multiplication | greedy math | Statement | C | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 10523 | Long Inversions | brute force greedy implementation sortings | Statement | E | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 8686 | Unfair Game | dp games greedy math | Statement | F | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 24454 | Inhabitant of the Deep Sea | greedy implementation math | Statement | C | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 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) | |
| 15097 | Nene's Magical Matrix | constructive algorithms greedy math | Statement | C | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 1500.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 20360 | 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 |
| 16651 | Everything Nim | games greedy math sortings | Statement | A | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 500.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 1400 |
| 8085 | Missing Subsequence Sum | bitmasks constructive algorithms greedy number theory | Statement | B | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 1250.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 1800 |
| 2344 | Folding Strip | constructive algorithms greedy strings | Statement | C | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 1500.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 2300 |
| 14908 | Permutation Counting | binary search greedy implementation math sortings | Statement | A | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 750.0 | Tutorial | 1400 |
| 17364 | Permutation Game | brute force dfs and similar games graphs greedy math | Statement | D | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1300 | |
| 31351 | Prefiquence | greedy two pointers | Statement | B | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 800 | |
| 5687 | Shop Game | data structures greedy math sortings | Statement | D | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 1900 | |
| 400 | Card Pairing | dp greedy hashing implementation | Statement | F | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 3000 | |
| 30478 | Binary Cut | dp greedy implementation sortings strings | Statement | D | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1100 | |
| 25870 | Contest Proposal | brute force greedy two pointers | Statement | A | Codeforces Round 942 (Div. 2) {1972} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 16778 | Cat, Fox and the Lonely Array | binary search bitmasks data structures greedy math two pointers | Statement | B | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #945 (Div. 2) | 1300 |
| 9828 | Cat, Fox and Double Maximum | constructive algorithms greedy implementation math sortings | Statement | C | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #945 (Div. 2) | 1700 |
| 17746 | Ingenuity-2 | constructive algorithms greedy implementation | Statement | D | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 1400 | |
| 5860 | Money Buys Less Happiness Now | data structures greedy sortings | Statement | G | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 2000 | |
| 37835 | Phone Desktop | greedy math | Statement | A | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 800 | |
| 21014 | 378QAQ and Mocha's Array | brute force greedy math sortings | Statement | B | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 500.0 | editorial_zh.pdf | 1000 |
| 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 |
| 339 | Zimpha Fan Club | fft greedy math strings | Statement | G | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 3000.0 | editorial_zh.pdf | 3000 |
| 216 | 378QAQ and Core | greedy strings | Statement | H | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 4500.0 | editorial_zh.pdf | 3500 |
| 20673 | Bazoka and Mocha's Array | brute force greedy implementation sortings | Statement | A | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 250.0 | editorial_zh.pdf | 800 |
| 12385 | 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 | ||
| 1298 | Splittable Permutations | combinatorics data structures dfs and similar greedy math trees | Statement | E | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 827 | Remove Bridges | data structures dfs and similar dp greedy sortings trees | Statement | F | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 25027 | Increase/Decrease/Copy | greedy implementation | Statement | B | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 19862 | Binary Colouring | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1250.0 | 129858 | 1100 |
| 8011 | Nikita and LCM | brute force data structures dp greedy math number theory sortings | Statement | C | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1750.0 | 129858 | 1900 |
| 2333 | XORificator | bitmasks brute force greedy hashing | Statement | D | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 2000.0 | 129858 | 2300 |
| 25285 | New Bakery | binary search greedy math ternary search | Statement | B | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 750.0 | 130527 | |
| 17750 | Manhattan Permutations | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1250.0 | 130527 | |
| 4593 | Computing Machine | data structures dp greedy implementation | Statement | E | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 2000.0 | 130527 | |
| 13595 | Elections | data structures greedy implementation math | Statement | D | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1500.0 | 130527 | |
| 7833 | Fixing a Binary String | bitmasks brute force constructive algorithms greedy hashing strings | Statement | D | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 2000.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 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 | |
| 17321 | GCD-sequence | greedy implementation math math number theory number theory | Statement | D | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 6329 | Turtle and an Incomplete Sequence | bitmasks constructive algorithms greedy implementation math | Statement | C | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 1500.0 | Simplified Chinese Tutorial | |
| 24224 | Turtle and Piggy Are Playing a Game | brute force greedy math | Statement | A | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 500.0 | Simplified Chinese Tutorial | |
| 21832 | Boring Day | binary search data structures dp greedy two pointers | Statement | C | 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 | |
| 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 | ||
| 11001 | Swap Dilemma | constructive algorithms divide and conquer greedy math sortings | Statement | D | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1750.0 | ||
| 18365 | Corner Twist | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1000.0 | ||
| 1810 | Shuffle | constructive algorithms dp greedy trees | Statement | E | Codeforces Global Round 26 {1984} | PROGRAMMING | 3000.0 | Codeforces Global Round 26 Editorial | |
| 39904 | Good Prefixes | greedy implementation | Statement | C | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 30087 | Matrix Stabilization | brute force greedy sortings | Statement | B | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 25942 | Update Queries | data structures greedy sortings | Statement | C | 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 | |
| 28922 | Upload More RAM | greedy math | Statement | A | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 250.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 26939 | Split the Multiset | brute force dp greedy math | Statement | A | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 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 | |
| 7869 | Prime XOR Coloring | bitmasks constructive algorithms graphs greedy math number theory | Statement | D | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 2770 | Triangle Formation | brute force greedy math sortings | Statement | F | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 2500.0 | Video Tutorial | |
| 5101 | Coloring Game | constructive algorithms games graphs greedy interactive | Statement | E | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 171 | Grid Game | constructive algorithms games greedy interactive | Statement | I | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 4000.0 | Video Tutorial | |
| 17668 | Absolute Zero | constructive algorithms greedy math | Statement | C | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 24346 | Maximize the Last Element | greedy implementation | Statement | A | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 250.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 | ||
| 23931 | Test of Love | dp greedy implementation | Statement | D | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 7363 | Valuable Cards | dp greedy number theory two pointers | Statement | F | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 37864 | Angry Monk | greedy math sortings | Statement | B | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 33073 | Question Marks | greedy implementation | Statement | A | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 19429 | Fun Game | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 5470 | Wooden Game | bitmasks greedy math trees | Statement | E | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 7349 | Funny Game | constructive algorithms dsu graphs greedy math number theory | Statement | D | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 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 | |
| 10131 | Bouquet (Hard Version) | binary search data structures greedy math sortings two pointers | Statement | B2 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 500.0 | Video Tutorial | |
| 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 | |
| 6292 | Bomb | binary search greedy math | Statement | F | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 15828 | Maximize the Root | binary search dfs and similar dp greedy trees | Statement | D | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 2277 | Eliminating Balls With Merging (Easy Version) | binary search brute force data structures divide and conquer dp greedy math | Statement | E1 | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 32583 | Slavic's Exam | greedy implementation strings | Statement | D | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 3117 | Call During the Journey | binary search brute force graphs greedy shortest paths | Statement | G | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 16170 | Photoshoot for Gorillas | combinatorics data structures greedy math | Statement | E | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 6906 | Color Rows and Columns | dp greedy implementation math | Statement | F | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 28696 | Right Left Wrong | greedy implementation two pointers | Statement | D | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 12741 | Guess The Tree | binary search brute force greedy interactive trees | Statement | C | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 6354 | Longest Max Min Subsequence | brute force constructive algorithms greedy two pointers | Statement | D | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 26053 | Generate Permutation | constructive algorithms greedy implementation | Statement | B | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 32825 | Make All Equal | greedy implementation | Statement | A | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 500.0 | Video Tutorial | |
| 17655 | Black Circles | brute force constructive algorithms geometry greedy math | Statement | C | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1000.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 2911 | 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 | |
| 637 | Turtle and Inversions (Hard Version) | brute force constructive algorithms data structures dp greedy two pointers | Statement | E2 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1000.0 | sol-zh.pdf | |
| 21589 | Turtle and Good Pairs | constructive algorithms greedy strings | Statement | C | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1000.0 | sol-zh.pdf | |
| 798 | Turtle and Three Sequences | data structures dp graphs greedy meet-in-the-middle probabilities two pointers | Statement | F | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 2500.0 | sol-zh.pdf | |
| 4627 | 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 | |
| 27477 | Turtle and Piggy Are Playing a Game 2 | games greedy sortings | Statement | B | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 750.0 | sol-zh.pdf | |
| 13402 | Turtle and a MEX Problem (Easy Version) | greedy math | Statement | D1 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1000.0 | sol-zh.pdf | |
| 32606 | Turtle and Good Strings | greedy strings | Statement | A | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 500.0 | sol-zh.pdf | |
| 13205 | Colored Portals | binary search data structures graphs greedy shortest paths | Statement | D | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 1410 | Make a Palindrome | brute force data structures dp greedy math | Statement | F | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 26937 | Splitting Items | games greedy sortings | Statement | C | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 21564 | The Strict Teacher (Hard Version) | binary search greedy math sortings | Statement | B2 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 500.0 | Discussion stream (With Hints) | |
| 3314 | Subtangle Game (Easy Version) | dp games greedy implementation | Statement | E1 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 1500.0 | Discussion stream (With Hints) | |
| 1056 | Subtangle Game (Hard Version) | dp games greedy implementation | Statement | E2 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 2000.0 | Discussion stream (With Hints) | |
| 24670 | The Strict Teacher (Easy Version) | greedy math sortings | Statement | B1 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 500.0 | Discussion stream (With Hints) | |
| 9292 | Iris and Game on the Tree | games graphs greedy trees | Statement | A | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 750.0 | Tutorial | |
| 6645 | Sakurako's Task | binary search brute force greedy math number theory | Statement | G | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 3580 | Sakurako's Test | binary search brute force greedy math number theory | Statement | H | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 41681 | Sakurako's Exam | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 13131 | Alternating String | brute force data structures dp greedy strings | Statement | E | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 182 | Rock-Paper-Scissors Bot | *special greedy strings | Statement | E | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | Kotlin Heroes 11 — Editorial | ||
| 7440 | Minimize the Difference | binary search data structures greedy implementation math | Statement | D | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 4199 | Prefix GCD | brute force dp greedy math number theory | Statement | E | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2500.0 | 134298 | |
| 28142 | Battle for Survive | constructive algorithms greedy math | Statement | B | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 750.0 | 134298 | |
| 27384 | Robin Hood in Town | binary search divide and conquer greedy math | Statement | C | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 5607 | Robin Hood Archery | data structures games greedy hashing | Statement | H | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 15919 | Robert Hood and Mrs Hood | data structures greedy sortings | Statement | D | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 237 | Complex Segments (Easy Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E1 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 203 | Complex Segments (Hard Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E2 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 5161 | Speedbreaker | binary search dp greedy implementation math two pointers | Statement | B | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 9526 | Tree Pruning | brute force data structures dfs and similar greedy sortings trees | Statement | C | 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) | |
| 2182 | 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) | |
| 283 | Speedbreaker Counting (Medium Version) | dp greedy math | Statement | F2 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 300 | Speedbreaker Counting (Hard Version) | dp greedy math | Statement | F3 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 25821 | Find Minimum Operations | bitmasks greedy math | Statement | A | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 500.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 1918 | Digital Village (Easy Version) | brute force data structures dp dsu graphs greedy implementation math shortest paths trees | Statement | E1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 18751 | Maximize Mex | brute force greedy math number theory | Statement | B | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 4494 | 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 | |
| 676 | Digital Village (Extreme Version) | data structures dp graphs greedy math | Statement | E3 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1000.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 953 | Boss, Thirsty | data structures dp greedy math | Statement | D | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 2500.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 21483 | Meaning Mean | data structures greedy math sortings | Statement | A | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 500.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 17198 | Bus to Pénjamo | greedy implementation math | Statement | A | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 750.0 | Codeforces Round 978 (Div 2) Editorial | |
| 14471 | Kar Salesman | greedy math | Statement | B | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1000.0 | Codeforces Round 978 (Div 2) Editorial | |
| 1369 | C+K+S | brute force constructive algorithms dfs and similar graphs greedy hashing math strings | Statement | C | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1500.0 | 135341 | |
| 7042 | Skipping | brute force data structures dp graphs greedy shortest paths | Statement | B | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1000.0 | 135341 | |
| 16527 | Concatenation of Arrays | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 500.0 | 135341 | |
| 174 | Tree of Life | dp greedy trees | Statement | E | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 2750.0 | 135341 | |
| 18962 | 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 | ||
| 28484 | Two Screens | binary search greedy strings two pointers | Statement | A | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 2354 | Card Game | combinatorics dp fft greedy math | Statement | E | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 1047 | Choose Your Queries | dfs and similar dp graphs greedy trees | Statement | F | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 1897 | 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 | |
| 6929 | 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 | |
| 9922 | Alice's Adventures in Cutting Cake | binary search dp greedy two pointers | Statement | C | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1500.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 3724 | 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 | |
| 1892 | Alice's Adventures in the Rabbit Hole | constructive algorithms dfs and similar dp greedy math probabilities trees | Statement | E | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 2000.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 14138 | Set | binary search greedy math | Statement | A | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 750.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 3520 | Common Generator | brute force constructive algorithms greedy math number theory | Statement | E | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2500.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 11692 | Replacement | games greedy strings | Statement | B | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 1250.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 1155 | Orangutan Approved Subarrays | binary search brute force data structures greedy two pointers | Statement | F | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 2500.0 | Codeforces Round 979 Editorial | |
| 27546 | A Gift From Orangutan | brute force dfs and similar greedy sortings | Statement | A | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 250.0 | Codeforces Round 979 Editorial | |
| 9642 | Penchick and Desert Rabbit | data structures dfs and similar dp dsu greedy two pointers | Statement | D | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 2000.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 2677 | Penchick and Chloe's Trees | data structures dfs and similar dp greedy sortings trees | Statement | E | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 2500.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 20892 | Penchick and Modern Monument | dp greedy math two pointers | Statement | A | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 500.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 20742 | Penchick and Satay Sticks | greedy sortings | Statement | B | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 1000.0 | Codeforces Round 987 (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 | |
| 14084 | Sakurako, Kosuke, and the Permutation | brute force data structures dfs and similar dsu fft greedy math | Statement | E | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 18141 | Kousuke's Assignment | dp dsu greedy math | Statement | D | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 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 | |
| 6579 | 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 | |
| 15708 | 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 | |
| 77 | 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 | |
| 77 | 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 | |
| 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 | |
| 20513 | Everyone Loves Tres | constructive algorithms greedy math number theory | Statement | B | Codeforces Global Round 27 {2035} | PROGRAMMING | 500.0 | Codeforces Global Round 27 Editorial | |
| 29708 | Startup | greedy sortings | Statement | B | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 25464 | Superultra's Favorite Permutation | constructive algorithms greedy math number theory | Statement | C | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 14703 | Sharky Surfing | data structures greedy two pointers | Statement | D | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 7349 | Kachina's Favorite Binary String | greedy interactive two pointers | Statement | E | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 7958 | Bridge Renovation | brute force dp greedy math | Statement | L | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 1400 | ||
| 1904 | Make It Equal | binary search brute force greedy math | Statement | B | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2100 | ||
| 1770 | Grid Walk | dp greedy math number theory | Statement | K | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2100 | ||
| 156 | Barrels | data structures greedy math | Statement | E | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2900 | ||
| 8754 | 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 | ||
| 17241 | Shohag Loves Strings | constructive algorithms greedy implementation strings | Statement | B | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 1000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 6941 | Shohag Loves GCD | constructive algorithms greedy math number theory | Statement | D | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 5833 | Non Prime Tree | brute force constructive algorithms dfs and similar greedy number theory trees two pointers | Statement | D | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2000.0 | Codeforces Round #992 (Div.2) Editorial | |
| 2656 | Control of Randomness | combinatorics dfs and similar graphs greedy math probabilities trees | Statement | E | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2250.0 | Codeforces Round #992 (Div.2) Editorial | |
| 24032 | Paint a Strip | constructive algorithms greedy math | Statement | B | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1000.0 | Codeforces Round #992 (Div.2) Editorial | |
| 10732 | Ordered Permutations | constructive algorithms greedy math | Statement | C | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1500.0 | Codeforces Round #992 (Div.2) Editorial | |
| 520 | Vertex Pairs | binary search brute force dfs and similar dp greedy trees | Statement | E | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 20826 | Greedy Monocarp | greedy sortings | Statement | A | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 8605 | Competitive Fishing | greedy sortings | Statement | C | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 11149 | Sums on Segments | binary search brute force data structures dp greedy math | Statement | C | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 17964 | Insane Problem | binary search greedy implementation math | Statement | E | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial |