Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
< 1 2 3 ... 80 81 82 83 84 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 660 | Maximums and Minimums | combinatorics combinatorics data structures number theory | Statement | E | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 2250.0 | Codeforces Round #823 — editorial | 2700 |
| 580 | Almost Sorted | bitmasks data structures dp | Statement | F | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 3000.0 | Codeforces Round #823 — editorial | 2700 |
| 23326 | Planets | data structures data structures greedy sortings | Statement | A | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 500.0 | Codeforces Round #823 — editorial | 800 |
| 7394 | Valiant's New Map | binary search brute force data structures dp two pointers | Statement | D | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 1500.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 19216 | Kill Demodogs | greedy math | Statement | B | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 1000.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 22798 | Joey Takes Money | greedy math | Statement | A | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 500.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 2940 | Graph Cost | dp greedy math number theory | Statement | E | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 2000.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 712 | Function Sum | brute force combinatorics dp fft math | Statement | F | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 2750.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 9926 | Even Subarrays | bitmasks brute force hashing math number theory | Statement | C | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 1500.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 15455 | Bestie | brute force constructive algorithms implementation math number theory | Statement | A | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 750.0 | 108327 | 1000 |
| 8927 | Balance (Easy version) | brute force data structures implementation | Statement | D1 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1250.0 | 108327 | 1500 |
| 6110 | Sheikh (Easy version) | binary search bitmasks greedy two pointers | Statement | C1 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1000.0 | 108327 | 1800 |
| 2666 | Sheikh (Hard Version) | binary search bitmasks brute force greedy implementation two pointers | Statement | C2 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1000.0 | 108327 | 2100 |
| 1426 | Balance (Hard version) | brute force data structures | Statement | D2 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1250.0 | 108327 | 2400 |
| 468 | Location | data structures dp | Statement | E | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 3000.0 | 108327 | 2800 |
| 15470 | Ugu | dp greedy | Statement | B | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 750.0 | 108327 | 900 |
| 4337 | Zero-One (Hard Version) | dp greedy | Statement | D2 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 750.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 13842 | Zero-One (Easy Version) | dp greedy math | Statement | D1 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 20001 | Rule of League | constructive algorithms math | Statement | B | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1000.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 15933 | Parity Shuffle Sorting | constructive algorithms sortings | Statement | C | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 1275 | Conveyor | dp math | Statement | E | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 2750.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 21143 | Consecutive Sum | greedy sortings | Statement | A | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 842 | Zeros and Ones | bitmasks divide and conquer dp math | Statement | F | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 3250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 6458 | Slime Escape | data structures dp greedy two pointers | Statement | D | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 2000.0 | Codeforces Round #822 (Div.2) Editorial | |
| 21390 | Select Three Sticks | greedy math sortings | Statement | A | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 500.0 | Codeforces Round #822 (Div.2) Editorial | |
| 19802 | Removing Smallest Multiples | greedy math | Statement | C | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 1250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 2983 | Rectangular Congruence | constructive algorithms math number theory | Statement | E | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 2250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 15950 | Bright, Nice, Brilliant | constructive algorithms | Statement | B | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 750.0 | Codeforces Round #822 (Div.2) Editorial | |
| 20440 | Working Week | constructive algorithms greedy math | Statement | A | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 500.0 | Codeforces Round #824 — editorial | |
| 18423 | Tea with Tangerines | greedy math | Statement | B | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 750.0 | Codeforces Round #824 — editorial | |
| 10104 | Phase Shift | dfs and similar ds graphs greedy strings | Statement | C | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 1250.0 | Codeforces Round #824 — editorial | |
| 234 | Pebbles and Beads | data structures dp geometry | Statement | F | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 3000.0 | Codeforces Round #824 — editorial | |
| 5618 | Meta-set | brute force combinatorics data structures hashing math | Statement | D | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 1750.0 | Codeforces Round #824 — editorial | |
| 1083 | House Planning | constructive algorithms data structures flows graph matchings greedy | Statement | E | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 2250.0 | Codeforces Round #824 — editorial | |
| 758 | Swap and Take | dp greedy | Statement | E | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2500.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 18441 | Playing with GCD | math number theory | Statement | B | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 1000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 23225 | Make A Equal to B | sortings | Statement | A | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 500.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 1358 | Good Subarrays (Hard Version) | binary search data structures two pointers | Statement | C2 | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 15363 | Good Subarrays (Easy Version) | binary search data structures two pointers | Statement | C1 | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 1250.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 2568 | Equal Binary Subsequences | constructive algorithms greedy strings | Statement | D | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 118 | Ela Takes Dancing Class | binary search binary search data structures | Statement | G | Dytechlab Cup 2022 {1737} | PROGRAMMING | 3750.0 | Editorial of Dytechlab Cup 2022 | |
| 10280 | Ela Sorting Books | greedy implementation strings | Statement | A | Dytechlab Cup 2022 {1737} | PROGRAMMING | 500.0 | Editorial of Dytechlab Cup 2022 | |
| 9539 | Ela's Fitness and the Luxury Number | binary search implementation math | Statement | B | Dytechlab Cup 2022 {1737} | PROGRAMMING | 1000.0 | Editorial of Dytechlab Cup 2022 | |
| 959 | Ela Goes Hiking | dp probabilities | Statement | E | Dytechlab Cup 2022 {1737} | PROGRAMMING | 2750.0 | Editorial of Dytechlab Cup 2022 | |
| 1932 | Ela and the Wiring Wizard | graphs greedy shortest paths | Statement | D | Dytechlab Cup 2022 {1737} | PROGRAMMING | 2000.0 | Editorial of Dytechlab Cup 2022 | |
| 127 | Ela and Prime GCD | constructive algorithms math number theory | Statement | F | Dytechlab Cup 2022 {1737} | PROGRAMMING | 3500.0 | Editorial of Dytechlab Cup 2022 | |
| 5893 | Ela and Crickets | games implementation math | Statement | C | Dytechlab Cup 2022 {1737} | PROGRAMMING | 1500.0 | Editorial of Dytechlab Cup 2022 | |
| 16311 | Prefix Sum Addicts | constructive algorithms math sortings | Statement | B | Codeforces Global Round 22 {1738} | PROGRAMMING | 1000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 3520 | Permutation Addicts | constructive algorithms dfs and similar ds graphs trees | Statement | D | Codeforces Global Round 22 {1738} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 243 | Palindrome Addicts | data structures strings | Statement | H | Codeforces Global Round 22 {1738} | PROGRAMMING | 4000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 13639 | Glory Addicts | greedy implementation | Statement | A | Codeforces Global Round 22 {1738} | PROGRAMMING | 500.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 11540 | Even Number Addicts | dp games greedy math | Statement | C | Codeforces Global Round 22 {1738} | PROGRAMMING | 1500.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 1260 | Connectivity Addicts | constructive algorithms ds graphs greedy interactive shortest paths sortings trees | Statement | F | Codeforces Global Round 22 {1738} | PROGRAMMING | 2750.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 1588 | Balance Addicts | combinatorics dp math two pointers | Statement | E | Codeforces Global Round 22 {1738} | PROGRAMMING | 2500.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 473 | Anti-Increasing Addicts | constructive algorithms dfs and similar dp greedy | Statement | G | Codeforces Global Round 22 {1738} | PROGRAMMING | 3000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 5314 | Reset K Edges | binary search data structures dfs and similar graphs greedy trees | Statement | D | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 557 | Keyboard Design | bitmasks data structures dp string suffix structures strings | Statement | F | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 22997 | Immobile Knight | implementation | Statement | A | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 1254 | Cleaning Robot | bitmasks dp | Statement | E | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 9288 | Card Game | combinatorics constructive algorithms dp games | Statement | C | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 22791 | Array Recovery | constructive algorithms greedy math | Statement | B | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 11307 | Bricks and Bags | constructive algorithms games greedy sortings | Statement | C | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1500.0 | Tutorial | 1400 |
| 8301 | Knowledge Cards | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1750.0 | Tutorial | 1500 |
| 4477 | Hanging Hearts | constructive algorithms data structures dfs and similar dp greedy trees | Statement | E | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2000.0 | Tutorial | 1800 |
| 839 | Conditional Mix | combinatorics dp math | Statement | F | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2500.0 | Tutorial | 2600 |
| 190 | Dangerous Laser Power | constructive algorithms ds sortings | Statement | G | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2750.0 | Tutorial | 3100 |
| 240 | MEX Tree Manipulation | data structures trees | Statement | H | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 3000.0 | Tutorial | 3300 |
| 115 | Arranging Crystal Balls | data structures divide and conquer divide and conquer dp geometry graphs number theory | Statement | I | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 3500.0 | Tutorial | 3500 |
| 13878 | Jumbo Extra Cheese 2 | geometry greedy sortings | Statement | B | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1000.0 | Tutorial | 800 |
| 20670 | Factorise N+M | math number theory | Statement | A | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 13115 | Sending a Sequence Over the Network | dp | Statement | E | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 2527 | Multi-Colored Segments | binary search data structures math sortings | Statement | F | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 18031 | Minimize the Thickness | brute force greedy math two pointers | Statement | C | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 15663 | Masha and a Beautiful Tree | dfs and similar divide and conquer graphs sortings trees | Statement | D | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 1571 | Kirill and Company | bitmasks brute force dp graphs shortest paths | Statement | G | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 25698 | Funny Permutation | constructive algorithms math | Statement | B | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 31338 | Compare T-Shirt Sizes | implementation implementation strings | Statement | A | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 78381 | Sum | implementation | Statement | A | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 34233 | Stripes | implementation | Statement | C | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 12192 | Smaller | constructive algorithms greedy strings | Statement | F | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 26501 | Scuza | binary search greedy math | Statement | E | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 11265 | Orray | bitmasks brute force greedy math | Statement | G | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 50347 | Increasing | greedy implementation sortings | Statement | B | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 25016 | Coprime | brute force greedy number theory | Statement | D | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 19477 | Save the Magazines | constructive algorithms greedy sortings string suffix structures | Statement | C | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 1100 | |
| 7730 | Problem with Random Tests | brute force hashing probabilities | Statement | D | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 1700 | |
| 1563 | Intersection and Union | combinatorics data structures dp math matrices | Statement | F | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 2300 | |
| 1665 | FTL | binary search dp greedy | Statement | E | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 2400 | |
| 263 | Antifibonacci Cut | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 3000 | |
| 22383 | Permutation Value | greedy | Statement | B | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 800 | |
| 27140 | Password | combinatorics implementation | Statement | A | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 800 | |
| 29253 | Traffic Light | binary search implementation two pointers | Statement | C | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 27501 | Number Replacement | greedy implementation | Statement | A | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 3213 | MEX vs MED | brute force math two pointers | Statement | F | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 23799 | Even-Odd Increments | implementation math | Statement | B | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 5756 | Divisible Numbers (hard version) | brute force math number theory | Statement | E2 | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 11209 | Divisible Numbers (easy version) | brute force math number theory | Statement | E1 | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 22036 | Divisibility by 2^n | greedy math sortings | Statement | D | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 17494 | Rebellion | constructive algorithms greedy | Statement | B | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial | |
| 13074 | Permutation Operations | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial |