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 ... 7 8 9 10 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 24348 | Harder Problem | constructive algorithms greedy math | Statement | D | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 45743 | Hard Problem | greedy math | Statement | C | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 7382 | Saraga | greedy strings | Statement | C | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 1400 | |
| 11070 | Move Back at a Cost | binary search data structures greedy sortings | Statement | B | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 750.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 17033 | Swap Columns and Find a Path | greedy sortings | Statement | A | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 500.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 19472 | Replace Character | brute force combinatorics greedy strings | Statement | B | Codeforces Round 990 (Div. 2) {2047} | PROGRAMMING | 1000.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 8433 | Kevin and Competition Memories | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Global Round 28 {2048} | PROGRAMMING | 1250.0 | Tutorial | |
| 15297 | Kevin and Binary Strings | bitmasks brute force greedy strings | Statement | C | Codeforces Global Round 28 {2048} | PROGRAMMING | 1000.0 | Tutorial | |
| 13817 | MEX Cycle | constructive algorithms greedy implementation | Statement | C | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 1000.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 24231 | MEX Destruction | greedy implementation | Statement | A | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 500.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 27433 | Transfusion | brute force greedy math | Statement | B | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 19252 | Digital string maximization | brute force greedy math strings | Statement | D | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 5464 | Tree Destruction | dfs and similar dp greedy trees | Statement | G | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 12166 | Best Price | brute force data structures greedy sortings | Statement | E | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 4050 | Joker | greedy math | Statement | F | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 7770 | 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 | |
| 227 | Naive String Splits | brute force greedy hashing strings | Statement | G | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 4250.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 109 | Affectionate Arrays (Hard Version) | data structures dp graphs greedy math shortest paths two pointers | Statement | I2 | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 956 | 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 | |
| 17441 | The Trail | constructive algorithms greedy math | Statement | C | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 1500.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 27544 | Crafting | greedy sortings | Statement | B | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 1000.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 13970 | Trip to the Olympiad | bitmasks constructive algorithms greedy math | Statement | C | Hello 2025 {2057} | PROGRAMMING | 1500.0 | ||
| 189 | Coffee Break | data structures greedy greedy math | Statement | H | Hello 2025 {2057} | PROGRAMMING | 4500.0 | ||
| 5496 | Gifts Order | data structures greedy math | Statement | D | Hello 2025 {2057} | PROGRAMMING | 2250.0 | ||
| 23511 | Gorilla and the Exam | greedy sortings | Statement | B | Hello 2025 {2057} | PROGRAMMING | 1000.0 | ||
| 12728 | Customer Service | brute force constructive algorithms graph matchings greedy math sortings | Statement | C | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 897 | Stop Gaming (Easy Version) | brute force constructive algorithms greedy hashing | Statement | E1 | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 18985 | Cost of the Array | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1000.0 | 139094 | |
| 29328 | Milya and Two Arrays | constructive algorithms greedy sortings | Statement | A | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 500.0 | 139094 | |
| 6660 | Graph and Graph | data structures graphs greedy shortest paths | Statement | D | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 2000.0 | 139094 | |
| 1322 | Bugged Sort | dp greedy sortings | Statement | G | Codeforces Round 998 (Div. 3) {2060} | PROGRAMMING | Codeforces Round 998 (Div. 3) Editorial | ||
| 32479 | Game of Mathletes | games greedy sortings two pointers | Statement | C | Codeforces Round 998 (Div. 3) {2060} | PROGRAMMING | Codeforces Round 998 (Div. 3) Editorial | ||
| 28856 | Farmer John's Card Game | greedy sortings | Statement | B | Codeforces Round 998 (Div. 3) {2060} | PROGRAMMING | Codeforces Round 998 (Div. 3) Editorial | ||
| 2291 | 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 | |
| 14863 | 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 | |
| 10968 | 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 | |
| 22445 | Kevin and Arithmetic | constructive algorithms greedy math | Statement | A | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 500.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 3586 | Balanced Tree | dfs and similar dp greedy trees | Statement | D | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 2000.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 620 | Traveling Salescat | dp geometry greedy math sortings | Statement | F | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 3500.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 28430 | String | greedy strings | Statement | A | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 500.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 5115 | Game With Triangles | binary search data structures dp greedy math ternary search two pointers | Statement | D | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 2250.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 14910 | Remove Exactly Two | brute force data structures dp graphs greedy sortings trees | Statement | C | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1500.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 2403 | Triangle Tree | data structures dfs and similar dp dsu greedy trees | Statement | E | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 2750.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 23384 | Subsequence Update | greedy sortings | Statement | B | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1000.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 5946 | Eating | binary search bitmasks data structures greedy two pointers | Statement | D | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 1750.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 20315 | Variety is Discouraged | constructive algorithms constructive algorithms greedy greedy | Statement | B | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 1000.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 27227 | Brogramming Contest | greedy strings | Statement | A | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 500.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 7253 | Skibidus and Slay | data structures dfs and similar graphs greedy trees | Statement | F | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 5538 | White Magic | constructive algorithms greedy implementation | Statement | B | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 750.0 | 139415 | |
| 425 | Tropical Season | data structures greedy implementation | Statement | E | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 2000.0 | 139415 | |
| 12916 | Devyatkino | brute force dp greedy math | Statement | C | Codeforces Round 1004 (Div. 2) {2067} | PROGRAMMING | 1250.0 | ||
| 19250 | Two Large Bags | dp greedy sortings | Statement | B | Codeforces Round 1004 (Div. 2) {2067} | PROGRAMMING | 1000.0 | ||
| 1665 | Ads | binary search greedy two pointers | Statement | C | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 1533 | Mascot Naming | brute force greedy strings | Statement | F | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 268 | Morse Code | dp greedy sortings trees | Statement | D | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 7158 | Palindrome Shuffle | binary search greedy hashing strings two pointers | Statement | D | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | 139774 | ||
| 1937 | A, B, AB and BA | constructive algorithms greedy sortings strings | Statement | E | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | 139774 | ||
| 18995 | Set of Strangers | greedy matrices | Statement | B | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | 139774 | ||
| 1889 | Game with Binary String | data structures divide and conquer games greedy math | Statement | E | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | Video Tutorial | ||
| 21131 | Perfecto | brute force constructive algorithms greedy math probabilities | Statement | B | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1000.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 12506 | Do You Love Your Hero and His Two-Hit Multi-Target Attacks? | binary search constructive algorithms geometry greedy math | Statement | E | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 17866 | 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 | ||
| 40937 | 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 | ||
| 35041 | The Third Side | greedy math | Statement | B | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | Codeforces Round 1009 (Div. 3) — Editorial | ||
| 5923 | Equalization | bitmasks brute force dp greedy math | Statement | D | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | Educational Codeforces Round 176 Editorial | ||
| 28041 | To Zero | greedy math | Statement | A | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | Educational Codeforces Round 176 Editorial | ||
| 14816 | Breach of Faith | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 18512 | 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 | |
| 6641 | Scammy Game Ad | dp greedy math | Statement | D | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 1750.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 23412 | Final Verdict | greedy math | Statement | A | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 1217 | MST in Modulo Graph | constructive algorithms dsu graphs greedy math number theory sortings | Statement | D | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1750.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 9024 | Arcology On Permafrost | binary search brute force constructive algorithms greedy math | Statement | D | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 1750.0 | 141155 | |
| 11903 | 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 | |
| 16883 | MIN = GCD | greedy math | Statement | B | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 1000.0 | 141155 | |
| 19223 | Large Array and Segments | binary search brute force dp greedy math | Statement | B | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 16348 | 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 | ||
| 89 | Esports in Berland | *special *special greedy greedy | Statement | G | Kotlin Heroes: Episode 12 {2087} | PROGRAMMING | 141608 | ||
| 3282 | Canteen (Easy Version) | binary search data structures flows greedy two pointers | Statement | B1 | Codeforces Round 1012 (Div. 1) {2089} | PROGRAMMING | 1000.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 1301 | Canteen (Hard Version) | binary search data structures greedy math two pointers | Statement | B2 | Codeforces Round 1012 (Div. 1) {2089} | PROGRAMMING | 500.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 6442 | 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 | |
| 23810 | Place of the Olympiad | binary search greedy math | Statement | D | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 1545 | Gleb and Boating | brute force constructive algorithms data structures dp graphs greedy math shortest paths | Statement | G | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 32933 | Team Training | dp greedy sortings | Statement | B | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 39280 | Olympiad Date | greedy strings | Statement | A | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 6955 | 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 | |
| 433 | Andryusha and CCB | brute force constructive algorithms greedy math number theory strings | Statement | F | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 3000.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 22909 | Asuna and the Mosquitoes | constructive algorithms greedy math | Statement | C | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 1250.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 28528 | 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 | |
| 3891 | Shorten the Array | binary search brute force data structures dfs and similar greedy strings trees two pointers | Statement | G | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 31202 | Expensive Number | greedy math | Statement | B | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 24279 | Tung Tung Sahur | greedy strings two pointers | Statement | D | Codeforces Round 1017 (Div. 4) {2094} | PROGRAMMING | Codeforces Round 1017 (Div. 4) Editorial | ||
| 2079 | 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 | |
| 16736 | Wonderful Gloves | greedy math sortings | Statement | B | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) {2096} | PROGRAMMING | 750.0 | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial | |
| 2622 | 23 Kingdom | binary search data structures greedy ternary search two pointers | Statement | C | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 2000.0 | 142788 | |
| 7237 | Quartet Swapping | data structures greedy sortings | Statement | B | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 1250.0 | 142788 | |
| 25111 | Common Multiple | brute force greedy math | Statement | A | Codeforces Round 1019 (Div. 2) {2103} | PROGRAMMING | 500.0 | 142149 | |
| 17894 | Binary Typewriter | greedy math | Statement | B | Codeforces Round 1019 (Div. 2) {2103} | PROGRAMMING | 1000.0 | 142149 | |
| 8260 | Unpleasant Strings | binary search data structures dp greedy strings | Statement | E | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 13506 | Array and GCD | binary search greedy math number theory | Statement | D | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 17635 | Card Game | brute force games greedy math | Statement | C | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 12500 | Flower Boy | binary search dp greedy two pointers | Statement | D | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 6030 | Wolf | binary search greedy math | Statement | E | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 28681 | St. Chroma | constructive algorithms greedy math | Statement | B | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 4485 | Goblin | dp dsu greedy math | Statement | F | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 25954 | Cherry Bomb | greedy math sortings | Statement | C | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 3595 | 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 | |
| 953 | Ain and Apple Tree | constructive algorithms greedy math trees | Statement | E | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 2750.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 20060 | Apples in Boxes | games greedy math | Statement | B | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 750.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 22336 | LRC and VIP | greedy number theory | Statement | A | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 250.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 14748 | SUMdamental Decomposition | bitmasks constructive algorithms greedy implementation math | Statement | B | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 1250.0 | Codeforces Round 1022 Editorial | |
| 22281 | Permutation Warm-Up | combinatorics greedy math number theory | Statement | A | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 500.0 | Codeforces Round 1022 Editorial | |
| 14999 | Neo's Escape | data structures dsu graphs greedy implementation | Statement | C | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 1500.0 | Codeforces Round 1022 Editorial | |
| 5765 | D/D/D | dfs and similar graphs greedy shortest paths | Statement | D | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 1750.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 5466 | Changing the String | binary search data structures greedy implementation sortings strings | Statement | E | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 1441 | Puzzle | brute force constructive algorithms greedy math | Statement | F | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 12226 | Creating a Schedule | constructive algorithms data structures greedy sortings | Statement | D | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 20853 | Energy Crystals | greedy implementation math | Statement | A | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 18023 | Coloring Game | binary search brute force greedy two pointers | Statement | C | Educational Codeforces Round 180 (Rated for Div. 2) {2112} | PROGRAMMING | Educational Codeforces Round 180 — Editorial | ||
| 650 | Variables and Operations | graphs greedy shortest paths | Statement | F | Educational Codeforces Round 180 (Rated for Div. 2) {2112} | PROGRAMMING | Educational Codeforces Round 180 — Editorial | ||
| 20656 | Shashliks | greedy math | Statement | A | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 500.0 | Codeforces Round #1031 Editorial | |
| 14869 | Come a Little Closer | brute force greedy implementation math | Statement | D | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 31274 | Need More Arrays | greedy greedy greedy | Statement | C | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 30870 | Not Quite a Palindromic String | greedy greedy math math | Statement | B | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 15545 | Gellyfish and Flaming Peony | brute force constructive algorithms dp greedy math number theory shortest paths | Statement | A | Codeforces Round 1028 (Div. 1) {2115} | PROGRAMMING | 500.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 1033 | Gellyfish and Eternal Violet | combinatorics dp greedy math meet-in-the-middle probabilities | Statement | C | Codeforces Round 1028 (Div. 1) {2115} | PROGRAMMING | 1750.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 5246 | Omg Graph | brute force dsu graphs greedy shortest paths sortings | Statement | G | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 38485 | False Alarm | greedy implementation | Statement | A | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 18781 | Make It Beautiful | bitmasks greedy math | Statement | C | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 1444 | Grid Coloring | constructive algorithms greedy sortings | Statement | E | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 2500.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 726 | And Constraint | bitmasks dp greedy implementation | Statement | E | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 2500.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 18616 | Line Segments | geometry greedy math | Statement | B | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 1000.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 27519 | Add or XOR | greedy math | Statement | A | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 500.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 12854 | Divine Tree | constructive algorithms greedy math sortings trees | Statement | C | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 1250.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 110 | Eulerian Line Graph | graphs greedy math | Statement | G | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 4000.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 32713 | Above the Clouds | constructive algorithms greedy strings | Statement | B | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 22106 | Those Who Are With Us | greedy greedy implementation | Statement | C | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 14971 | Sponsor of Your Problems | greedy strings | Statement | E | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 8892 | Manhattan Pairs | constructive algorithms greedy math sortings | Statement | C | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 1500.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 1339 | Greedy Grid Counting | dp greedy math | Statement | E | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 2500.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 15828 | Pile Shuffling | greedy math | Statement | B | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 1000.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 15184 | MEX Count | binary search data structures greedy sortings two pointers | Statement | E | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 8443 | Make a Palindrome | greedy sortings | Statement | D | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 1750.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 27991 | Left and Down | greedy math number theory | Statement | B | Educational Codeforces Round 181 (Rated for Div. 2) {2125} | PROGRAMMING | Educational Codeforces Round 181 Editorial | ||
| 26656 | I Will Definitely Make It | greedy sortings | Statement | C | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 24416 | This Is the Last Time | greedy sortings | Statement | D | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 3160 | Ancient Tree | constructive algorithms data structures dfs and similar dsu greedy trees | Statement | E | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2500.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 20182 | Mix Mex Max | constructive algorithms greedy math | Statement | A | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 500.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 13124 | Trip Shopping | games greedy sortings | Statement | C | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 1500.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 21909 | Deque Process | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1000.0 | Codeforces Round #1039 — Editorial | |
| 28976 | Recycling Center | greedy sortings | Statement | A | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 500.0 | Codeforces Round #1039 — Editorial | |
| 29025 | Submission is All You Need | greedy math | Statement | A | Codeforces Round 1040 (Div. 2) {2130} | PROGRAMMING | 500.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 4790 | Unjust Binary Life | binary search binary search data structures greedy greedy math two pointers | Statement | F | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 901 | Sea, You & copriMe | brute force combinatorics constructive algorithms graphs greedy math number theory | Statement | H | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 31326 | Alternating Series | constructive algorithms greedy math | Statement | B | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 14668 | Arboris Contractio | graphs greedy trees | Statement | D | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 7797 | Arithmetics Competition | binary search data structures greedy ternary search | Statement | E | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 13618 | The Cunning Seller (hard version) | binary search greedy math | Statement | C2 | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 28291 | The Cunning Seller (easy version) | greedy math | Statement | C1 | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 7721 | Chicken Jockey | binary search brute force dp greedy math | Statement | D | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 2250.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 19252 | Even Larger | greedy greedy | Statement | C | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 1250.0 | 145832 | |
| 21471 | Like the Bitset | constructive algorithms greedy two pointers | Statement | B | Codeforces Round 1046 (Div. 2) {2136} | PROGRAMMING | 1000.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 26645 | In the Dream | greedy math | Statement | A | Codeforces Round 1046 (Div. 2) {2136} | PROGRAMMING | 500.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 23413 | Maximum Even Sum | brute force greedy implementation math | Statement | C | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 26334 | Maple and Multiplication | greedy math | Statement | A | Codeforces Round 1048 (Div. 2) {2139} | PROGRAMMING | 500.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 5132 | A Cruel Segment's Thesis | greedy math sortings | Statement | D | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 1750.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 22764 | Shift Sort | greedy sortings strings | Statement | A | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 500.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 483 | Avoid Minimums | *special greedy math | Statement | D | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 21676 | Discounts | greedy sortings two pointers | Statement | B | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 1000.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 15926 | Monocarp's String | binary search greedy strings | Statement | C | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 22170 | Deck of Cards | greedy implementation | Statement | B | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 10967 | Max Sum OR (Easy Version) | bitmasks constructive algorithms divide and conquer greedy trees | Statement | D1 | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 22287 | Equal Occurrences | brute force greedy implementation | Statement | A | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 16421 | Merging the Sets | greedy implementation | Statement | B | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1000.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 10459 | Rabbits | 2-sat dp graphs greedy implementation | Statement | C | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 1500.0 | ||
| 6748 | Gravity Falls | greedy implementation sortings | Statement | F | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 25847 | Pacer | greedy math | Statement | C | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 27370 | Destruction of the Dandelion Fields | greedy sortings | Statement | D | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 33503 | Unconventional Pairs | greedy sortings | Statement | B | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 10772 | Incremental Stay | greedy implementation | Statement | C | Codeforces Round 1053 (Div. 2) {2151} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 1452 | Triple Attack | brute force data structures greedy trees two pointers | Statement | F | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 4000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 13000 | Triple Removal | data structures greedy math | Statement | C | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 1500.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 12092 | Symmetrical Polygons | geometry greedy sortings | Statement | C | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 1250.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 1232 | No Mind To Think | binary search greedy sortings ternary search two pointers | Statement | E | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 2500.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 13937 | No Cost Too Great (Easy Version) | greedy implementation math number theory | Statement | C1 | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 1250.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 5643 | No Cost Too Great (Hard Version) | greedy math number theory | Statement | C2 | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 1000.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 23504 | Notelock | greedy two pointers | Statement | A | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 500.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 3054 | Mimo & Yuyu | games greedy math | Statement | E | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 2250.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 21259 | Strange Machine | binary search brute force greedy implementation | Statement | B | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 750.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 1647 | Strange Operation (Easy Version) | brute force data structures greedy implementation | Statement | F1 | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 3250.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 12638 | Maximum GCD on Whiteboard | greedy math number theory | Statement | C | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 1500.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 3886 | Adjusting Drones | binary search data structures dsu greedy implementation sortings | Statement | E | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 2000.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 470 | Isaac's Queries | brute force constructive algorithms dfs and similar divide and conquer greedy interactive math probabilities | Statement | G | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 3000.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 9960 | Meximum Array 2 | constructive algorithms greedy math | Statement | C | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 1500.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 17141 | Dungeon Equilibrium | greedy implementation sortings | Statement | A | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 500.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 6539 | Billion Players Game | greedy math sortings ternary search two pointers | Statement | D | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 1500.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 14435 | Split | constructive algorithms greedy math | Statement | B | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 1250.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 23802 | Suspension | greedy math | Statement | A | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 500.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 1186 | Inverse Minimum Partition (Easy Version) | binary search data structures dp greedy math two pointers | Statement | D1 | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 1500.0 | Codeforces Round 1058 Editorial | |
| 18130 | Distinct Elements | greedy math | Statement | B | Codeforces Round 1058 (Div. 2) {2160} | PROGRAMMING | 1000.0 | Codeforces Round 1058 Editorial | |
| 2822 | Locked Out | binary search data structures dp graphs greedy implementation two pointers | Statement | D | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 2250.0 | ||
| 13027 | Loyalty | constructive algorithms greedy sortings two pointers | Statement | C | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 1750.0 | ||
| 15915 | Round Trip | games greedy implementation math | Statement | A | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 500.0 | ||
| 9622 | Beautiful Palindromes | constructive algorithms greedy schedules | Statement | E | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 11387 | Dungeon | binary search brute force data structures greedy sortings | Statement | C | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 1500.0 | Codeforces Global Round 30 Editorial | |
| 5386 | Copy String | binary search greedy implementation strings | Statement | D | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 1750.0 | Codeforces Global Round 30 Editorial | |
| 14819 | Cyclic Merging | brute force constructive algorithms graphs greedy trees | Statement | A | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 500.0 | 148452 | |
| 36659 | Isamatdin and His Magic Wand! | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 1627 | Locate | binary search constructive algorithms greedy interactive | Statement | B | Testing Round 20 (Unrated, Communication Problems) {2168} | PROGRAMMING | Testing Round 20 Editorial (officially unofficial) | ||
| 2340 | Removal of a Sequence (Hard Version) | binary search constructive algorithms divide and conquer greedy implementation math number theory probabilities | Statement | D2 | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 11661 | Quotient and Remainder | binary search greedy two pointers | Statement | C | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 1725 | Almost Roman | constructive algorithms greedy implementation | Statement | D | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 20363 | Maximum Neighborhood | greedy math | Statement | A | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 14890 | Addition on a Segment | greedy math | Statement | B | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 12043 | Rae Taylor and Trees (easy version) | binary search data structures dp dsu greedy implementation trees | Statement | D | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 2401 | Sakura Adachi and Optimal Sequences | bitmasks combinatorics greedy math | Statement | G | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 3734 | Anisphia Wynn Palettia and Good Permutations | constructive algorithms greedy number theory | Statement | E | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 12918 | Kanade's Perfect Multiples | greedy number theory | Statement | C | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 1250.0 | ||
| 308 | Secret Message | data structures greedy trees | Statement | D | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 2750.0 | Codeforces Round 1069 Editorial | |
| 14872 | Needle in a Haystack | greedy strings two pointers | Statement | A | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 500.0 | Codeforces Round 1069 Editorial | |
| 23451 | Optimal Shifts | bitmasks greedy strings | Statement | B | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 1000.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 1314 | Remove at the lowest cost | data structures dfs and similar greedy implementation trees | Statement | E | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 2500.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 29572 | Operations with Inversions | data structures greedy implementation | Statement | A | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 500.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 16157 | Odd Process | greedy math sortings | Statement | C | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 1500.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 26254 | Yes or Yes | brute force greedy strings | Statement | A | Good Bye 2025 {2178} | PROGRAMMING | 500.0 | ||
| 6880 | Xmas or Hysteria | constructive algorithms graphs greedy implementation | Statement | D | Good Bye 2025 {2178} | PROGRAMMING | 1750.0 | ||
| 16198 | First or Second | dp greedy implementation | Statement | C | Good Bye 2025 {2178} | PROGRAMMING | 1250.0 | ||
| 22059 | Impost or Sus | greedy implementation strings | Statement | B | Good Bye 2025 {2178} | PROGRAMMING | 750.0 | ||
| 13895 | Blackslex and Penguin Civilization | bitmasks constructive algorithms greedy math | Statement | D | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 28895 | Blackslex and Showering | greedy implementation | Statement | B | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 6609 | XOR-factorization | bitmasks constructive algorithms dp greedy number theory | Statement | C | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 1500.0 | Codeforces Global Round 31 | |
| 4335 | Insolvable Disks | greedy math | Statement | D | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 1750.0 | Codeforces Global Round 31 | |
| 24945 | Ashmal | greedy strings | Statement | B | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 750.0 | Codeforces Global Round 31 | |
| 154 | Elevator Against Humanity | brute force constructive algorithms greedy sortings | Statement | E | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 9268 | Christmas Tree Decoration | combinatorics dp greedy math | Statement | D | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 5735 | New Year's Gifts | data structures greedy implementation sortings two pointers | Statement | E | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 25860 | New Year String | greedy implementation strings | Statement | A | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 11034 | War Strategy | binary search greedy math two pointers | Statement | C | Hello 2026 {2183} | PROGRAMMING | 1500.0 | ||
| 2544 | Tree Coloring (Hard Version) | constructive algorithms data structures dfs and similar greedy implementation trees | Statement | D2 | Hello 2026 {2183} | PROGRAMMING | 2000.0 | ||
| 9163 | Tree Coloring (Easy Version) | constructive algorithms dfs and similar greedy trees | Statement | D1 | Hello 2026 {2183} | PROGRAMMING | 1000.0 | ||
| 16419 | Restricted Sorting | binary search constructive algorithms greedy sortings | Statement | A | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 750.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 237 | Al Fine (Maximizing Version) | binary search data structures divide and conquer greedy trees | Statement | F1 | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 2000.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 1446 | Jerry and Tom | data structures dfs and similar games graphs greedy trees | Statement | C | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 1750.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 2014 | Little String (Hard Version) | binary search combinatorics dp greedy math number theory | Statement | D2 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 750.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 873 | Majority Wins? | dp greedy math strings | Statement | E | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 2500.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 24838 | Table with Numbers | greedy implementation | Statement | A | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 500.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 15931 | The Curse of the Frog | greedy math | Statement | B | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 1000.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 1335 | Comparable Permutations | binary search greedy interactive sortings two pointers | Statement | C | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 1750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 11204 | Sub-RBS (Easy Version) | combinatorics constructive algorithms dp greedy strings two pointers | Statement | B1 | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 11752 | All-in-one Gun | binary search greedy math | Statement | C | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 1250.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 2213 | Swap to Rearrange | constructive algorithms dfs and similar graph matchings graphs greedy strings | Statement | E | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 2250.0 | Codeforces Round 1081 (Div. 2) Editorial |