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 |
|---|---|---|---|---|---|---|---|---|---|
| 488 | 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 | ||
| 16422 | Digit String | greedy implementation math | Statement | B | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 11004 | 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 | ||
| 758 | Quadratic Jumps | constructive algorithms greedy math number theory | Statement | F | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2750.0 | ||
| 3572 | Maximum Prefix Sums | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2000.0 | ||
| 1083 | Graph Cutting | dfs and similar dp trees | Statement | E | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2500.0 | ||
| 24360 | Construct an Array | constructive algorithms | Statement | A | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 500.0 | ||
| 11343 | Chipmunk Theo and Equality | implementation | Statement | C | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 1250.0 | ||
| 17350 | Another Sorting Problem | constructive algorithms | Statement | B | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 1000.0 | ||
| 278 | 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 | |
| 556 | Snaking Arrangement | combinatorics constructive algorithms | Statement | E | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 2750.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 8243 | 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 | |
| 11544 | 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 | |
| 2566 | 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 | |
| 22412 | Convergence | greedy sortings | Statement | A | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 500.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 19824 | Cake Leveling | binary search greedy math | Statement | B | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 1000.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 354 | Shortest GCD Paths | dp graphs math number theory shortest paths | Statement | F | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | |||
| 1075 | Permutation Transmission (Easy Version) | combinatorics sortings | Statement | E1 | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | |||
| 1046 | Permutation Transmission (Difficult Version) | combinatorics sortings | Statement | E2 | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | |||
| 3171 | Goods on the Shelf | brute force data structures two pointers | Statement | D | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | |||
| 16890 | Different Distances | constructive algorithms | Statement | B | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | |||
| 8802 | Cost of a Bracket Sequence | brute force dp greedy | Statement | C | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | |||
| 21469 | AI Project Development | brute force math | Statement | A | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | |||
| 8264 | XOR, Expression and Two Binary Numbers | bitmasks constructive algorithms math number theory | Statement | D | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 1750.0 | ||
| 1807 | 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 | ||
| 2148 | 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 | ||
| 11548 | 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 | ||
| 325 | Stripe, Token and Two Players | data structures games | Statement | G | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 3250.0 | ||
| 20983 | Palindrome, Twelve and Two Terms | constructive algorithms math | Statement | B | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 750.0 | ||
| 23070 | Euclid, Sequence and Two Numbers | math number theory sortings | Statement | A | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 500.0 | ||
| 26694 | Tatar TV Show | math strings | Statement | B | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | |||
| 19827 | Omsk Programmers | brute force greedy math | Statement | C | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 32215 | Games on the Train | greedy math | Statement | A | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | |||
| 5875 | Friendly Gifts | dp | Statement | E | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 876 | Elections in Saransk (hard version) | combinatorics dp fft math number theory | Statement | F2 | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | |||
| 4528 | Elections in Saransk (easy version) | number theory | Statement | F1 | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | |||
| 342 | Criterion in Burlandia | brute force data structures implementation | Statement | G | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | |||
| 11790 | Brand New Tatar TV Show | binary search constructive algorithms dp games math | Statement | D | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | |||
| 101 | Slime and Queries | data structures greedy trees | Statement | H | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 3500.0 | ||
| 384 | Send GCDs | communication interactive math | Statement | G | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 2750.0 | ||
| 1844 | 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 | |
| 815 | Paint the Array | data structures dp greedy | Statement | F | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 2500.0 | ||
| 5790 | Fullmetal Bitchemist | constructive algorithms greedy math | Statement | D | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 1750.0 | ||
| 14358 | Duck Surplus | greedy | Statement | C | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 1250.0 | ||
| 20097 | Destroying Towers | greedy | Statement | A | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 500.0 | ||
| 78 | DBFS Order (Hard Version) | dp trees | Statement | I2 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 4500.0 | ||
| 50 | DBFS Order (Easy Version) | dp trees | Statement | I1 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 3500.0 | ||
| 13893 | Annoying the Ghost | brute force greedy | Statement | B | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 1000.0 | ||
| 7621 | Village Guilds | dfs and similar dp trees | Statement | C | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 1250.0 | ||
| 6389 | Storming Arasaka | math number theory | Statement | D | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 1500.0 | ||
| 331 | Infinite Work | combinatorics graphs greedy math | Statement | F | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 2750.0 | ||
| 13733 | Crimson Triples | math number theory | Statement | B | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 750.0 | ||
| 1453 | Cake Trial | dp greedy two pointers | Statement | E | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 2250.0 | ||
| 17030 | Another Puzzle from Papyrus | greedy math sortings | Statement | A | Codeforces Round 1106 (Div. 2) {2238} | PROGRAMMING | 500.0 | ||
| 108 | The end of this world, | divide and conquer dsu | Statement | E | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 2750.0 | ||
| 1034 | Revival | binary search constructive algorithms data structures math two pointers | Statement | C | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 1500.0 | ||
| 7700 | Nim Game Is XOR Game | bitmasks constructive algorithms games greedy math | Statement | A | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 750.0 | ||
| 493 | Hunting the Beast | combinatorics dp graphs | Statement | D | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 2000.0 | ||
| 5701 | Decidophobia | greedy sortings two pointers | Statement | B | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 1000.0 | ||
| 110 | Colorful Works | dp fft games implementation | Statement | F | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 3500.0 | ||
| 14730 | Another Popcount Problem | greedy | Statement | A | Codeforces Round 1105 (Div. 2) {2240} | PROGRAMMING | 500.0 | ||
| 9674 | AI Finds Nothing Here | combinatorics | Statement | B | Codeforces Round 1105 (Div. 2) {2240} | PROGRAMMING | 1250.0 | ||
| 673 | Summmon | binary search data structures greedy math number theory | Statement | G | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 17816 | RemovevomeR | greedy | Statement | C | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 17293 | Good times Good times | constructive algorithms math | Statement | B | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 4804 | Fair and Square | combinatorics dp graphs math number theory trees | Statement | E | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 27447 | Divide and Conquer | greedy math number theory | Statement | A | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 13432 | An Alternative Way | dp greedy math | Statement | D | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 3687 | A Bit Odd | data structures games greedy math | Statement | F | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 8413 | Unstable Elements | brute force data structures implementation sortings two pointers | Statement | C | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | |||
| 4605 | Two Digit Strings | dp greedy strings | Statement | D | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | |||
| 189 | Summer Vacation | data structures dp probabilities | Statement | F | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | |||
| 881 | Product of Closures | bitmasks brute force constructive algorithms dp greedy implementation math | Statement | E | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | |||
| 13366 | Predominant Frequency Division | data structures greedy implementation math | Statement | B | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | |||
| 18065 | Bigrams | sortings strings | Statement | A | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING |