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 ... 44 45 46Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 545 | Game on Growing Tree | binary search dfs and similar dp games trees | Statement | F | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 17942 | Digit String | greedy implementation math | Statement | B | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 12144 | 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 | ||
| 857 | Quadratic Jumps | constructive algorithms greedy math number theory | Statement | F | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2750.0 | ||
| 4015 | Maximum Prefix Sums | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2000.0 | ||
| 1247 | Graph Cutting | dfs and similar dp trees | Statement | E | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2500.0 | ||
| 26252 | Construct an Array | constructive algorithms | Statement | A | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 500.0 | ||
| 12521 | Chipmunk Theo and Equality | implementation | Statement | C | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 1250.0 | ||
| 18794 | Another Sorting Problem | constructive algorithms | Statement | B | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 1000.0 | ||
| 321 | 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 | |
| 656 | Snaking Arrangement | combinatorics constructive algorithms | Statement | E | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 2750.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 9156 | 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 | |
| 12639 | 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 | |
| 2859 | 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 | |
| 23903 | Convergence | greedy sortings | Statement | A | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 500.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 21875 | Cake Leveling | binary search greedy math | Statement | B | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 1000.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 545 | Shortest GCD Paths | dp graphs math number theory shortest paths | Statement | F | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 1307 | Permutation Transmission (Easy Version) | combinatorics sortings | Statement | E1 | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 1386 | Permutation Transmission (Difficult Version) | combinatorics sortings | Statement | E2 | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 3741 | Goods on the Shelf | brute force data structures two pointers | Statement | D | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 18739 | Different Distances | constructive algorithms | Statement | B | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 9996 | Cost of a Bracket Sequence | brute force dp greedy | Statement | C | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 23743 | AI Project Development | brute force math | Statement | A | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 9178 | XOR, Expression and Two Binary Numbers | bitmasks constructive algorithms math number theory | Statement | D | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 1750.0 | Tutorial | |
| 2222 | Vlad, Misha and Two Arrays | combinatorics data structures dfs and similar divide and conquer dp | Statement | E | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 2500.0 | Tutorial | |
| 2481 | 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 | |
| 12699 | 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 | |
| 410 | Stripe, Token and Two Players | data structures games | Statement | G | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 3250.0 | Tutorial | |
| 22962 | Palindrome, Twelve and Two Terms | constructive algorithms math | Statement | B | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 750.0 | Tutorial | |
| 24973 | Euclid, Sequence and Two Numbers | math number theory sortings | Statement | A | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 500.0 | Tutorial | |
| 29579 | Tatar TV Show | math strings | Statement | B | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 22068 | Omsk Programmers | brute force greedy math | Statement | C | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 36203 | Games on the Train | greedy math | Statement | A | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 6867 | Friendly Gifts | dp | Statement | E | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 1269 | Elections in Saransk (hard version) | combinatorics dp fft math number theory | Statement | F2 | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 5352 | Elections in Saransk (easy version) | number theory | Statement | F1 | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 454 | Criterion in Burlandia | brute force data structures implementation | Statement | G | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 13468 | Brand New Tatar TV Show | binary search constructive algorithms dp games math | Statement | D | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 159 | 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 | |
| 460 | Send GCDs | communication interactive math | Statement | G | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 2750.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 2182 | 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 | |
| 1175 | 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 | |
| 6723 | 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 | |
| 16706 | 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 | |
| 22519 | 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 | |
| 123 | DBFS Order (Hard Version) | dp trees | Statement | I2 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 4500.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 87 | DBFS Order (Easy Version) | dp trees | Statement | I1 | 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 | |
| 15463 | 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 | |
| 9805 | Village Guilds | dfs and similar dp trees | Statement | C | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 1250.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 8195 | Storming Arasaka | math number theory | Statement | D | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 1500.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 502 | Infinite Work | combinatorics graphs greedy math | Statement | F | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 2750.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 16889 | Crimson Triples | math number theory | Statement | B | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 750.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 2304 | Cake Trial | dp greedy two pointers | Statement | E | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 2250.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 20468 | Another Puzzle from Papyrus | greedy math sortings | Statement | A | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 500.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 195 | The end of this world, | divide and conquer dsu | Statement | E | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 2750.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 1617 | Revival | binary search constructive algorithms data structures math two pointers | Statement | C | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 1500.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 9718 | 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 | |
| 713 | Hunting the Beast | combinatorics dp graphs | Statement | D | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 2000.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 7541 | Decidophobia | greedy sortings two pointers | Statement | B | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 1000.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 257 | 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 | |
| 17386 | Another Popcount Problem | greedy | Statement | A | Codeforces Round 1105 (Div. 2) {2240} | PROGRAMMING | 500.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 11427 | AI Finds Nothing Here | combinatorics | Statement | B | Codeforces Round 1105 (Div. 2) {2240} | PROGRAMMING | 1250.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 1041 | Summmon | binary search data structures greedy math number theory | Statement | G | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 22452 | RemovevomeR | greedy | Statement | C | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 21865 | Good times Good times | constructive algorithms math | Statement | B | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 6875 | Fair and Square | combinatorics dp graphs math number theory trees | Statement | E | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 35818 | Divide and Conquer | greedy math number theory | Statement | A | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 17149 | An Alternative Way | dp greedy math | Statement | D | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 5257 | A Bit Odd | data structures games greedy math | Statement | F | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 11986 | Unstable Elements | brute force data structures implementation sortings two pointers | Statement | C | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 8328 | Two Digit Strings | dp greedy strings | Statement | D | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 498 | Summer Vacation | data structures dp probabilities | Statement | F | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 1638 | 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 | ||
| 18138 | Predominant Frequency Division | data structures greedy implementation math | Statement | B | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 25402 | Bigrams | sortings strings | Statement | A | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 3112 | Yura and Deadlines | data structures dp | Statement | G | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 14020 | 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 | ||
| 18259 | 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 | ||
| 25568 | Nikita and Books | greedy math sortings | Statement | B | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 9423 | Masha and the Garland | data structures dp strings | Statement | E | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 30956 | Iskander and Drawings | dp games greedy strings | Statement | A | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 4694 | Anya Loves Trees! | dp greedy trees | Statement | F | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 14373 | 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 | |
| 1207 | Tom and Jerry | dfs and similar dsu games trees | Statement | E | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 2500.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 196 | NPC Challenge | divide and conquer interactive | Statement | G | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 3500.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 7372 | MEXOR | bitmasks constructive algorithms math | Statement | C | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 1250.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 459 | Familiar? | brute force combinatorics dp | Statement | F | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 3000.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 11278 | 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 | |
| 2288 | 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 | |
| 4003 | 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 | |
| 117 | Connect Connect See | brute force data structures | Statement | H | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 5000.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 356 | Whoname and Unsorted Array | constructive algorithms | Statement | F | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 2750.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 740 | lce4113 and Security Game | bitmasks interactive probabilities | Statement | E | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 2250.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 20065 | farmpiggie and Subset Sum | constructive algorithms | Statement | A | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 500.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 17851 | ezraft and Array | constructive algorithms number theory | Statement | B | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 750.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 3415 | 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 | |
| 9461 | 0mar and Alternating Sums | combinatorics dp math | Statement | C | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 1500.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 23001 | Zero Sum | constructive algorithms | Statement | A | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 500.0 | ||
| 16673 | Yet Another Constructive | constructive algorithms | Statement | B | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 750.0 | ||
| 2591 | XOR Sorting (Hard Version) | bitmasks data structures greedy | Statement | D2 | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 1250.0 | ||
| 7040 | XOR Sorting (Easy Version) | binary search bitmasks divide and conquer greedy | Statement | D1 | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 1500.0 | ||
| 618 | Paths on a Grid | data structures dp hashing | Statement | F | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 3500.0 | ||
| 13612 | Inversion of a Subsequence | greedy | Statement | C | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 1250.0 | ||
| 1207 | Build a Tree | constructive algorithms | Statement | E | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 3000.0 | ||
| 21135 | You Delete, I Delete | greedy | Statement | A | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 500.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 258 | No Balance Left | dp math | Statement | G | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 3500.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 15277 | Merge to Match | greedy sortings | Statement | B | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 1250.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 10552 | Maximize the Score | dp greedy | Statement | C | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 1500.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 735 | Matrix Elimination | binary search math | Statement | F | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 2500.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 7732 | Good Pair Queries | constructive algorithms greedy math | Statement | D | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 1750.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 2099 | Excuse for Breaks | binary search greedy math | Statement | E | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 2500.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 1189 | Xor Permutation Matrix | bitmasks chinese remainder theorem constructive algorithms math | Statement | D | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 2250.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 256 | 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 | |
| 294 | 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 | |
| 10697 | 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 | |
| 4621 | Permutation Cuts | combinatorics implementation math | Statement | B | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 1250.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 216 | Even Simple Path | constructive algorithms graphs shortest paths | Statement | F | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 3500.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 1857 | 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 | |
| 19446 | Threshold Movement | implementation math | Statement | A | Codeforces Round 1112 (Div. 2) {2250} | PROGRAMMING | 500.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 15453 | String Construction | constructive algorithms | Statement | B | Codeforces Round 1112 (Div. 2) {2250} | PROGRAMMING | 750.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 587 | Spectral Components | dfs and similar dp greedy sortings trees | Statement | F | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 2750.0 | 155741 | |
| 10396 | Risky Tower | binary search brute force data structures greedy sortings | Statement | C | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 1250.0 | 155741 | |
| 2032 | Generational Triplets | bitmasks combinatorics dp math | Statement | E | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 2250.0 | 155741 | |
| 19214 | Boss Fight | greedy | Statement | A | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 500.0 | 155741 | |
| 5750 | Array Replacement | greedy sortings | Statement | D | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 1750.0 | 155741 | |
| 13245 | Always Changing | greedy math strings | Statement | B | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 1000.0 | 155741 | |
| 21826 | The Best Card | math number theory | Statement | A | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 8271 | Sum of Distinct Values in a Matrix | greedy | Statement | C | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 12708 | Hypercarp and the Control Panel | brute force data structures two pointers | Statement | B | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 3662 | 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 | ||
| 1465 | Diameter Intersections | brute force dfs and similar fft graphs trees | Statement | E | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 558 | 4-beauty | bitmasks dp graphs math | Statement | F | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 3595 | Whiplash | bitmasks constructive algorithms math | Statement | F | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 11204 | Silhouette | constructive algorithms math sortings | Statement | D | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 37414 | Riptide | implementation sortings | Statement | A | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 1309 | Nightcrawler | data structures dfs and similar dp greedy sortings trees | Statement | G | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 14669 | Marenol (hard version) | greedy sortings | Statement | C2 | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 20674 | Marenol (easy version) | greedy | Statement | C1 | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 25966 | Evanescent | implementation strings two pointers | Statement | B | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 8419 | Chronostasis | binary search data structures greedy | Statement | E | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 301 | Who Will Witness the End? | fft math | Statement | F | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 3500.0 | 155840 | |
| 267 | What Will Remain at the End? (Hard Version) | data structures | Statement | E2 | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1250.0 | 155840 | |
| 294 | What Will Remain at the End? (Easy Version) | brute force data structures | Statement | E1 | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1750.0 | 155840 | |
| 1702 | How Long Until Nothing Remains? | binary search bitmasks greedy | Statement | D | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1750.0 | 155840 | |
| 14162 | Hot Potatoes at the Fairy Warehouse | games implementation | Statement | A | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 500.0 | 155840 | |
| 1653 | Even If the World Turns | communication greedy interactive math number theory | Statement | C | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1750.0 | 155840 | |
| 7469 | A Ribbon for Tomorrow | combinatorics math | Statement | B | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1000.0 | 155840 | |
| 25972 | Three Numbers on the Blackboard | math sortings | Statement | A | Codeforces Round 1116 (Div. 2) {2256} | PROGRAMMING | 500.0 | 155840 | |
| 17277 | Domino Tiles | implementation math | Statement | B | Codeforces Round 1116 (Div. 2) {2256} | PROGRAMMING | 1000.0 | 155840 | |
| 12275 | Spying on the Beaver | dfs and similar dsu graphs trees | Statement | C | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 1250.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 19253 | Gigantomachy | math | Statement | B | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 750.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 21108 | Creating Abbreviations | brute force strings | Statement | A | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 500.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 2219 | 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 | |
| 6635 | Bermuda Rectangle | binary search math number theory | Statement | D | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 1750.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 420 | Beaver's Jumping Track (Hard Version) | data structures dp matrices | Statement | F2 | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 1000.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 704 | Beaver's Jumping Track (Easy Version) | data structures dp matrices | Statement | F1 | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 2750.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 297 | Plus Minus Tree | dfs and similar dp graphs trees | Statement | F | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 3000.0 | Codeforces Round 1118 (Div. 2) Editorial | |
| 19574 | Odd Eraser | math | Statement | A | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 500.0 | Codeforces Round 1118 (Div. 2) Editorial | |
| 550 | Magic Tiles | dp implementation | Statement | D | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 2000.0 | Codeforces Round 1118 (Div. 2) Editorial | |
| 5349 | Far Cities | interactive trees two pointers | Statement | C | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 1250.0 | Codeforces Round 1118 (Div. 2) Editorial | |
| 889 | DivMEX | data structures math number theory | Statement | E | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 2250.0 | Codeforces Round 1118 (Div. 2) Editorial | |
| 5133 | 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 | |
| 15766 | Carrot Chopdown (Easy Version) | brute force math | Statement | B1 | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 750.0 | Codeforces Round 1118 (Div. 2) Editorial | |
| 981 | Treasure Map Destruction (Counting Version) | 2-sat combinatorics dfs and similar dp graphs math | Statement | H | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | Codeforces Round 1119 (Div. 3) Editorial | ||
| 6523 | Treasure Map Destruction (Constructive Version) | 2-sat constructive algorithms greedy | Statement | E | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | Codeforces Round 1119 (Div. 3) Editorial | ||
| 27799 | Moo Language School | brute force greedy two pointers | Statement | A | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | Codeforces Round 1119 (Div. 3) Editorial | ||
| 24826 | Minus Two | math number theory | Statement | B | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | Codeforces Round 1119 (Div. 3) Editorial | ||
| 13624 | MEX Multiset | constructive algorithms greedy | Statement | D | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | Codeforces Round 1119 (Div. 3) Editorial | ||
| 2640 | Index Removal | binary search data structures math | Statement | G | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | Codeforces Round 1119 (Div. 3) Editorial | ||
| 3555 | Binary Bubble Sort Inversions | data structures math two pointers | Statement | F | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | Codeforces Round 1119 (Div. 3) Editorial | ||
| 18622 | 101 | constructive algorithms greedy | Statement | C | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | Codeforces Round 1119 (Div. 3) Editorial | ||
| 235 | Sortable Permutations | brute force combinatorics math number theory | Statement | G | Educational Codeforces Round 194 (Rated for Div. 2) {2260} | PROGRAMMING | 156529 | ||
| 5051 | Signs of Prefix Sums | brute force constructive algorithms dfs and similar dp | Statement | D | Educational Codeforces Round 194 (Rated for Div. 2) {2260} | PROGRAMMING | 156529 | ||
| 20474 | Monocarp's Contest | implementation | Statement | A | Educational Codeforces Round 194 (Rated for Div. 2) {2260} | PROGRAMMING | 156529 | ||
| 15855 | Monocarp and Projects | math | Statement | B | Educational Codeforces Round 194 (Rated for Div. 2) {2260} | PROGRAMMING | 156529 | ||
| 10471 | Maximize XOR, Minimize Operations | bitmasks greedy | Statement | C | Educational Codeforces Round 194 (Rated for Div. 2) {2260} | PROGRAMMING | 156529 | ||
| 601 | Edge Three-Coloring | bitmasks brute force dfs and similar dsu graphs trees | Statement | F | Educational Codeforces Round 194 (Rated for Div. 2) {2260} | PROGRAMMING | 156529 | ||
| 1968 | Cyclic Balance | constructive algorithms math | Statement | E | Educational Codeforces Round 194 (Rated for Div. 2) {2260} | PROGRAMMING | 156529 | ||
| 972 | Traveling the World | combinatorics graphs math | Statement | C | Codeforces Round 1120 (Div. 1) {2262} | PROGRAMMING | 1750.0 | Codeforces Round 1120 (Div 1, Div 2) Editorial | |
| 205 | Rank Removal | math | Statement | F | Codeforces Round 1120 (Div. 1) {2262} | PROGRAMMING | 3250.0 | Codeforces Round 1120 (Div 1, Div 2) Editorial | |
| 354 | PLUSworld | constructive algorithms graphs | Statement | D | Codeforces Round 1120 (Div. 1) {2262} | PROGRAMMING | 2500.0 | Codeforces Round 1120 (Div 1, Div 2) Editorial | |
| 207 | Paired Bracket Sequences | combinatorics math | Statement | E | Codeforces Round 1120 (Div. 1) {2262} | PROGRAMMING | 3000.0 | Codeforces Round 1120 (Div 1, Div 2) Editorial | |
| 3070 | Floor of MEX (Hard Version) | dp implementation | Statement | A2 | Codeforces Round 1120 (Div. 1) {2262} | PROGRAMMING | 1000.0 | Codeforces Round 1120 (Div 1, Div 2) Editorial | |
| 9815 | Floor of MEX (Easy Version) | constructive algorithms greedy | Statement | A1 | Codeforces Round 1120 (Div. 1) {2262} | PROGRAMMING | 500.0 | Codeforces Round 1120 (Div 1, Div 2) Editorial | |
| 1983 | Culling Game | binary search data structures two pointers | Statement | B | Codeforces Round 1120 (Div. 1) {2262} | PROGRAMMING | 1750.0 | Codeforces Round 1120 (Div 1, Div 2) Editorial | |
| 17605 | Min Max Game | Statement | A | Codeforces Round 1120 (Div. 2) {2263} | PROGRAMMING | 500.0 | Codeforces Round 1120 (Div 1, Div 2) Editorial | ||
| 13112 | Min Matrices | constructive algorithms | Statement | B | Codeforces Round 1120 (Div. 2) {2263} | PROGRAMMING | 1000.0 | Codeforces Round 1120 (Div 1, Div 2) Editorial | |
| 15610 | Rumb Needs a Hand | implementation sortings two pointers | Statement | A | Codeforces Round 1121 (Div. 2) {2264} | PROGRAMMING | 500.0 | Codeforces Round 1121 (Div. 2) Editorial | |
| 7104 | Madamant's Skating Dynasty | combinatorics math sortings | Statement | C | Codeforces Round 1121 (Div. 2) {2264} | PROGRAMMING | 1500.0 | Codeforces Round 1121 (Div. 2) Editorial | |
| 11307 | Knife's Pill Farm | data structures greedy | Statement | B | Codeforces Round 1121 (Div. 2) {2264} | PROGRAMMING | 1250.0 | Codeforces Round 1121 (Div. 2) Editorial | |
| 2323 | Dr. Agos's Dark Mode | brute force constructive algorithms math strings | Statement | D | Codeforces Round 1121 (Div. 2) {2264} | PROGRAMMING | 2500.0 | Codeforces Round 1121 (Div. 2) Editorial | |
| 378 | Deranged Calculator | constructive algorithms implementation math | Statement | F | Codeforces Round 1121 (Div. 2) {2264} | PROGRAMMING | 3000.0 | Codeforces Round 1121 (Div. 2) Editorial | |
| 420 | A Prime Flood (Hard Version) | combinatorics dp number theory | Statement | E2 | Codeforces Round 1121 (Div. 2) {2264} | PROGRAMMING | 1500.0 | Codeforces Round 1121 (Div. 2) Editorial | |
| 1295 | A Prime Flood (Easy Version) | combinatorics dp number theory | Statement | E1 | Codeforces Round 1121 (Div. 2) {2264} | PROGRAMMING | 2000.0 | Codeforces Round 1121 (Div. 2) Editorial | |
| 25105 | Three Piles | games greedy math | Statement | B | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING | Codeforces Round 1122 (Div. 3) Editorial | ||
| 6886 | Prime Destruction | dp math number theory | Statement | E | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING | Codeforces Round 1122 (Div. 3) Editorial | ||
| 883 | Modular Tree | dfs and similar greedy math number theory trees | Statement | G | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING | Codeforces Round 1122 (Div. 3) Editorial | ||
| 1807 | MEX Replacement | binary search brute force greedy implementation math sortings | Statement | F | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING | Codeforces Round 1122 (Div. 3) Editorial | ||
| 28670 | Good Contest | greedy | Statement | A | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING | Codeforces Round 1122 (Div. 3) Editorial | ||
| 8646 | Falling Concrete | constructive algorithms data structures math sortings | Statement | D | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING | Codeforces Round 1122 (Div. 3) Editorial | ||
| 378 | Deque Malfunction | data structures dp greedy | Statement | H | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING | Codeforces Round 1122 (Div. 3) Editorial | ||
| 16512 | AND, OR, Sort! | greedy strings | Statement | C | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING | Codeforces Round 1122 (Div. 3) Editorial | ||
| 828 | XOR Transformations (Hard Version) | bitmasks brute force data structures greedy strings trees | Statement | F2 | Codeforces Round 1123 (Div. 2) {2267} | PROGRAMMING | 2000.0 | 157126 | |
| 3854 | XOR Transformations (Easy Version) | bitmasks brute force implementation sortings | Statement | F1 | Codeforces Round 1123 (Div. 2) {2267} | PROGRAMMING | 1000.0 | 157126 | |
| 18600 | Turn Into a Palindrome | greedy strings | Statement | A | Codeforces Round 1123 (Div. 2) {2267} | PROGRAMMING | 250.0 | 157126 | |
| 252 | New LRT | dp | Statement | G | Codeforces Round 1123 (Div. 2) {2267} | PROGRAMMING | 3000.0 | 157126 | |
| 10163 | GCD Treasury | greedy math number theory | Statement | C | Codeforces Round 1123 (Div. 2) {2267} | PROGRAMMING | 1000.0 | 157126 | |
| 15009 | Fashionable Array | brute force constructive algorithms sortings | Statement | B | Codeforces Round 1123 (Div. 2) {2267} | PROGRAMMING | 500.0 | 157126 | |
| 1796 | Clean Substrings | combinatorics data structures math | Statement | E | Codeforces Round 1123 (Div. 2) {2267} | PROGRAMMING | 1750.0 | 157126 | |
| 7264 | Backrooms Hill | constructive algorithms dp greedy sortings two pointers | Statement | D | Codeforces Round 1123 (Div. 2) {2267} | PROGRAMMING | 1250.0 | 157126 | |
| 5903 | What a SauSaGe! It's All Meat | bitmasks math | Statement | B | Codeforces Round 1124 (Div. 1) {2268} | PROGRAMMING | 1000.0 | 157140 | |
| 10550 | K Is Important | constructive algorithms greedy | Statement | A | Codeforces Round 1124 (Div. 1) {2268} | PROGRAMMING | 500.0 | 157140 | |
| 335 | Kia Kio and Tree of Life | data structures fft math trees | Statement | E | Codeforces Round 1124 (Div. 1) {2268} | PROGRAMMING | 2750.0 | 157140 | |
| 1017 | KiaKio and Energy Intervals | binary search bitmasks brute force data structures divide and conquer greedy two pointers | Statement | C | Codeforces Round 1124 (Div. 1) {2268} | PROGRAMMING | 1750.0 | 157140 | |
| 208 | Deglado | constructive algorithms | Statement | F | Codeforces Round 1124 (Div. 1) {2268} | PROGRAMMING | 3250.0 | 157140 | |
| 609 | AghaBalaSar and Hamed | data structures dp trees | Statement | D | Codeforces Round 1124 (Div. 1) {2268} | PROGRAMMING | 2250.0 | 157140 | |
| 17578 | SauSaGe Bank | greedy math | Statement | A | Codeforces Round 1124 (Div. 2) {2269} | PROGRAMMING | 500.0 | 157140 | |
| 11624 | KiaKio and Squared Numbers | brute force implementation | Statement | B | Codeforces Round 1124 (Div. 2) {2269} | PROGRAMMING | 1000.0 | 157140 | |
| 11423 | Unrequited Love | brute force data structures | Statement | C | Codeforces Round 1125 (Div. 3) {2275} | PROGRAMMING | |||
| 1305 | Tea Blend | hashing math number theory | Statement | F | Codeforces Round 1125 (Div. 3) {2275} | PROGRAMMING | |||
| 2801 | Repentance Is Already on the Way | dp implementation | Statement | E | Codeforces Round 1125 (Div. 3) {2275} | PROGRAMMING | |||
| 5342 | Precision Alignment | binary search brute force greedy implementation | Statement | D | Codeforces Round 1125 (Div. 3) {2275} | PROGRAMMING | |||
| 19690 | In Search of Convenience | geometry implementation | Statement | A | Codeforces Round 1125 (Div. 3) {2275} | PROGRAMMING | |||
| 16340 | Did Not Go to Print | data structures implementation | Statement | B | Codeforces Round 1125 (Div. 3) {2275} | PROGRAMMING | |||
| 611 | Copper Squander | binary search data structures dsu graphs greedy math sortings ternary search | Statement | G | Codeforces Round 1125 (Div. 3) {2275} | PROGRAMMING | |||
| 185 | A Problem to Warm Up the Eyebrows | combinatorics dp math | Statement | H | Codeforces Round 1125 (Div. 3) {2275} | PROGRAMMING |