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 ... 11 12 13 14 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 18052 | Gellyfish and Baby's Breath | greedy | Statement | B | Codeforces Round 1028 (Div. 2) {2116} | PROGRAMMING | 750.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 5451 | 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 | ||
| 21751 | Cool Partition | data structures greedy | Statement | C | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 12393 | Lost Soul | greedy | Statement | E | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 38910 | False Alarm | greedy implementation | Statement | A | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 19128 | Make It Beautiful | bitmasks greedy math | Statement | C | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 29533 | Equal Subsequences | constructive algorithms greedy | Statement | A | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 500.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 1452 | Grid Coloring | constructive algorithms greedy sortings | Statement | E | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 2500.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 737 | And Constraint | bitmasks dp greedy implementation | Statement | E | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 2500.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 18951 | Line Segments | geometry greedy math | Statement | B | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 1000.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 27788 | Add or XOR | greedy math | Statement | A | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 500.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 13089 | 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 | |
| 116 | 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 | |
| 8408 | Yamakasi | binary search brute force data structures greedy | Statement | F | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 32994 | Above the Clouds | constructive algorithms greedy strings | Statement | B | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 22481 | Those Who Are With Us | greedy greedy implementation | Statement | C | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 15317 | Sponsor of Your Problems | greedy strings | Statement | E | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 21499 | Greedy Grid | constructive algorithms greedy | Statement | A | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 500.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 10481 | 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 | |
| 2935 | 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 | |
| 17625 | 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 | |
| 15444 | 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 | ||
| 22726 | Binary String Battle | constructive algorithms games greedy | Statement | D | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 35579 | Tournament | greedy | Statement | B | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 22889 | Minimise Sum | greedy | Statement | B | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 1000.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 9922 | 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 | |
| 28679 | Left and Down | greedy math number theory | Statement | B | Educational Codeforces Round 181 (Rated for Div. 2) {2125} | PROGRAMMING | Educational Codeforces Round 181 Editorial | ||
| 38667 | No Casino in the Mountains | dp greedy | Statement | B | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 27067 | I Will Definitely Make It | greedy sortings | Statement | C | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 24848 | This Is the Last Time | greedy sortings | Statement | D | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 5298 | 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 | |
| 22031 | 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 | |
| 15058 | Hamiiid, Haaamid... Hamid? | games greedy | Statement | B | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 1000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 14955 | 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 | |
| 6906 | Submedians (Easy Version) | binary search data structures dp greedy | Statement | E1 | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1750.0 | Codeforces Round #1039 — Editorial | |
| 22275 | Deque Process | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1000.0 | Codeforces Round #1039 — Editorial | |
| 21622 | Leftmost Below | greedy | Statement | C | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1250.0 | Codeforces Round #1039 — Editorial | |
| 29263 | Recycling Center | greedy sortings | Statement | A | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 500.0 | Codeforces Round #1039 — Editorial | |
| 15984 | Stay or Mirror | constructive algorithms data structures dp greedy | Statement | B | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 1000.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 19150 | Double Perspective | constructive algorithms dp dsu greedy | Statement | A | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 500.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 29200 | 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 | |
| 4855 | 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 | ||
| 929 | 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 | ||
| 31671 | Alternating Series | constructive algorithms greedy math | Statement | B | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 15028 | Arboris Contractio | graphs greedy trees | Statement | D | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 17962 | Adjacent XOR | greedy | Statement | E | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 8539 | Arithmetics Competition | binary search data structures greedy ternary search | Statement | E | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 13921 | The Cunning Seller (hard version) | binary search greedy math | Statement | C2 | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 28780 | The Cunning Seller (easy version) | greedy math | Statement | C1 | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 7887 | 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 | |
| 26323 | Villagers | greedy | Statement | B | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 1000.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 19697 | Even Larger | greedy greedy | Statement | C | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 1250.0 | 145832 | |
| 21863 | 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 | |
| 27120 | In the Dream | greedy math | Statement | A | Codeforces Round 1046 (Div. 2) {2136} | PROGRAMMING | 500.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 23978 | Maximum Even Sum | brute force greedy implementation math | Statement | C | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 5687 | Antiamuny Wants to Learn Swap | data structures greedy | Statement | B | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 1250.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 21615 | Cake Collection | greedy | Statement | B | Codeforces Round 1048 (Div. 2) {2139} | PROGRAMMING | 1000.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 26853 | Maple and Multiplication | greedy math | Statement | A | Codeforces Round 1048 (Div. 2) {2139} | PROGRAMMING | 500.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 13256 | Ultimate Value | data structures games greedy | Statement | C | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 1250.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 5239 | 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 | |
| 23210 | Shift Sort | greedy sortings strings | Statement | A | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 500.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 265 | Perfect Cut | *special dp greedy | Statement | E | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 1572 | Games | *special greedy | Statement | B | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 145 | Array Reduction | *special greedy | Statement | F | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 492 | Avoid Minimums | *special greedy math | Statement | D | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 15108 | Max Tree | dfs and similar graphs greedy | Statement | C | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 1500.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 22373 | Discounts | greedy sortings two pointers | Statement | B | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 1000.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 19485 | Maximum Cost Permutation | constructive algorithms greedy | Statement | B | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 16378 | Monocarp's String | binary search greedy strings | Statement | C | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 22724 | Deck of Cards | greedy implementation | Statement | B | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 4311 | Max Sum OR (Hard Version) | bitmasks constructive algorithms divide and conquer greedy | Statement | D2 | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1000.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 11327 | 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 | |
| 2211 | Yet Another MEX Problem | brute force constructive algorithms data structures greedy | Statement | E | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 2500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 22660 | Equal Occurrences | brute force greedy implementation | Statement | A | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 16812 | Merging the Sets | greedy implementation | Statement | B | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1000.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 12241 | Rabbits | 2-sat dp graphs greedy implementation | Statement | C | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 1500.0 | ||
| 2333 | Maximum OR Popcount | binary search bitmasks brute force data structures greedy | Statement | E | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 2500.0 | ||
| 1599 | Exchange Queries | data structures greedy | Statement | F | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 3000.0 | ||
| 9099 | Game on Array | games greedy | Statement | D | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 2000.0 | ||
| 6977 | Gravity Falls | greedy implementation sortings | Statement | F | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 26577 | Pacer | greedy math | Statement | C | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 28178 | Destruction of the Dandelion Fields | greedy sortings | Statement | D | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 29571 | MEX rose | greedy | Statement | C | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 34263 | Unconventional Pairs | greedy sortings | Statement | B | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 11119 | Incremental Stay | greedy implementation | Statement | C | Codeforces Round 1053 (Div. 2) {2151} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 3899 | 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 | |
| 14831 | 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 | |
| 12454 | Symmetrical Polygons | geometry greedy sortings | Statement | C | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 1250.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 27109 | Circle of Apple Trees | greedy | Statement | A | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 500.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 1260 | 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 | |
| 20752 | Make it Zigzag | constructive algorithms greedy | Statement | B | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 1000.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 14327 | 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 | |
| 5776 | 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 | |
| 23911 | Notelock | greedy two pointers | Statement | A | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 500.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 3135 | Mimo & Yuyu | games greedy math | Statement | E | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 2250.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 21777 | 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 | |
| 1009 | Best Time to Buy and Sell Stock | binary search data structures games greedy | Statement | E | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 2750.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 27739 | Pizza Time | brute force constructive algorithms greedy | Statement | A | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 500.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 1683 | 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 | |
| 279 | Strange Operation (Hard Version) | data structures greedy | Statement | F2 | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 3250.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 13015 | 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 | |
| 5389 | 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 | |
| 924 | 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 | |
| 11749 | 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 | |
| 18940 | 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 | |
| 8227 | 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 | |
| 14921 | Split | constructive algorithms greedy math | Statement | B | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 1250.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 12011 | Annoying Game | dp games greedy | Statement | C | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 1500.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 24307 | Suspension | greedy math | Statement | A | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 500.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 2282 | 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 | |
| 477 | Inverse Minimum Partition (Hard Version) | dp greedy | Statement | D2 | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 1750.0 | Codeforces Round 1058 Editorial | |
| 18552 | Distinct Elements | greedy math | Statement | B | Codeforces Round 1058 (Div. 2) {2160} | PROGRAMMING | 1000.0 | Codeforces Round 1058 Editorial | |
| 2921 | 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 | ||
| 13522 | Loyalty | constructive algorithms greedy sortings two pointers | Statement | C | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 1750.0 | ||
| 16122 | Round Trip | games greedy implementation math | Statement | A | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 500.0 | ||
| 43126 | Beautiful Average | brute force greedy | Statement | A | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 3053 | Beautiful Intervals | constructive algorithms greedy | Statement | F | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 9907 | Beautiful Palindromes | constructive algorithms greedy schedules | Statement | E | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 13255 | 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 | |
| 6953 | 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 | |
| 23275 | Sequence Game | brute force greedy | Statement | A | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 500.0 | Codeforces Global Round 30 Editorial | |
| 4768 | Journey | dfs and similar dsu graphs greedy | Statement | E | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 2250.0 | Codeforces Global Round 30 Editorial | |
| 6076 | Binary Wine | bitmasks greedy | Statement | C | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 1500.0 | 148452 | |
| 16817 | Cyclic Merging | brute force constructive algorithms graphs greedy trees | Statement | A | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 500.0 | 148452 | |
| 1013 | Path Split | dp graph matchings greedy | Statement | D | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 2500.0 | 148452 | |
| 37551 | Isamatdin and His Magic Wand! | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 1658 | Locate | binary search constructive algorithms greedy interactive | Statement | B | Testing Round 20 (Unrated, Communication Problems) {2168} | PROGRAMMING | Testing Round 20 Editorial (officially unofficial) | ||
| 2397 | 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 | ||
| 1141 | Points Selection | dp geometry greedy | Statement | E | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 20376 | Alice and Bob | greedy | Statement | A | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 12062 | 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 | ||
| 1773 | Almost Roman | constructive algorithms greedy implementation | Statement | D | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 20759 | Maximum Neighborhood | greedy math | Statement | A | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 15468 | Addition on a Segment | greedy math | Statement | B | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 12531 | 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 | ||
| 2493 | Sakura Adachi and Optimal Sequences | bitmasks combinatorics greedy math | Statement | G | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 12614 | Renako Amaori and XOR Game (hard version) | bitmasks games greedy | Statement | C2 | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 3827 | 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 | ||
| 20204 | Renako Amaori and XOR Game (easy version) | games greedy | Statement | C1 | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 3912 | Taiga's Carry Chains | bitmasks brute force dp greedy | Statement | D | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 1750.0 | ||
| 19047 | Niko's Tactical Cards | dp greedy | Statement | B | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 1000.0 | ||
| 13388 | Kanade's Perfect Multiples | greedy number theory | Statement | C | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 1250.0 | ||
| 328 | Secret Message | data structures greedy trees | Statement | D | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 2750.0 | Codeforces Round 1069 Editorial | |
| 15475 | Needle in a Haystack | greedy strings two pointers | Statement | A | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 500.0 | Codeforces Round 1069 Editorial | |
| 24077 | Optimal Shifts | bitmasks greedy strings | Statement | B | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 1000.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 1364 | 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 | |
| 30067 | Operations with Inversions | data structures greedy implementation | Statement | A | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 500.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 16623 | Odd Process | greedy math sortings | Statement | C | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 1500.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 26757 | Yes or Yes | brute force greedy strings | Statement | A | Good Bye 2025 {2178} | PROGRAMMING | 500.0 | ||
| 7052 | Xmas or Hysteria | constructive algorithms graphs greedy implementation | Statement | D | Good Bye 2025 {2178} | PROGRAMMING | 1750.0 | ||
| 16961 | First or Second | dp greedy implementation | Statement | C | Good Bye 2025 {2178} | PROGRAMMING | 1250.0 | ||
| 22628 | Impost or Sus | greedy implementation strings | Statement | B | Good Bye 2025 {2178} | PROGRAMMING | 750.0 | ||
| 14293 | Blackslex and Penguin Civilization | bitmasks constructive algorithms greedy math | Statement | D | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 29367 | Blackslex and Showering | greedy implementation | Statement | B | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 6799 | 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 | |
| 4423 | Insolvable Disks | greedy math | Statement | D | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 1750.0 | Codeforces Global Round 31 | |
| 25324 | Ashmal | greedy strings | Statement | B | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 750.0 | Codeforces Global Round 31 | |
| 167 | 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 | ||
| 6591 | Battle of Arrays | brute force data structures games greedy | Statement | B | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 9595 | Christmas Tree Decoration | combinatorics dp greedy math | Statement | D | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 5990 | 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 | ||
| 26455 | New Year String | greedy implementation strings | Statement | A | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 11360 | War Strategy | binary search greedy math two pointers | Statement | C | Hello 2026 {2183} | PROGRAMMING | 1500.0 | ||
| 2622 | Tree Coloring (Hard Version) | constructive algorithms data structures dfs and similar greedy implementation trees | Statement | D2 | Hello 2026 {2183} | PROGRAMMING | 2000.0 | ||
| 9480 | Tree Coloring (Easy Version) | constructive algorithms dfs and similar greedy trees | Statement | D1 | Hello 2026 {2183} | PROGRAMMING | 1000.0 | ||
| 16833 | Yet Another MEX Problem | constructive algorithms greedy | Statement | B | Hello 2026 {2183} | PROGRAMMING | 1000.0 | ||
| 782 | BattleCows 2 | binary search brute force data structures greedy | Statement | H | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 43829 | Prefix Max | greedy | Statement | B | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 16951 | 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 | |
| 270 | 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 | |
| 5722 | Shortest Statement Ever | bitmasks constructive algorithms dp greedy | Statement | B | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 1250.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 1514 | 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 | |
| 121 | Many Cartesian Trees | greedy | Statement | G | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 3000.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 22495 | Seats | greedy | Statement | B | Codeforces Round 1077 (Div. 2) {2188} | PROGRAMMING | 1000.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 2100 | 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 | |
| 909 | Majority Wins? | dp greedy math strings | Statement | E | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 2500.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 25236 | Table with Numbers | greedy implementation | Statement | A | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 500.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 16456 | The Curse of the Frog | greedy math | Statement | B | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 1000.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 1377 | 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 | |
| 11704 | 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 | |
| 18529 | Sorting Game | games greedy | Statement | A | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 500.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 12406 | 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 | |
| 2322 | 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 | |
| 1168 | Remove the Grail Tree | dfs and similar dp greedy trees | Statement | H | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 9481 | Pizza Delivery | dp greedy | Statement | F | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 31537 | Reverse a Permutation | greedy | Statement | B | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 30740 | Replace and Sum | greedy | Statement | C | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 8825 | Table Cut | constructive algorithms greedy | Statement | D | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 2000.0 | Codeforces Round #1078 Editorial | |
| 2923 | The Turtle Strikes Back | dp graphs greedy | Statement | E | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 2500.0 | Codeforces Round #1078 Editorial | |
| 20223 | Offshores | greedy implementation math | Statement | B | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1000.0 | Codeforces Round #1078 Editorial | |
| 22430 | Dice Roll Sequence | dp greedy | Statement | C | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 317 | Fuzzy Concatenation (Easy Version) | binary search bitmasks brute force data structures greedy string suffix structures | Statement | E1 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 2000.0 | Tutorial | |
| 246 | Fuzzy Concatenation (Hard version) | binary search data structures dp greedy string suffix structures | Statement | E2 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 1000.0 | Tutorial | |
| 1090 | Double Bracket Sequence | data structures dp greedy sortings | Statement | D | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 2250.0 | Tutorial | |
| 192 | Supersequence | *special binary search greedy | Statement | E | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 563 | Minesweeper | *special constructive algorithms greedy | Statement | C | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 1240 | Two Towers | *special greedy math | Statement | B | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 24713 | Specialty String | brute force greedy strings | Statement | C | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 3335 | Mooclear Reactor 2 | data structures greedy implementation sortings | Statement | F | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 9505 | Divisive Battle | games greedy math number theory | Statement | E | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 31739 | Eating Game | greedy | Statement | A | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 28428 | Deletion Sort | greedy sortings | Statement | B | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 13726 | Portal | greedy sortings | Statement | D | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 5540 | Recollect Numbers | constructive algorithms | Statement | B | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 1250.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 871 | Binary Not Search and Queries | data structures greedy implementation | Statement | D | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 2250.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 12778 | ABAB Construction | greedy implementation | Statement | B | Codeforces Round 1082 (Div. 2) {2202} | PROGRAMMING | 1250.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 8138 | Test Generator | binary search bitmasks greedy math | Statement | C | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 6233 | Divisibility Game | brute force games greedy number theory | Statement | D | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 16637 | Beautiful Numbers | dp greedy math | Statement | B | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 1378 | Sum of Fractions | binary search combinatorics greedy math two pointers | Statement | F | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 21504 | Right Maximum | greedy | Statement | B | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 5771 | Simons and Beating Peaks | data structures divide and conquer dp greedy implementation trees | Statement | D | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 1750.0 | Tutorial | |
| 8885 | Simons and Posting Blogs | greedy sortings | Statement | C | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 1250.0 | Tutorial | |
| 62 | Bowser's Castle (Easy Version) | binary search constructive algorithms divide and conquer greedy interactive trees | Statement | H1 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 3250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 1850 | N-MEX (Constructive Version) | constructive algorithms greedy | Statement | E1 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1750.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 331 | Hanabi | data structures dp flows graph matchings graphs greedy | Statement | F | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 3250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 6710 | One Night At Freddy's | games greedy sortings | Statement | B | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 15143 | 1-1 | greedy strings | Statement | A | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 750.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 4887 | Tree Orientation (Easy Version) | constructive algorithms dfs and similar dsu graphs greedy trees | Statement | D1 | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 2127 | Tree Orientation (Hard Version) | data structures dfs and similar dsu graphs greedy matrices sortings trees | Statement | D2 | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 12898 | Stamina and Tasks | dp greedy math | Statement | C | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 15275 | Cyclists | games greedy implementation sortings | Statement | B | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1000.0 | Tutorial | |
| 5990 | Ghostfires | constructive algorithms greedy | Statement | D | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 1750.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 477 | Dynamic Values And Maximum Sum | data structures greedy implementation trees | Statement | F | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 3000.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 21898 | Array | geometry greedy | Statement | B | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 750.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 23654 | Flip Flops | greedy | Statement | A | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 500.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 277 | A Simple Problem | binary search greedy math trees | Statement | F | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 3500.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 24989 | A Simple Sequence | constructive algorithms dp greedy number theory | Statement | A | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 500.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 2445 | A Simple GCD Problem (Hard Version) | dp greedy number theory | Statement | C2 | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 1000.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 19907 | Simply Sitting on Chairs | greedy | Statement | B | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 1000.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 14863 | A Simple GCD Problem (Easy Version) | greedy number theory | Statement | C1 | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 1250.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 10640 | Equal Multisets (Easy Version) | binary search greedy | Statement | C1 | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 1250.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 348 | Rational Bubble Sort | geometry greedy | Statement | G | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 3250.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 4260 | Equal Multisets (Hard Version) | greedy | Statement | C2 | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 1000.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 13184 | Mickey Mouse Constructive | greedy math | Statement | B | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 1250.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 174 | EXPloration, EXPloitation, and Gain Some EXPerience! | bitmasks brute force dp greedy implementation | Statement | D | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 2750.0 | 152930 | |
| 231 | Star Map | constructive algorithms data structures geometry greedy | Statement | E | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 3000.0 | 152930 | |
| 3943 | Interval Mod | constructive algorithms dp greedy math | Statement | A | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 750.0 | 152930 | |
| 6391 | Course Wishes | greedy | Statement | A | Codeforces Round 1092 (Unrated, Div. 2, Based on THUPC 2026 — Finals) {2216} | PROGRAMMING | 500.0 | 152930 | |
| 5522 | THU Packing Puzzle | greedy | Statement | B | Codeforces Round 1092 (Unrated, Div. 2, Based on THUPC 2026 — Finals) {2216} | PROGRAMMING | 1000.0 | 152930 | |
| 2539 | Definitely Larger | binary search constructive algorithms data structures greedy | Statement | E | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2000.0 | Tutorial | |
| 921 | Interval Game | bitmasks combinatorics dp games greedy math probabilities | Statement | F | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2750.0 | Tutorial | |
| 18776 | Flip the Bit (Easy Version) | greedy implementation | Statement | B | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 1000.0 | Tutorial | |
| 3868 | Flip the Bit (Hard Version) | greedy implementation math | Statement | D | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 1500.0 | Tutorial | |
| 31641 | The 67th Permutation Problem | constructive algorithms greedy math | Statement | C | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 41360 | The 67th 6-7 Integer Problem | greedy math | Statement | B | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 22204 | The 67th OEIS Problem | greedy math number theory | Statement | D | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 1494 | Coloring a Red Black Tree | dp greedy probabilities trees | Statement | C | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 1750.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 15078 | OIE Excursion | greedy | Statement | B | Codeforces Round 1093 (Div. 2) {2220} | PROGRAMMING | 1000.0 | Tutorial | |
| 21537 | Blocked | greedy sortings | Statement | A | Codeforces Round 1093 (Div. 2) {2220} | PROGRAMMING | 500.0 | Tutorial |