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 ... 10 11 12Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 30395 | Fashionable Array | implementation sortings | Statement | A | Codeforces Round 1026 (Div. 2) {2110} | PROGRAMMING | 500.0 | Codeforces Round 1026 (Div. 2) Editorial | |
| 5541 | 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 | ||
| 18351 | Fibonacci Cubes | brute force dp implementation math | Statement | B | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 20947 | Energy Crystals | greedy implementation math | Statement | A | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 15097 | Come a Little Closer | brute force greedy implementation math | Statement | D | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 38915 | False Alarm | greedy implementation | Statement | A | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 2586 | Red Light, Green Light (Hard version) | binary search dfs and similar dp dsu graphs implementation number theory | Statement | D2 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 8686 | Red Light, Green Light (Easy version) | brute force dfs and similar dp graphs implementation | Statement | D1 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1250.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 | |
| 2334 | Ice Baby | binary search brute force data structures dp implementation sortings | Statement | H | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 22490 | Those Who Are With Us | greedy greedy implementation | Statement | C | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 18813 | 1709 | implementation sortings | Statement | D | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 28704 | Difficult Contest | constructive algorithms implementation sortings strings | Statement | A | Educational Codeforces Round 181 (Rated for Div. 2) {2125} | PROGRAMMING | Educational Codeforces Round 181 Editorial | ||
| 53881 | Only One Digit | implementation math | Statement | A | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 147 | Inter Active (Hard Version) | binary search bitmasks constructive algorithms graphs implementation interactive math probabilities | Statement | G2 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2750.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 2691 | 23 Rises Again | brute force data structures dfs and similar dp flows graphs implementation probabilities trees | Statement | H | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 4000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 9257 | From 1 to Infinity | binary search dp implementation math | Statement | D | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 45452 | Homework | brute force implementation strings | Statement | A | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 32051 | Redstone? | brute force implementation math | Statement | A | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 500.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 27563 | Painting With Two Colors | constructive algorithms implementation math | Statement | A | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 500.0 | 145832 | |
| 23983 | Maximum Even Sum | brute force greedy implementation math | Statement | C | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 10808 | Mexification | implementation math | Statement | E | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 685 | Antiamuny and Slider Movement | binary search brute force combinatorics implementation math | Statement | D | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 2500.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 1698 | Furniture Store | *special implementation | Statement | A | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 1576 | Looking at Towers (difficult version) | combinatorics data structures dp implementation | Statement | E2 | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 2821 | Looking at Towers (easy version) | combinatorics dp implementation | Statement | E1 | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 22732 | Deck of Cards | greedy implementation | Statement | B | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 22662 | Equal Occurrences | brute force greedy implementation | Statement | A | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 16816 | Merging the Sets | greedy implementation | Statement | B | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1000.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 12246 | Rabbits | 2-sat dp graphs greedy implementation | Statement | C | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 1500.0 | ||
| 6979 | Gravity Falls | greedy implementation sortings | Statement | F | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 1298 | Attraction Theory | combinatorics dp implementation math | Statement | D | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 14229 | Incremental Path | data structures implementation | Statement | A | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 11124 | Incremental Stay | greedy implementation | Statement | C | Codeforces Round 1053 (Div. 2) {2151} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 3841 | Query Jungle | data structures data structures implementation math math trees | Statement | G | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 4000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 24896 | Increase or Smash | implementation | Statement | A | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 500.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 6674 | Not Alone | dp implementation | Statement | D | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 1750.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 14333 | 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 | |
| 11061 | The Ancient Wizards' Capes | brute force dp implementation | Statement | C | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 1750.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 26169 | El fucho | implementation math | Statement | A | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 500.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 21782 | 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 | |
| 1684 | 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 | |
| 5390 | 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 | |
| 18944 | 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 | |
| 15368 | Expansion Plan 2 | implementation math | Statement | B | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 1000.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 3480 | Palindrome Flipping | brute force constructive algorithms implementation strings | Statement | D | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 2000.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 9555 | MAD Interactive Problem | constructive algorithms implementation interactive | Statement | A | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 750.0 | Codeforces Round 1058 Editorial | |
| 4122 | Rectangles | data structures dsu implementation two pointers | Statement | B | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 1500.0 | Codeforces Round 1058 Editorial | |
| 2923 | 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 | ||
| 5621 | Make Connected | brute force dsu implementation | Statement | B | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 1000.0 | ||
| 16128 | Round Trip | games greedy implementation math | Statement | A | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 500.0 | ||
| 6957 | 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 | |
| 9735 | khba Loves to Sleep! | binary search data structures geometry implementation math | Statement | E | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 37562 | Isamatdin and His Magic Wand! | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 9112 | Removal of a Sequence (Easy Version) | binary search bitmasks geometry implementation math number theory | Statement | D1 | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 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 | ||
| 17027 | Drifting Away | implementation implementation implementation implementation implementation | Statement | B | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 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 | ||
| 7773 | Rae Taylor and Trees (hard version) | binary search constructive algorithms data structures dp dsu implementation trees | Statement | F | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 12538 | 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 | ||
| 6517 | Number Maze | constructive algorithms implementation | Statement | E | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | |||
| 15425 | ASCII Art Contest | implementation | Statement | A | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | |||
| 24672 | Sleeping Through Classes | implementation | Statement | A | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 500.0 | ||
| 19599 | Little Fairy's Painting | implementation | Statement | A | Codeforces Round 1069 (Div. 2) {2175} | PROGRAMMING | 500.0 | Codeforces Round 1069 Editorial | |
| 1365 | 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 | |
| 30075 | Operations with Inversions | data structures greedy implementation | Statement | A | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 500.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 7052 | Xmas or Hysteria | constructive algorithms graphs greedy implementation | Statement | D | Good Bye 2025 {2178} | PROGRAMMING | 1750.0 | ||
| 16968 | First or Second | dp greedy implementation | Statement | C | Good Bye 2025 {2178} | PROGRAMMING | 1250.0 | ||
| 22630 | Impost or Sus | greedy implementation strings | Statement | B | Good Bye 2025 {2178} | PROGRAMMING | 750.0 | ||
| 29374 | Blackslex and Showering | greedy implementation | Statement | B | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 24412 | New Year Cake | brute force implementation | Statement | B | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 5991 | 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 | ||
| 26458 | New Year String | greedy implementation strings | Statement | A | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 2623 | Tree Coloring (Hard Version) | constructive algorithms data structures dfs and similar greedy implementation trees | Statement | D2 | Hello 2026 {2183} | PROGRAMMING | 2000.0 | ||
| 11197 | The Robotic Rush | binary search implementation two pointers | Statement | E | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 5595 | BattleCows | data structures divide and conquer implementation | Statement | F | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 3745 | Mixing MEXes | data structures implementation math | Statement | G | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 22233 | OutOfMemoryError | data structures implementation math two pointers | Statement | D | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 31185 | Shifted MEX | implementation sortings | Statement | C | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 263 | Zhora the Vacuum Cleaner | dp implementation sortings trees | Statement | F | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 3250.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 25241 | Table with Numbers | greedy implementation | Statement | A | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 500.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 3426 | Sub-RBS (Hard Version) | combinatorics dp games implementation matrices strings | Statement | B2 | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 20231 | Offshores | greedy implementation math | Statement | B | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1000.0 | Codeforces Round #1078 Editorial | |
| 522 | Codeforces Heuristic Contest 001 | brute force constructive algorithms geometry implementation | Statement | H | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 27094 | Heapify 1 | implementation | Statement | B | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 17166 | Array and Permutation | implementation sortings two pointers | Statement | B | Codeforces Round 1079 (Div. 2) {2197} | PROGRAMMING | 1000.0 | ||
| 3336 | Mooclear Reactor 2 | data structures greedy implementation sortings | Statement | F | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 872 | 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 | |
| 12785 | ABAB Construction | greedy implementation | Statement | B | Codeforces Round 1082 (Div. 2) {2202} | PROGRAMMING | 1250.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 5775 | 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 | |
| 17756 | Simons and Cakes for Success | implementation math | Statement | B | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 750.0 | Tutorial | |
| 6552 | Where's My Water? | data structures divide and conquer implementation | Statement | C | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1500.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 15278 | Cyclists | games greedy implementation sortings | Statement | B | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1000.0 | Tutorial | |
| 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 | |
| 17963 | Antimedian Deletion | implementation math | Statement | A | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 500.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 1332 | RReeppeettiittiioonn | binary search brute force implementation math number theory | Statement | B | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 1250.0 | 152930 | |
| 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 | |
| 18785 | Flip the Bit (Easy Version) | greedy implementation | Statement | B | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 1000.0 | Tutorial | |
| 3869 | Flip the Bit (Hard Version) | greedy implementation math | Statement | D | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 1500.0 | Tutorial | |
| 43620 | The 67th Integer Problem | brute force games implementation math | Statement | A | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 9359 | The 67th Tree Problem | constructive algorithms implementation trees | Statement | F | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 4736 | The 67th Iteration of "Counting is Fun" | dfs and similar implementation math | Statement | G | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 748 | Building Tree | divide and conquer dsu graphs implementation | Statement | F | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 3000.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 14591 | Palindromex | binary search brute force constructive algorithms data structures greedy implementation two pointers | Statement | D | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 32261 | Koshary | implementation math | Statement | A | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 8274 | Cirno and Number (Easy Version) | binary search brute force dp implementation | Statement | C1 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 1500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 326 | Amanojaku and Sequence (Hard Version) | combinatorics data structures implementation math | Statement | E2 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 1500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 2936 | Sanae, Cross and Color | data structures implementation | Statement | D | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 2500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 17379 | Remilia Plays Soku | games implementation | Statement | B | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 750.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 22169 | Marisa Steals Reimu's Takeout | greedy implementation | Statement | A | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 6393 | Cirno and Number (Hard Version) | greedy implementation | Statement | C2 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 1000.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 1138 | Load Unbalancing | binary search bitmasks dp greedy implementation | Statement | F | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 2500.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 1532 | Minimum Influence | binary search data structures geometry greedy implementation math sortings two pointers | Statement | E | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 17550 | Digit String | greedy implementation math | Statement | B | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 23794 | Optimal Purchase | implementation math | Statement | A | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 11839 | Arrange the Numbers in a Circle | implementation math | Statement | C | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 3893 | Maximum Prefix Sums | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2000.0 | ||
| 12193 | Chipmunk Theo and Equality | implementation | Statement | C | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 1250.0 | ||
| 2416 | Vessels, Heights and Two Versions (Hard Version) | data structures dfs and similar dsu greedy implementation trees | Statement | F | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 1750.0 | Tutorial | |
| 12457 | Vessels, Heights and Two Versions (Easy Version) | dfs and similar dsu greedy implementation two pointers | Statement | C | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 1250.0 | Tutorial | |
| 435 | Criterion in Burlandia | brute force data structures implementation | Statement | G | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 227 | Colorful Works | dp fft games implementation | Statement | F | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 3500.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 1547 | Product of Closures | bitmasks brute force constructive algorithms dp greedy implementation math | Statement | E | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 11508 | Unstable Elements | brute force data structures implementation sortings two pointers | Statement | C | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 17648 | Predominant Frequency Division | data structures greedy implementation math | Statement | B | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 2129 | Construct an Array (Hard Version) | 2-sat constructive algorithms dfs and similar implementation | Statement | D2 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 1000.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 3738 | Construct an Array (Easy Version) | dfs and similar implementation | Statement | D1 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 1500.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 10000 | Rank Subsequence | brute force greedy implementation | Statement | A | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 750.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 4278 | Permutation Cuts | combinatorics implementation math | Statement | B | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 1250.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 1681 | Double-Rift Dial | data structures dfs and similar dsu implementation two pointers | Statement | C | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 1750.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 222 | String (Easy Version) | divide and conquer implementation strings | Statement | E1 | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 2250.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 185 | String (Hard Version) | divide and conquer implementation strings | Statement | E2 | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 1750.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 18458 | Threshold Movement | implementation math | Statement | A | Codeforces Round 1112 (Div. 2) {2250} | PROGRAMMING | 500.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 3193 | Hypercarp and Interdimensional Jumps | binary search brute force geometry greedy implementation math | Statement | D | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 33798 | Riptide | implementation sortings | Statement | A | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 23706 | Evanescent | implementation strings two pointers | Statement | B | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 12749 | Hot Potatoes at the Fairy Warehouse | games implementation | Statement | A | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 500.0 | 155840 | |
| 15756 | Domino Tiles | implementation math | Statement | B | Codeforces Round 1116 (Div. 2) {2256} | PROGRAMMING | 1000.0 | 155840 | |
| 1740 | Busy Beaver | brute force divide and conquer dp greedy implementation sortings | Statement | E | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 2250.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 3614 | Carrot Chopdown (Hard Version) | brute force implementation math | Statement | B2 | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 1000.0 | Codeforces Round 1118 (Div. 2) Editorial | |
| 293 | Magic Tiles | dp implementation | Statement | D | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 2000.0 | Codeforces Round 1118 (Div. 2) Editorial |