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 ... 12 13 14Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 9177 | Artistic Balance Tree | greedy sortings | Statement | B | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 1250.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 8203 | Zhily and Bracket Swapping | constructive algorithms greedy | Statement | A | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 375 | Zhily and Cycle | graphs greedy | Statement | D | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 2500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 12219 | Zhily and Array Operating | constructive algorithms greedy | Statement | A | Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026) {2224} | PROGRAMMING | 500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 9452 | Zhily and Mex and Max | constructive algorithms greedy math sortings | Statement | B | Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026) {2224} | PROGRAMMING | 750.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 784 | String Cutting | binary search brute force greedy hashing string suffix structures strings | Statement | F | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 17726 | Alternating String | brute force greedy | Statement | B | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 14451 | Red-Black Pairs | dp greedy | Statement | C | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 8373 | 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 | |
| 3304 | Reserved Reversals | constructive algorithms dp greedy | Statement | D | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2000.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 | |
| 15867 | Disturbing Distribution | greedy math | Statement | A | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 15112 | Everything Everywhere | greedy math number theory | Statement | B | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 750.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 14574 | 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 | ||
| 10098 | 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 | ||
| 4598 | 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 | ||
| 28446 | Party Monster | greedy | Statement | B | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 22158 | Marisa Steals Reimu's Takeout | greedy implementation | Statement | A | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 6382 | Cirno and Number (Hard Version) | greedy implementation | Statement | C2 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 1000.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 1137 | 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 | |
| 5378 | Me When Median Problem | binary search greedy | Statement | D | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 2000.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 18880 | Slimes on a Line | brute force greedy math | Statement | A | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 500.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 18735 | Absolute Cinema | greedy math | Statement | B | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 750.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 1529 | 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 | ||
| 5445 | Good Schedule | dp graphs greedy two pointers | Statement | D | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 17535 | Digit String | greedy implementation math | Statement | B | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 3887 | Maximum Prefix Sums | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2000.0 | ||
| 825 | Quadratic Jumps | constructive algorithms greedy math number theory | Statement | F | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2750.0 | ||
| 12347 | Seating Arrangement (Easy Version) | binary search dp greedy ternary search two pointers | Statement | C1 | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 750.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 21354 | Cake Leveling | binary search greedy math | Statement | B | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 1000.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 8910 | Seating Arrangement (Hard Version) | binary search greedy ternary search two pointers | Statement | C2 | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 1000.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 2789 | Magical Tiered Cake | constructive algorithms dfs and similar dp greedy | Statement | D | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 2000.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 313 | The Cake Is a Lie | greedy math number theory | Statement | F | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 3250.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 23604 | Convergence | greedy sortings | Statement | A | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 500.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 9710 | Cost of a Bracket Sequence | brute force dp greedy | Statement | C | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 2408 | 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 | |
| 12444 | 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 | |
| 21465 | Omsk Programmers | brute force greedy math | Statement | C | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 35259 | Games on the Train | greedy math | Statement | A | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 15109 | Annoying the Ghost | brute force greedy | Statement | B | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 1000.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 2113 | Permutation Commutation | constructive algorithms graphs greedy | Statement | E | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 2250.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 6503 | Fullmetal Bitchemist | constructive algorithms greedy math | Statement | D | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 1750.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 986 | 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 | |
| 22122 | Destroying Towers | greedy | Statement | A | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 500.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 16178 | Duck Surplus | greedy | Statement | C | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 1250.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 467 | Infinite Work | combinatorics graphs greedy math | Statement | F | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 2750.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 1977 | Cake Trial | dp greedy two pointers | Statement | E | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 2250.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 19964 | Another Puzzle from Papyrus | greedy math sortings | Statement | A | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 500.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 9328 | Nim Game Is XOR Game | bitmasks constructive algorithms games greedy math | Statement | A | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 750.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 7203 | Decidophobia | greedy sortings two pointers | Statement | B | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 1000.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 17028 | Another Popcount Problem | greedy | Statement | A | Codeforces Round 1105 (Div. 2) {2240} | PROGRAMMING | 500.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 970 | Summmon | binary search data structures greedy math number theory | Statement | G | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 4936 | A Bit Odd | data structures games greedy math | Statement | F | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 16543 | An Alternative Way | dp greedy math | Statement | D | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 21645 | RemovevomeR | greedy | Statement | C | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 34571 | Divide and Conquer | greedy math number theory | Statement | A | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 1540 | 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 | ||
| 17626 | Predominant Frequency Division | data structures greedy implementation math | Statement | B | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 7767 | Two Digit Strings | dp greedy strings | Statement | D | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 13089 | Yaroslav and Productivity | constructive algorithms dp greedy math number theory | Statement | D | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 17326 | Stepan and Permutation | constructive algorithms dsu greedy math number theory sortings | Statement | C | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 29576 | Iskander and Drawings | dp games greedy strings | Statement | A | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 4251 | Anya Loves Trees! | dp greedy trees | Statement | F | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 24225 | Nikita and Books | greedy math sortings | Statement | B | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 13722 | Who Watches the Watchpig? | greedy | Statement | A | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 500.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 10661 | Delete and Concatenate | greedy | Statement | B | 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 | |
| 3194 | diss_quack and Array Game | bitmasks brute force games greedy | Statement | D | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 1750.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 6558 | XOR Sorting (Easy Version) | binary search bitmasks divide and conquer greedy | Statement | D1 | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 1500.0 | ||
| 2376 | XOR Sorting (Hard Version) | bitmasks data structures greedy | Statement | D2 | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 1250.0 | ||
| 12832 | Inversion of a Subsequence | greedy | Statement | C | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 1250.0 | ||
| 1900 | Excuse for Breaks | binary search greedy math | Statement | E | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 2500.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 6903 | Good Pair Queries | constructive algorithms greedy math | Statement | D | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 1750.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 9574 | Maximize the Score | dp greedy | Statement | C | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 1500.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 19789 | You Delete, I Delete | greedy | Statement | A | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 500.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 14221 | Merge to Match | greedy sortings | Statement | B | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 1250.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 9974 | 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 | |
| 9149 | Risky Tower | binary search brute force data structures greedy sortings | Statement | C | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 1250.0 | 155741 | |
| 402 | Spectral Components | dfs and similar dp greedy sortings trees | Statement | F | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 2750.0 | 155741 | |
| 17762 | Boss Fight | greedy | Statement | A | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 500.0 | 155741 | |
| 12197 | Always Changing | greedy math strings | Statement | B | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 1000.0 | 155741 | |
| 4910 | Array Replacement | greedy sortings | Statement | D | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 1750.0 | 155741 | |
| 3159 | 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 | ||
| 7329 | Sum of Distinct Values in a Matrix | greedy | Statement | C | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 7083 | Chronostasis | binary search data structures greedy | Statement | E | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 1048 | Nightcrawler | data structures dfs and similar dp greedy sortings trees | Statement | G | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 18535 | Marenol (easy version) | greedy | Statement | C1 | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 13117 | Marenol (hard version) | greedy sortings | Statement | C2 | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 1377 | How Long Until Nothing Remains? | binary search bitmasks greedy | Statement | D | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1750.0 | 155840 | |
| 1461 | Even If the World Turns | communication greedy interactive math number theory | Statement | C | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1750.0 | 155840 | |
| 1694 | 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 |