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 ... 31 32 33 34 35 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 10178 | Rorororobot | data structures | Statement | D | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 10257 | Recover an RBS | greedy implementation strings | Statement | C | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 679 | Multiset of Strings | dp fft flows graphs greedy math | Statement | F | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 25798 | Also Try Minecraft | data structures implementation | Statement | B | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 1626 | XOR Triangle | bitmasks dp | Statement | C | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 1750.0 | Codeforces Round #810 Editorial | |
| 578 | Two Arrays | games graph matchings | Statement | E | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 2750.0 | Codeforces Round #810 Editorial | |
| 558 | Recover the Tree | constructive algorithms trees | Statement | D | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 2000.0 | Codeforces Round #810 Editorial | |
| 2791 | Rain | brute force data structures math | Statement | B | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 1000.0 | Codeforces Round #810 Editorial | |
| 11901 | Color the Picture | constructive algorithms greedy | Statement | A | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 500.0 | Codeforces Round #810 Editorial | |
| 26493 | Perfect Permutation | constructive algorithms | Statement | A | Codeforces Round 810 (Div. 2) {1711} | PROGRAMMING | 500.0 | Codeforces Round #810 Editorial | |
| 14361 | Party | brute force graphs | Statement | B | Codeforces Round 810 (Div. 2) {1711} | PROGRAMMING | 1000.0 | Codeforces Round #810 Editorial | |
| 25053 | Wonderful Permutation | greedy implementation | Statement | A | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 500.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 22394 | Woeful Permutation | constructive algorithms greedy number theory | Statement | B | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 1000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 443 | Triameter | data structures dfs and similar trees | Statement | F | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 3500.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 21252 | Sort Zero | greedy sortings two pointers | Statement | C | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 1500.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 1613 | LCM Sum (hard version) | combinatorics data structures math number theory two pointers | Statement | E2 | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 750.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 2458 | LCM Sum (easy version) | binary search brute force combinatorics math number theory two pointers | Statement | E1 | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 2000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 5090 | Empty Graph | binary search data structures greedy | Statement | D | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 2000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 22678 | Optimal Reduction | constructive algorithms sortings | Statement | B | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 1000.0 | Codeforces Round #812 (Div. 2) Editorial | 1000 |
| 18857 | Build Permutation | constructive algorithms dp math | Statement | C | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 1750.0 | Codeforces Round #812 (Div. 2) Editorial | 1200 |
| 6222 | Tournament Countdown | constructive algorithms fft greedy greedy interactive number theory probabilities | Statement | D | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 2000.0 | Codeforces Round #812 (Div. 2) Editorial | 1800 |
| 1970 | Cross Swapping | dsu greedy matrices | Statement | E | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 2500.0 | Codeforces Round #812 (Div. 2) Editorial | 2400 |
| 681 | Lost Array | bitmasks combinatorics constructive algorithms dp math | Statement | F | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 3000.0 | Codeforces Round #812 (Div. 2) Editorial | 2900 |
| 22807 | Traveling Salesman Problem | geometry greedy implementation | Statement | A | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 500.0 | Codeforces Round #812 (Div. 2) Editorial | 800 |
| 33700 | Remove Prefix | data structures implementation | Statement | B | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 9684 | Path Prefixes | binary search data structures dfs and similar implementation trees | Statement | G | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 33398 | Minimum Varied Number | bitmasks brute force greedy | Statement | C | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 32822 | Everyone Loves to Sleep | implementation math | Statement | A | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 10307 | Color with Occurrences | dp greedy strings | Statement | D | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 3658 | Build a Tree and That Is It | brute force constructive algorithms greedy implementation trees | Statement | F | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 23458 | Add Modulo 10 | brute force math number theory | Statement | E | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 10351 | Monoblock | brute force combinatorics data structures divide and conquer greedy implementation | Statement | C | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 1750.0 | Codeforces Round #816 (Div. 2) editorial | |
| 2123 | Long Way Home | data structures divide and conquer dp geometry graphs shortest paths | Statement | E | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 2750.0 | Codeforces Round #816 (Div. 2) editorial | |
| 24368 | Crossmarket | constructive algorithms greedy math | Statement | A | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 500.0 | Codeforces Round #816 (Div. 2) editorial | |
| 588 | Crop Squares | constructive algorithms geometry interactive math | Statement | F | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 3000.0 | Codeforces Round #816 (Div. 2) editorial | |
| 33460 | Beautiful Array | constructive algorithms greedy math | Statement | B | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 1000.0 | Codeforces Round #816 (Div. 2) editorial | |
| 6065 | 2+ doors | 2-sat bitmasks graphs greedy schedules | Statement | D | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 2250.0 | Codeforces Round #816 (Div. 2) editorial | |
| 1317 | Swap and Maximum Block | bitmasks data structures divide and conquer dp | Statement | E | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 4589 | Robot in a Hallway | data structures dp implementation | Statement | C | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 21948 | Permutation Chain | constructive algorithms math | Statement | B | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 6125 | Chip Move | brute force dp math | Statement | D | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 1361 | Bags with Balls | combinatorics math number theory | Statement | F | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 35801 | 2-3 Moves | greedy math | Statement | A | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 15628 | Madoka and Underground Competitions | constructive algorithms greedy | Statement | B | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 1000.0 | Codeforces Round #818 (Div. 2) Editorial. | 1100 |
| 15887 | Madoka and Formal Statement | greedy math | Statement | C | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 1500.0 | Codeforces Round #818 (Div. 2) Editorial. | 1300 |
| 4854 | Madoka and The Corruption Scheme | combinatorics math | Statement | D | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 2000.0 | Codeforces Round #818 (Div. 2) Editorial. | 1900 |
| 3398 | Madoka and The Best University | brute force math number theory | Statement | E | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 2000.0 | Codeforces Round #818 (Div. 2) Editorial. | 2200 |
| 635 | Madoka and The First Session | constructive algorithms dfs and similar flows graph matchings graphs | Statement | F | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 3000.0 | Codeforces Round #818 (Div. 2) Editorial. | 2500 |
| 20942 | Madoka and Strange Thoughts | math number theory | Statement | A | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 500.0 | Codeforces Round #818 (Div. 2) Editorial. | 800 |
| 1854 | Tonya and Burenka-179 | brute force data structures greedy math number theory | Statement | C | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 1250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 416 | Permutation for Burenka | greedy math trees | Statement | D | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 2250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 154 | Impressionism | constructive algorithms graphs implementation math | Statement | E | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 2250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 3461 | Fibonacci Strings | brute force data structures greedy implementation math number theory | Statement | B | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 1250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 5902 | Burenka and Traditions (hard version) | data structures dp greedy math two pointers | Statement | A2 | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 500.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 6411 | Burenka and Traditions (easy version) | dp greedy math | Statement | A1 | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 500.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 217 | Burenka, an Array and Queries | data structures math number theory | Statement | F | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 2750.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 19162 | Mathematical Circus | constructive algorithms math | Statement | B | Codeforces Round 814 (Div. 2) {1719} | PROGRAMMING | 1000.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 14355 | Fighting Tournament | binary search data structures implementation two pointers | Statement | C | Codeforces Round 814 (Div. 2) {1719} | PROGRAMMING | 1250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 26797 | Chip Game | games math | Statement | A | Codeforces Round 814 (Div. 2) {1719} | PROGRAMMING | 500.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 2188 | Xor-Subsequence (hard version) | bitmasks data structures dp strings trees | Statement | D2 | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1000.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 6702 | Xor-Subsequence (easy version) | bitmasks brute force dp strings trees | Statement | D1 | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1500.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 950 | Misha and Paintings | constructive algorithms math | Statement | E | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 2750.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 22404 | Interesting Sum | data structures greedy math | Statement | B | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1000.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 18218 | Corners | greedy implementation | Statement | C | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1250.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 24337 | Burenka Plays with Fractions | math number theory | Statement | A | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 500.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 2548 | Prefix Function Queries | bitmasks brute force data structures hashing string suffix structures strings trees | Statement | E | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 14547 | Min-Max Array Transformation | binary search greedy two pointers | Statement | C | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 7669 | Maximum AND | bitmasks brute force divide and conquer greedy math sortings | Statement | D | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 513 | Matching Reduction | graph matchings interactive | Statement | F | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 28290 | Image | data structures implementation | Statement | A | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 23866 | Deadly Laser | brute force implementation | Statement | B | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 26511 | Line | greedy sortings | Statement | D | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1100 | |
| 14133 | Even-Odd XOR | bitmasks constructive algorithms greedy | Statement | G | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1500 | |
| 13320 | Counting Rectangles | brute force data structures dp implementation | Statement | E | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1600 | |
| 7988 | L-shapes | dfs and similar implementation | Statement | F | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1700 | |
| 36063 | Word Game | data structures implementation | Statement | C | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 800 | |
| 65351 | Spell Check | implementation | Statement | A | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 800 | |
| 56289 | Colourblindness | implementation | Statement | B | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 800 | |
| 4373 | Moving Both Hands | dp graphs shortest paths | Statement | M | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 1093 | Lemper Cooking Competition | data structures | Statement | L | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 779 | Kingdom of Criticism | data structures dsu | Statement | K | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 463 | Journey | dp trees | Statement | J | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 295 | Imitating the Key Tree | combinatorics dsu trees | Statement | I | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 3006 | Hot Black Hot White | constructive algorithms math | Statement | H | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 6687 | Garage | binary search math | Statement | G | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 1143 | Field Photography | bitmasks data structures sortings | Statement | F | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 597 | Electrical Efficiency | combinatorics data structures dp number theory trees | Statement | E | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 232 | Deducing Sortability | binary search bitmasks math | Statement | D | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 1930 | Circular Mirror | binary search combinatorics math two pointers | Statement | C | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 28008 | Basketball Together | binary search greedy sortings | Statement | B | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 10123 | Accumulation of Dominoes | math | Statement | A | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 105 | Mainak and the Bleeding Polygon | geometry implementation math | Statement | H | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 3500.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 16831 | Mainak and Interesting Sequence | bitmasks constructive algorithms math | Statement | B | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 1000.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 36354 | Mainak and Array | greedy math | Statement | A | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 500.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 131 | Late For Work | data structures greedy schedules shortest paths | Statement | F | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 2750.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 13394 | Jatayu's Balanced Bracket Sequence | data structures dsu graphs | Statement | C | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 1500.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 4151 | Edge Split | brute force constructive algorithms dfs and similar graphs probabilities trees | Statement | D | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 2000.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 1705 | Almost Perfect | combinatorics fft math | Statement | E | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 2250.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 364 | A Certain Magical Party | combinatorics greedy sortings | Statement | G | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 3250.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 2027 | Red-Black Pepper | binary search brute force greedy math number theory sortings ternary search | Statement | E | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 8232 | Letter Picking | constructive algorithms dp games | Statement | D | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 614 | Illumination | combinatorics dp | Statement | G | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 506 | Fishermen | flows graph matchings | Statement | F | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 17848 | Digital Logarithm | data structures greedy | Statement | C | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 25435 | Colored Balls: Revisited | greedy implementation sortings | Statement | A | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 20668 | Best Permutation | constructive algorithms greedy | Statement | B | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 45832 | Two Elevators | math | Statement | A | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 4546 | Kirei and the Linear Function | brute force math | Statement | F | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 21628 | Jumping on Tiles | constructive algorithms strings | Statement | C | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 7905 | Guess the Cycle Size | interactive probabilities | Statement | E | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 30590 | Friends and the Restaurant | greedy two pointers | Statement | D | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 32450 | Decode String | greedy strings | Statement | B | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 2500 | Cut Substrings | combinatorics dp hashing strings two pointers | Statement | G | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 17921 | Minimum Notation | data structures greedy math sortings | Statement | C | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 1500.0 | Codeforces Round #823 — editorial | 1200 |
| 17209 | Meeting on the Line | binary search greedy implementation math ternary search | Statement | B | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 1000.0 | Codeforces Round #823 — editorial | 1600 |
| 3021 | Prefixes and Suffixes | constructive algorithms dsu strings | Statement | D | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 2250.0 | Codeforces Round #823 — editorial | 2200 |
| 765 | 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 |
| 743 | Almost Sorted | bitmasks data structures dp | Statement | F | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 3000.0 | Codeforces Round #823 — editorial | 2700 |
| 24778 | Planets | data structures data structures greedy sortings | Statement | A | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 500.0 | Codeforces Round #823 — editorial | 800 |
| 8475 | 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 | |
| 26675 | 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 | |
| 23655 | 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 | |
| 3478 | 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 | |
| 850 | 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 | |
| 12086 | 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 | |
| 17513 | Bestie | brute force constructive algorithms implementation math number theory | Statement | A | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 750.0 | 108327 | 1000 |
| 9885 | Balance (Easy version) | brute force data structures implementation | Statement | D1 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1250.0 | 108327 | 1500 |
| 7536 | Sheikh (Easy version) | binary search bitmasks greedy two pointers | Statement | C1 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1000.0 | 108327 | 1800 |
| 3064 | 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 |
| 1588 | Balance (Hard version) | brute force data structures | Statement | D2 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1250.0 | 108327 | 2400 |
| 578 | Location | data structures dp | Statement | E | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 3000.0 | 108327 | 2800 |
| 17226 | Ugu | dp greedy | Statement | B | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 750.0 | 108327 | 900 |
| 4735 | Zero-One (Hard Version) | dp greedy | Statement | D2 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 750.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 15016 | Zero-One (Easy Version) | dp greedy math | Statement | D1 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 21064 | Rule of League | constructive algorithms math | Statement | B | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1000.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 17065 | Parity Shuffle Sorting | constructive algorithms sortings | Statement | C | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 1482 | Conveyor | dp math | Statement | E | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 2750.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 21846 | Consecutive Sum | greedy sortings | Statement | A | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 974 | 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 | |
| 7039 | 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 | |
| 22400 | Select Three Sticks | greedy math sortings | Statement | A | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 500.0 | Codeforces Round #822 (Div.2) Editorial | |
| 28492 | Removing Smallest Multiples | greedy math | Statement | C | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 1250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 3238 | Rectangular Congruence | constructive algorithms math number theory | Statement | E | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 2250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 16398 | Bright, Nice, Brilliant | constructive algorithms | Statement | B | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 750.0 | Codeforces Round #822 (Div.2) Editorial | |
| 21051 | Working Week | constructive algorithms greedy math | Statement | A | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 500.0 | Codeforces Round #824 — editorial | |
| 19301 | Tea with Tangerines | greedy math | Statement | B | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 750.0 | Codeforces Round #824 — editorial | |
| 10914 | Phase Shift | dfs and similar dsu graphs greedy strings | Statement | C | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 1250.0 | Codeforces Round #824 — editorial | |
| 253 | Pebbles and Beads | data structures dp geometry | Statement | F | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 3000.0 | Codeforces Round #824 — editorial | |
| 6760 | Meta-set | brute force combinatorics data structures hashing math | Statement | D | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 1750.0 | Codeforces Round #824 — editorial | |
| 1242 | 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 | |
| 855 | Swap and Take | dp greedy | Statement | E | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2500.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 20205 | Playing with GCD | math number theory | Statement | B | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 1000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 24127 | Make A Equal to B | sortings | Statement | A | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 500.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 1468 | 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 | |
| 16507 | 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 | |
| 2765 | Equal Binary Subsequences | constructive algorithms greedy strings | Statement | D | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 150 | Ela Takes Dancing Class | binary search binary search data structures | Statement | G | Dytechlab Cup 2022 {1737} | PROGRAMMING | 3750.0 | Editorial of Dytechlab Cup 2022 | |
| 10836 | Ela Sorting Books | greedy implementation strings | Statement | A | Dytechlab Cup 2022 {1737} | PROGRAMMING | 500.0 | Editorial of Dytechlab Cup 2022 | |
| 10182 | 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 | |
| 1074 | Ela Goes Hiking | dp probabilities | Statement | E | Dytechlab Cup 2022 {1737} | PROGRAMMING | 2750.0 | Editorial of Dytechlab Cup 2022 | |
| 2101 | Ela and the Wiring Wizard | graphs greedy shortest paths | Statement | D | Dytechlab Cup 2022 {1737} | PROGRAMMING | 2000.0 | Editorial of Dytechlab Cup 2022 | |
| 157 | Ela and Prime GCD | constructive algorithms math number theory | Statement | F | Dytechlab Cup 2022 {1737} | PROGRAMMING | 3500.0 | Editorial of Dytechlab Cup 2022 | |
| 6403 | Ela and Crickets | games implementation math | Statement | C | Dytechlab Cup 2022 {1737} | PROGRAMMING | 1500.0 | Editorial of Dytechlab Cup 2022 | |
| 18739 | 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> | |
| 3741 | Permutation Addicts | constructive algorithms dfs and similar dsu graphs trees | Statement | D | Codeforces Global Round 22 {1738} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 272 | Palindrome Addicts | data structures strings | Statement | H | Codeforces Global Round 22 {1738} | PROGRAMMING | 4000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 14184 | Glory Addicts | greedy implementation | Statement | A | Codeforces Global Round 22 {1738} | PROGRAMMING | 500.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 12750 | 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> | |
| 1375 | Connectivity Addicts | constructive algorithms dsu 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> | |
| 1793 | 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> | |
| 552 | 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> | |
| 6217 | 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 | ||
| 633 | 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 | ||
| 23742 | Immobile Knight | implementation | Statement | A | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 1456 | Cleaning Robot | bitmasks dp | Statement | E | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 10072 | Card Game | combinatorics constructive algorithms dp games | Statement | C | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 24413 | Array Recovery | constructive algorithms greedy math | Statement | B | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 12309 | Bricks and Bags | constructive algorithms games greedy sortings | Statement | C | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1500.0 | Tutorial | 1400 |
| 9049 | Knowledge Cards | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1750.0 | Tutorial | 1500 |
| 5034 | 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 |
| 1066 | Conditional Mix | combinatorics dp math | Statement | F | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2500.0 | Tutorial | 2600 |
| 347 | Dangerous Laser Power | constructive algorithms dsu sortings | Statement | G | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2750.0 | Tutorial | 3100 |
| 312 | MEX Tree Manipulation | data structures trees | Statement | H | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 3000.0 | Tutorial | 3300 |
| 152 | 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 |
| 14350 | Jumbo Extra Cheese 2 | geometry greedy sortings | Statement | B | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1000.0 | Tutorial | 800 |
| 23115 | Factorise N+M | math number theory | Statement | A | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 17707 | Sending a Sequence Over the Network | dp | Statement | E | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 2896 | Multi-Colored Segments | binary search data structures math sortings | Statement | F | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 19348 | Minimize the Thickness | brute force greedy math two pointers | Statement | C | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 18308 | Masha and a Beautiful Tree | dfs and similar divide and conquer graphs sortings trees | Statement | D | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 1928 | Kirill and Company | bitmasks brute force dp graphs shortest paths | Statement | G | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 26743 | Funny Permutation | constructive algorithms math | Statement | B | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 33757 | Compare T-Shirt Sizes | implementation implementation strings | Statement | A | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 103683 | Sum | implementation | Statement | A | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 39966 | Stripes | implementation | Statement | C | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 13989 | Smaller | constructive algorithms greedy strings | Statement | F | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 38398 | Scuza | binary search greedy math | Statement | E | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 13217 | Orray | bitmasks brute force greedy math | Statement | G | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 60867 | Increasing | greedy implementation sortings | Statement | B | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 33945 | Coprime | brute force greedy number theory | Statement | D | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 20627 | 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 | |
| 8356 | 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 | |
| 1797 | 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 | |
| 1863 | FTL | binary search dp greedy | Statement | E | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 2400 | |
| 304 | Antifibonacci Cut | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 3000 | |
| 23186 | Permutation Value | greedy | Statement | B | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 800 | |
| 29500 | Password | combinatorics implementation | Statement | A | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 800 | |
| 43819 | Traffic Light | binary search implementation two pointers | Statement | C | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 28745 | Number Replacement | greedy implementation | Statement | A | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 3724 | MEX vs MED | brute force math two pointers | Statement | F | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 24886 | Even-Odd Increments | implementation math | Statement | B | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 6676 | Divisible Numbers (hard version) | brute force math number theory | Statement | E2 | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 12623 | Divisible Numbers (easy version) | brute force math number theory | Statement | E1 | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 24498 | Divisibility by 2^n | greedy math sortings | Statement | D | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 18632 | Rebellion | constructive algorithms greedy | Statement | B | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial | |
| 14026 | Permutation Operations | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial | |
| 5108 | Paths on the Tree | dfs and similar dp greedy sortings trees | Statement | D | Codeforces Global Round 23 {1746} | PROGRAMMING | 1500.0 | Codeforces Global Round 23 Editorial | |
| 112 | Olympiad Training | binary search geometry sortings | Statement | G | Codeforces Global Round 23 {1746} | PROGRAMMING | 3500.0 | Codeforces Global Round 23 Editorial | |
| 21062 | Maxmina | constructive algorithms greedy | Statement | A | Codeforces Global Round 23 {1746} | PROGRAMMING | 500.0 | Codeforces Global Round 23 Editorial | |
| 2640 | Kazaee | data structures hashing probabilities | Statement | F | Codeforces Global Round 23 {1746} | PROGRAMMING | 2500.0 | Codeforces Global Round 23 Editorial | |
| 483 | Joking (Hard Version) | dp interactive | Statement | E2 | Codeforces Global Round 23 {1746} | PROGRAMMING | 1750.0 | Codeforces Global Round 23 Editorial | |
| 1689 | Joking (Easy Version) | binary search bitmasks constructive algorithms interactive ternary search | Statement | E1 | Codeforces Global Round 23 {1746} | PROGRAMMING | 2000.0 | Codeforces Global Round 23 Editorial | |
| 5546 | Yet Another Problem | binary search bitmasks constructive algorithms data structures | Statement | D | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 1750.0 | Codeforces Round #832 (Div. 2) Editorial | |
| 26465 | Two Groups | constructive algorithms greedy | Statement | A | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 500.0 | Codeforces Round #832 (Div. 2) Editorial | |
| 23498 | Swap Game | games | Statement | C | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 1250.0 | Codeforces Round #832 (Div. 2) Editorial | |
| 660 | List Generation | combinatorics math | Statement | E | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 2500.0 | Codeforces Round #832 (Div. 2) Editorial | |
| 25918 | BAN BAN | constructive algorithms | Statement | B | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 1000.0 | Codeforces Round #832 (Div. 2) Editorial | |
| 16760 | Diverse Substrings | brute force implementation strings | Statement | B | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 1000.0 | Codeforces Round #833 (Div. 2) Editorial | 1400 |
| 12967 | Zero-Sum Prefixes | brute force data structures dp greedy implementation | Statement | C | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 1500.0 | Codeforces Round #833 (Div. 2) Editorial | 1600 |
| 3247 | ConstructOR | bitmasks chinese remainder theorem combinatorics constructive algorithms number theory | Statement | D | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 2000.0 | Codeforces Round #833 (Div. 2) Editorial | 2100 |
| 2653 | Yet Another Array Counting Problem | data structures divide and conquer dp trees | Statement | E | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 2250.0 | Codeforces Round #833 (Div. 2) Editorial | 2300 |
| 394 | Circular Xor Reversal | bitmasks constructive algorithms | Statement | F | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 2750.0 | Codeforces Round #833 (Div. 2) Editorial | 3000 |
| 25301 | The Ultimate Square | math | Statement | A | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 500.0 | Codeforces Round #833 (Div. 2) Editorial | 800 |
| 15705 | Number Game | games greedy implementation | Statement | C | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 610 | Distance to the Path | data structures dfs and similar trees | Statement | F | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 22567 | Death's Blessing | greedy | Statement | B | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 23297 | Cowardly Rooks | implementation | Statement | A | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 6351 | Counting Arrays | math number theory | Statement | D | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 2064 | Cactus Wall | dfs and similar graphs shortest paths | Statement | E | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 16809 | Maximum Substring | brute force greedy | Statement | B | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 750.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 1198 | Majority | dp strings | Statement | F | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 2500.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 17823 | Indirect Sort | constructive algorithms math | Statement | A | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 500.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 352 | Doping | dp dp math math | Statement | G | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 3250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 7343 | Count GCD | bitmasks combinatorics dp math number theory | Statement | D | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 1750.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 10477 | Complementary XOR | constructive algorithms data structures | Statement | C | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 1250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 1657 | Bracket Cost | binary search data structures divide and conquer dp greedy strings | Statement | E | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 2250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 121 | BinaryStringForces | constructive algorithms data structures | Statement | H | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 3500.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 16436 | Make Nonzero Sum (easy version) | constructive algorithms dp greedy | Statement | A1 | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 500.0 | Tutorial | 1300 |
| 11596 | Make Nonzero Sum (hard version) | constructive algorithms dp greedy | Statement | A2 | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 500.0 | Tutorial | 1500 |
| 14969 | Factorial Divisibility | greedy math | Statement | B | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 750.0 | Tutorial | 1600 |