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 |
|---|---|---|---|---|---|---|---|---|---|
| 521 | 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 | ||
| 17426 | Digit String | greedy implementation math | Statement | B | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 11756 | 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 | ||
| 815 | Quadratic Jumps | constructive algorithms greedy math number theory | Statement | F | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2750.0 | ||
| 3863 | Maximum Prefix Sums | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2000.0 | ||
| 1184 | Graph Cutting | dfs and similar dp trees | Statement | E | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2500.0 | ||
| 25672 | Construct an Array | constructive algorithms | Statement | A | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 500.0 | ||
| 12089 | Chipmunk Theo and Equality | implementation | Statement | C | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 1250.0 | ||
| 18330 | Another Sorting Problem | constructive algorithms | Statement | B | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 1000.0 | ||
| 311 | 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 | |
| 613 | Snaking Arrangement | combinatorics constructive algorithms | Statement | E | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 2750.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 8830 | 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 | |
| 12249 | 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 | |
| 2769 | 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 | |
| 23495 | Convergence | greedy sortings | Statement | A | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 500.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 21180 | Cake Leveling | binary search greedy math | Statement | B | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 1000.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 421 | Shortest GCD Paths | dp graphs math number theory shortest paths | Statement | F | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 1217 | Permutation Transmission (Easy Version) | combinatorics sortings | Statement | E1 | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 1199 | Permutation Transmission (Difficult Version) | combinatorics sortings | Statement | E2 | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 3583 | Goods on the Shelf | brute force data structures two pointers | Statement | D | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 18192 | Different Distances | constructive algorithms | Statement | B | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 9641 | Cost of a Bracket Sequence | brute force dp greedy | Statement | C | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 23166 | AI Project Development | brute force math | Statement | A | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 8886 | XOR, Expression and Two Binary Numbers | bitmasks constructive algorithms math number theory | Statement | D | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 1750.0 | Tutorial | |
| 2092 | 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 | |
| 2380 | 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 | |
| 12354 | 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 | |
| 385 | Stripe, Token and Two Players | data structures games | Statement | G | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 3250.0 | Tutorial | |
| 22431 | Palindrome, Twelve and Two Terms | constructive algorithms math | Statement | B | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 750.0 | Tutorial | |
| 24429 | Euclid, Sequence and Two Numbers | math number theory sortings | Statement | A | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 500.0 | Tutorial | |
| 28731 | Tatar TV Show | math strings | Statement | B | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 21315 | Omsk Programmers | brute force greedy math | Statement | C | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 35005 | Games on the Train | greedy math | Statement | A | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 6559 | Friendly Gifts | dp | Statement | E | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 1025 | Elections in Saransk (hard version) | combinatorics dp fft math number theory | Statement | F2 | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 5071 | Elections in Saransk (easy version) | number theory | Statement | F1 | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 424 | Criterion in Burlandia | brute force data structures implementation | Statement | G | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 12958 | Brand New Tatar TV Show | binary search constructive algorithms dp games math | Statement | D | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 142 | 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 | |
| 446 | 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 | |
| 2094 | 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 | |
| 968 | 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 | |
| 6449 | 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 | |
| 15992 | 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 | |
| 21968 | 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 | |
| 100 | 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 | |
| 74 | 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 | |
| 14997 | 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 | |
| 9225 | Village Guilds | dfs and similar dp trees | Statement | C | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 1250.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 7729 | Storming Arasaka | math number theory | Statement | D | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 1500.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 457 | Infinite Work | combinatorics graphs greedy math | Statement | F | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 2750.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 16156 | Crimson Triples | math number theory | Statement | B | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 750.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 1937 | Cake Trial | dp greedy two pointers | Statement | E | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 2250.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 19799 | Another Puzzle from Papyrus | greedy math sortings | Statement | A | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 500.0 | Codeforces Round 1106 (Div. 2) Editorial | |
| 171 | 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 | |
| 1354 | 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 | |
| 9227 | 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 | |
| 655 | 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 | |
| 7114 | Decidophobia | greedy sortings two pointers | Statement | B | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 1000.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 221 | 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 | |
| 16850 | Another Popcount Problem | greedy | Statement | A | Codeforces Round 1105 (Div. 2) {2240} | PROGRAMMING | 500.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 11009 | AI Finds Nothing Here | combinatorics | Statement | B | Codeforces Round 1105 (Div. 2) {2240} | PROGRAMMING | 1250.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 943 | Summmon | binary search data structures greedy math number theory | Statement | G | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 21392 | RemovevomeR | greedy | Statement | C | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 20810 | Good times Good times | constructive algorithms math | Statement | B | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 6316 | 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 | ||
| 34126 | Divide and Conquer | greedy math number theory | Statement | A | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 16367 | An Alternative Way | dp greedy math | Statement | D | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 4841 | A Bit Odd | data structures games greedy math | Statement | F | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 11315 | Unstable Elements | brute force data structures implementation sortings two pointers | Statement | C | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 7587 | Two Digit Strings | dp greedy strings | Statement | D | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 454 | Summer Vacation | data structures dp probabilities | Statement | F | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 1507 | 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 | ||
| 17432 | Predominant Frequency Division | data structures greedy implementation math | Statement | B | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 24471 | Bigrams | sortings strings | Statement | A | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 2625 | Yura and Deadlines | data structures dp | Statement | G | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 12788 | 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 | ||
| 17057 | 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 | ||
| 23772 | Nikita and Books | greedy math sortings | Statement | B | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 8526 | Masha and the Garland | data structures dp strings | Statement | E | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 29096 | Iskander and Drawings | dp games greedy strings | Statement | A | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 4128 | Anya Loves Trees! | dp greedy trees | Statement | F | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 13442 | 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 | |
| 1074 | 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 | |
| 142 | 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 | |
| 6681 | 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 | |
| 310 | 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 | |
| 10415 | 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 | |
| 2062 | 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 | |
| 3640 | 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 | |
| 72 | 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 | |
| 238 | Whoname and Unsorted Array | constructive algorithms | Statement | F | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 2750.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 608 | lce4113 and Security Game | bitmasks interactive probabilities | Statement | E | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 2250.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 19049 | farmpiggie and Subset Sum | constructive algorithms | Statement | A | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 500.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 16637 | ezraft and Array | constructive algorithms number theory | Statement | B | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 750.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 3114 | 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 | |
| 8703 | 0mar and Alternating Sums | combinatorics dp math | Statement | C | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 1500.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 20894 | Zero Sum | constructive algorithms | Statement | A | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 500.0 | ||
| 15432 | Yet Another Constructive | constructive algorithms | Statement | B | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 750.0 | ||
| 2307 | XOR Sorting (Hard Version) | bitmasks data structures greedy | Statement | D2 | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 1250.0 | ||
| 6396 | XOR Sorting (Easy Version) | binary search bitmasks divide and conquer greedy | Statement | D1 | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 1500.0 | ||
| 449 | Paths on a Grid | data structures dp hashing | Statement | F | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 3500.0 | ||
| 12549 | Inversion of a Subsequence | greedy | Statement | C | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 1250.0 | ||
| 1049 | Build a Tree | constructive algorithms | Statement | E | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 3000.0 | ||
| 19212 | You Delete, I Delete | greedy | Statement | A | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 500.0 | ||
| 133 | No Balance Left | dp math | Statement | G | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 3500.0 | ||
| 13813 | Merge to Match | greedy sortings | Statement | B | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 1250.0 | ||
| 9246 | Maximize the Score | dp greedy | Statement | C | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 1500.0 | ||
| 461 | Matrix Elimination | binary search math | Statement | F | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 2500.0 | ||
| 6591 | Good Pair Queries | constructive algorithms greedy math | Statement | D | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 1750.0 | ||
| 1811 | Excuse for Breaks | binary search greedy math | Statement | E | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 2500.0 | ||
| 1015 | 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 | |
| 168 | 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 | |
| 203 | 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 | |
| 9689 | 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 | |
| 4102 | Permutation Cuts | combinatorics implementation math | Statement | B | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 1250.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 157 | 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 | |
| 1600 | 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 | |
| 17980 | Threshold Movement | implementation math | Statement | A | Codeforces Round 1112 (Div. 2) {2250} | PROGRAMMING | 500.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 14198 | String Construction | constructive algorithms | Statement | B | Codeforces Round 1112 (Div. 2) {2250} | PROGRAMMING | 750.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 360 | Spectral Components | dfs and similar dp greedy sortings trees | Statement | F | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 2750.0 | ||
| 8617 | Risky Tower | binary search brute force data structures greedy sortings | Statement | C | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 1250.0 | ||
| 1389 | Generational Triplets | bitmasks combinatorics dp math | Statement | E | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 2250.0 | ||
| 17053 | Boss Fight | greedy | Statement | A | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 500.0 | ||
| 4584 | Array Replacement | greedy sortings | Statement | D | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 1750.0 | ||
| 11695 | Always Changing | greedy math strings | Statement | B | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 1000.0 | ||
| 18633 | The Best Card | math number theory | Statement | A | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | |||
| 6859 | Sum of Distinct Values in a Matrix | greedy | Statement | C | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | |||
| 11037 | Hypercarp and the Control Panel | brute force data structures two pointers | Statement | B | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | |||
| 2911 | Hypercarp and Interdimensional Jumps | binary search brute force geometry greedy implementation math | Statement | D | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | |||
| 1109 | Diameter Intersections | brute force dfs and similar fft graphs trees | Statement | E | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | |||
| 312 | 4-beauty | bitmasks dp graphs math | Statement | F | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | |||
| 2760 | Whiplash | bitmasks constructive algorithms math | Statement | F | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | |||
| 9072 | Silhouette | constructive algorithms math sortings | Statement | D | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | |||
| 31824 | Riptide | implementation sortings | Statement | A | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | |||
| 927 | Nightcrawler | data structures dfs and similar dp greedy sortings trees | Statement | G | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | |||
| 12537 | Marenol (hard version) | greedy sortings | Statement | C2 | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | |||
| 17613 | Marenol (easy version) | greedy | Statement | C1 | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | |||
| 22435 | Evanescent | implementation strings two pointers | Statement | B | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | |||
| 6527 | Chronostasis | binary search data structures greedy | Statement | E | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | |||
| 166 | Who Will Witness the End? | fft math | Statement | F | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 3500.0 | ||
| 116 | What Will Remain at the End? (Hard Version) | data structures | Statement | E2 | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1250.0 | ||
| 177 | What Will Remain at the End? (Easy Version) | brute force data structures | Statement | E1 | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1750.0 | ||
| 1251 | How Long Until Nothing Remains? | binary search bitmasks greedy | Statement | D | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1750.0 | ||
| 11781 | Hot Potatoes at the Fairy Warehouse | games implementation | Statement | A | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 500.0 | ||
| 1338 | Even If the World Turns | communication greedy interactive math number theory | Statement | C | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1750.0 | ||
| 6022 | A Ribbon for Tomorrow | combinatorics math | Statement | B | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1000.0 | ||
| 21673 | Three Numbers on the Blackboard | math sortings | Statement | A | Codeforces Round 1116 (Div. 2) {2256} | PROGRAMMING | 500.0 | ||
| 14593 | Domino Tiles | implementation math | Statement | B | Codeforces Round 1116 (Div. 2) {2256} | PROGRAMMING | 1000.0 | ||
| 9098 | Spying on the Beaver | dfs and similar dsu graphs trees | Statement | C | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 1250.0 | ||
| 14411 | Gigantomachy | math | Statement | B | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 750.0 | ||
| 16152 | Creating Abbreviations | brute force strings | Statement | A | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 500.0 | ||
| 1361 | Busy Beaver | brute force divide and conquer dp greedy implementation sortings | Statement | E | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 2250.0 | ||
| 4728 | Bermuda Rectangle | binary search math number theory | Statement | D | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 1750.0 | ||
| 187 | Beaver's Jumping Track (Hard Version) | data structures dp matrices | Statement | F2 | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 1000.0 | ||
| 406 | Beaver's Jumping Track (Easy Version) | data structures dp matrices | Statement | F1 | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 2750.0 |