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 ... 13 14 15Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 7628 | 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 | |
| 103 | Zhily and Colorful Strings | divide and conquer fft math | Statement | F | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 4500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 8760 | 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 | |
| 8160 | Exceptional Segments | bitmasks brute force math | Statement | D | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 21391 | A Number Between Two Others | math | Statement | A | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 7947 | 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 | |
| 997 | 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 | |
| 15237 | Disturbing Distribution | greedy math | Statement | A | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 14297 | Everything Everywhere | greedy math number theory | Statement | B | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 750.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 274 | Inversion Invasion | math number theory | Statement | F | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 2158 | Drowning | binary search data structures math | Statement | G | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 22461 | Snowfall | constructive algorithms math | Statement | C | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 4311 | 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 | ||
| 30605 | Koshary | implementation math | Statement | A | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 300 | 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 | |
| 599 | Amanojaku and Sequence (Easy Version) | combinatorics math | Statement | E1 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 2000.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 18433 | 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 | |
| 18174 | 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 | |
| 1436 | 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 | ||
| 16722 | Digit String | greedy implementation math | Statement | B | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 22734 | Optimal Purchase | implementation math | Statement | A | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 11222 | 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 | ||
| 770 | Quadratic Jumps | constructive algorithms greedy math number theory | Statement | F | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2750.0 | ||
| 20158 | Cake Leveling | binary search greedy math | Statement | B | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 1000.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 290 | 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 | |
| 21978 | AI Project Development | brute force math | Statement | A | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | |||
| 373 | Shortest GCD Paths | dp graphs math number theory shortest paths | Statement | F | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | |||
| 8437 | XOR, Expression and Two Binary Numbers | bitmasks constructive algorithms math number theory | Statement | D | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 1750.0 | ||
| 21432 | Palindrome, Twelve and Two Terms | constructive algorithms math | Statement | B | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 750.0 | ||
| 23474 | Euclid, Sequence and Two Numbers | math number theory sortings | Statement | A | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 500.0 | ||
| 12138 | Brand New Tatar TV Show | binary search constructive algorithms dp games math | Statement | D | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | |||
| 20270 | Omsk Programmers | brute force greedy math | Statement | C | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 920 | Elections in Saransk (hard version) | combinatorics dp fft math number theory | Statement | F2 | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | |||
| 33134 | Games on the Train | greedy math | Statement | A | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | |||
| 27384 | Tatar TV Show | math strings | Statement | B | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | |||
| 408 | Send GCDs | communication interactive math | Statement | G | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 2750.0 | ||
| 5984 | Fullmetal Bitchemist | constructive algorithms greedy math | Statement | D | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 1750.0 | ||
| 379 | Infinite Work | combinatorics graphs greedy math | Statement | F | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 2750.0 | ||
| 18123 | Another Puzzle from Papyrus | greedy math sortings | Statement | A | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 500.0 | ||
| 14617 | Crimson Triples | math number theory | Statement | B | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 750.0 | ||
| 6898 | Storming Arasaka | math number theory | Statement | D | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 1500.0 | ||
| 1155 | Revival | binary search constructive algorithms data structures math two pointers | Statement | C | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 1500.0 | ||
| 8312 | Nim Game Is XOR Game | bitmasks constructive algorithms games greedy math | Statement | A | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 750.0 | ||
| 773 | Summmon | binary search data structures greedy math number theory | Statement | G | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 5378 | Fair and Square | combinatorics dp graphs math number theory trees | Statement | E | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 18901 | Good times Good times | constructive algorithms math | Statement | B | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 4102 | A Bit Odd | data structures games greedy math | Statement | F | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 14687 | An Alternative Way | dp greedy math | Statement | D | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 30299 | Divide and Conquer | greedy math number theory | Statement | A | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 1221 | Product of Closures | bitmasks brute force constructive algorithms dp greedy implementation math | Statement | E | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | |||
| 15190 | Predominant Frequency Division | data structures greedy implementation math | Statement | B | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | |||
| 10407 | Yaroslav and Productivity | constructive algorithms dp greedy math number theory | Statement | D | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | |||
| 14304 | Stepan and Permutation | constructive algorithms dsu greedy math number theory sortings | Statement | C | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | |||
| 19508 | Nikita and Books | greedy math sortings | Statement | B | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | |||
| 5189 | MEXOR | bitmasks constructive algorithms math | Statement | C | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 1250.0 | ||
| 7348 | 0mar and Alternating Sums | combinatorics dp math | Statement | C | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 1500.0 |