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 3Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 815 | Serval and Colorful Array (Easy Version) | data structures greedy | Statement | F1 | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 2000.0 | Codeforces Round #1011 (Div. 2) Editorial | |
| 539 | Serval and Colorful Array (Hard Version) | data structures greedy | Statement | F2 | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 1000.0 | Codeforces Round #1011 (Div. 2) Editorial | |
| 3344 | 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 | |
| 1348 | 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 | |
| 1651 | 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 | ||
| 4054 | 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 | ||
| 4921 | 23 Kingdom | binary search data structures greedy ternary search two pointers | Statement | C | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 2000.0 | 142788 | |
| 3173 | Kia Bakes a Cake | data structures dp graphs greedy | Statement | E | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 3250.0 | 142788 | |
| 8964 | Quartet Swapping | data structures greedy sortings | Statement | B | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 1250.0 | 142788 | |
| 8415 | 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 | ||
| 21438 | Move to the End | brute force data structures dp greedy | Statement | B | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 577 | Cycling (Hard Version) | binary search data structures dp geometry greedy | Statement | F2 | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 2500.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 15302 | Neo's Escape | data structures dsu graphs greedy implementation | Statement | C | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 1500.0 | Codeforces Round 1022 Editorial | |
| 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 | ||
| 12449 | 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 | ||
| 2977 | Cheater | binary search constructive algorithms data structures greedy | Statement | D | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 1750.0 | Codeforces Round #1031 Editorial | |
| 21754 | Cool Partition | data structures greedy | Statement | C | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 8410 | Yamakasi | binary search brute force data structures greedy | Statement | F | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 15446 | 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 | ||
| 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 | |
| 6907 | Submedians (Easy Version) | binary search data structures dp greedy | Statement | E1 | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1750.0 | Codeforces Round #1039 — Editorial | |
| 15989 | 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 | |
| 4856 | 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 | ||
| 8551 | Arithmetics Competition | binary search data structures greedy ternary search | Statement | E | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (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 | |
| 13259 | Ultimate Value | data structures games greedy | Statement | C | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 1250.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 2212 | 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 | |
| 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 | ||
| 3900 | 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 | |
| 14837 | 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | ||
| 13258 | 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 | |
| 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 | ||
| 328 | Secret Message | data structures greedy trees | Statement | D | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 2750.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 | |
| 6599 | 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 | ||
| 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 | ||
| 2623 | Tree Coloring (Hard Version) | constructive algorithms data structures dfs and similar greedy implementation trees | Statement | D2 | Hello 2026 {2183} | PROGRAMMING | 2000.0 | ||
| 784 | BattleCows 2 | binary search brute force data structures greedy | Statement | H | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 2129 | 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 | |
| 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 | |
| 232 | 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 | |
| 2540 | Definitely Larger | binary search constructive algorithms data structures greedy | Statement | E | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2000.0 | Tutorial | |
| 8382 | Mental Monumental (Easy Version) | binary search data structures greedy math two pointers | Statement | C | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 1500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 1088 | Mental Monumental (Hard Version) | data structures greedy math | Statement | E | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2500.0 | Codeforces Round 1095 (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 | ||
| 10108 | It All Went Sideways | binary search data structures dp greedy | Statement | E | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 4607 | It Just Keeps Going Sideways | data structures dp greedy math | Statement | F | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — 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 | ||
| 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 | |
| 988 | Paint the Array | data structures dp greedy | Statement | F | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 2500.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 145 | Slime and Queries | data structures greedy trees | Statement | H | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 3500.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 971 | Summmon | binary search data structures greedy math number theory | Statement | G | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 4952 | A Bit Odd | data structures games greedy math | Statement | F | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 17648 | Predominant Frequency Division | data structures greedy implementation math | Statement | B | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 2393 | XOR Sorting (Hard Version) | bitmasks data structures greedy | Statement | D2 | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 1250.0 | ||
| 9198 | Risky Tower | binary search brute force data structures greedy sortings | Statement | C | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 1250.0 | 155741 | |
| 7138 | Chronostasis | binary search data structures greedy | Statement | E | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 1066 | Nightcrawler | data structures dfs and similar dp greedy sortings trees | Statement | G | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial |