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 ... 30 31 32 33 34 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 136 | Admissible Map | Statement | A | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | |||
| 15677 | Make it Increasing | brute force greedy math | Statement | A | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 250.0 | Codeforces Round #783 Editorial | 1300 |
| 4315 | Optimal Partition | data structures dp | Statement | B | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 1000.0 | Codeforces Round #783 Editorial | 2100 |
| 1904 | Half Queen Cover | constructive algorithms math | Statement | C | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 1500.0 | Codeforces Round #783 Editorial | 2400 |
| 800 | Edge Elimination | constructive algorithms dfs and similar dp trees | Statement | D | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 2000.0 | Codeforces Round #783 Editorial | 2900 |
| 805 | Centroid Probabilities | combinatorics dp fft math | Statement | E | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 2750.0 | Codeforces Round #783 Editorial | 3000 |
| 119 | Yin Yang | implementation | Statement | F | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 3500.0 | Codeforces Round #783 Editorial | 3500 |
| 16780 | Direction Change | implementation math | Statement | A | Codeforces Round 783 (Div. 2) {1668} | PROGRAMMING | 500.0 | Codeforces Round #783 Editorial | 800 |
| 17914 | Social Distance | greedy math sortings | Statement | B | Codeforces Round 783 (Div. 2) {1668} | PROGRAMMING | 500.0 | Codeforces Round #783 Editorial | 900 |
| 39372 | Eating Candies | binary search data structures greedy two pointers | Statement | F | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1100 | |
| 25376 | Colorful Stamp | implementation | Statement | D | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1100 | |
| 21681 | Fall Down | dfs and similar implementation | Statement | G | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1200 | |
| 21170 | 2-Letter Strings | data structures math strings | Statement | E | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1200 | |
| 28902 | Maximal AND | bitmasks greedy math | Statement | H | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1300 | |
| 55326 | Triple | implementation sortings | Statement | B | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 800 | |
| 41381 | Odd/Even Increments | greedy greedy implementation math | Statement | C | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 800 | |
| 88095 | Division? | implementation | Statement | A | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 800 | |
| 13427 | Dorms War | brute force implementation strings | Statement | B | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 1000.0 | Tutorial | 1100 |
| 10984 | Where is the Pizza? | data structures dfs and similar dsu graphs implementation math | Statement | C | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 1750.0 | Tutorial | 1400 |
| 5605 | Very Suspicious | binary search brute force geometry implementation math | Statement | D | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2250.0 | Tutorial | 1700 |
| 1937 | Hemose on the Tree | bitmasks constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2750.0 | Tutorial | 2200 |
| 1258 | Jee, You See? | bitmasks combinatorics dp | Statement | F | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 3000.0 | Tutorial | 2400 |
| 15990 | Prof. Slim | greedy implementation sortings | Statement | A | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 21380 | String Building | implementation | Statement | A | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 3164 | Preorder | combinatorics divide and conquer dp dsu hashing trees | Statement | E | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 423 | Permutation Counting | brute force combinatorics dp fft math | Statement | F | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 8447 | Insert a Progression | brute force constructive algorithms greedy | Statement | D | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 25278 | Dolce Vita | binary search brute force greedy math | Statement | C | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 19724 | Consecutive Points Segment | brute force math sortings | Statement | B | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 14029 | Unequal Array | constructive algorithms greedy implementation | Statement | C | Codeforces Global Round 20 {1672} | PROGRAMMING | 750.0 | Global Round 20 Editorial | 1100 |
| 6936 | Cyclic Rotation | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Global Round 20 {1672} | PROGRAMMING | 1000.0 | Global Round 20 Editorial | 1700 |
| 3532 | Array Shuffling | constructive algorithms graphs greedy | Statement | F1 | Codeforces Global Round 20 {1672} | PROGRAMMING | 1250.0 | Global Round 20 Editorial | 2000 |
| 2516 | notepad.exe | binary search constructive algorithms greedy interactive | Statement | E | Codeforces Global Round 20 {1672} | PROGRAMMING | 1500.0 | Global Round 20 Editorial | 2200 |
| 1129 | Zigu Zagu | constructive algorithms greedy | Statement | H | Codeforces Global Round 20 {1672} | PROGRAMMING | 3000.0 | Global Round 20 Editorial | 2700 |
| 935 | Checker for Array Shuffling | constructive algorithms dfs and similar graphs | Statement | F2 | Codeforces Global Round 20 {1672} | PROGRAMMING | 1250.0 | Global Round 20 Editorial | 2800 |
| 252 | PermutationForces | data structures greedy | Statement | I | Codeforces Global Round 20 {1672} | PROGRAMMING | 4000.0 | Global Round 20 Editorial | 3000 |
| 443 | Cross Xor | graphs math | Statement | G | Codeforces Global Round 20 {1672} | PROGRAMMING | 2750.0 | Global Round 20 Editorial | 3200 |
| 16811 | Log Chopping | constructive algorithms games implementation math | Statement | A | Codeforces Global Round 20 {1672} | PROGRAMMING | 250.0 | Global Round 20 Editorial | 800 |
| 16456 | I love AAAB | constructive algorithms implementation | Statement | B | Codeforces Global Round 20 {1672} | PROGRAMMING | 500.0 | Global Round 20 Editorial | 800 |
| 19135 | Subtle Substring Subtraction | games greedy strings | Statement | A | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 500.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 801 | Power or XOR? | combinatorics math number theory | Statement | E | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 2750.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 17951 | Palindrome Basis | dp math number theory | Statement | C | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 1500.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 3623 | Lost Arithmetic Progression | combinatorics implementation math number theory | Statement | D | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 2000.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 21675 | A Perfectly Balanced String? | brute force greedy strings | Statement | B | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 750.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 958 | Anti-Theft Road Planning | bitmasks constructive algorithms divide and conquer greedy interactive math | Statement | F | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 3250.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 2900 | Remove Directed Edges | dfs and similar dp graphs | Statement | G | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 27948 | Number Transformation | constructive algorithms math | Statement | A | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 26315 | Infinite Replacement | combinatorics implementation strings | Statement | C | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 29380 | Dictionary | combinatorics math | Statement | B | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 5679 | Desktop Rearrangement | data structures greedy implementation | Statement | F | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 7297 | Breaking the Wall | binary search brute force constructive algorithms greedy math | Statement | E | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 17782 | A-B-C Sort | constructive algorithms implementation sortings | Statement | D | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 6249 | Vlad and Unfinished Business | dfs and similar dp greedy trees | Statement | F | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 14753 | Vertical Paths | graphs implementation trees | Statement | D | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 2120 | Sorting Pancakes | dp | Statement | G | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 12075 | Replace With the Previous, Minimize | dsu greedy strings | Statement | E | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 43081 | Make It Increasing | dp greedy | Statement | B | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 36751 | Food for Animals | math | Statement | A | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 19281 | Detective Task | dp greedy | Statement | C | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 29239 | X-Sum | brute force greedy implementation | Statement | D | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 23858 | White-Black Balanced Subtrees | dfs and similar dp graphs trees | Statement | G | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 34563 | Most Similar Words | brute force greedy implementation implementation math strings | Statement | C | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 13219 | Maximum Crossings (Hard Version) | data structures divide and conquer sortings | Statement | H2 | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 16299 | Maximum Crossings (Easy Version) | brute force | Statement | H1 | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 87049 | Lucky? | implementation | Statement | A | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 20030 | Longest Strike | data structures greedy implementation sortings two pointers | Statement | F | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 60416 | Equal Candies | greedy math sortings | Statement | B | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 32886 | Eating Queries | binary search greedy sortings | Statement | E | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 4077 | Tokitsukaze and Two Colorful Tapes | constructive algorithms dfs and similar dsu graphs greedy | Statement | C | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 1250.0 | Tutorial | |
| 9348 | Tokitsukaze and Strange Inequality | data structures dp | Statement | A | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 500.0 | Tutorial | |
| 1456 | Tokitsukaze and Permutations | dp math | Statement | D | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 2000.0 | Tutorial | |
| 4546 | Tokitsukaze and Meeting | implementation math | Statement | B | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 1250.0 | Tutorial | |
| 110 | Tokitsukaze and Gems | dp math | Statement | F | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 3500.0 | Tutorial | |
| 659 | Tokitsukaze and Beautiful Subsegments | data structures | Statement | E | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 2500.0 | Tutorial | |
| 7349 | Tokitsukaze and Good 01-String (hard version) | dp implementation | Statement | B2 | Codeforces Round 789 (Div. 2) {1678} | PROGRAMMING | 1000.0 | Codeforces Round 789 Chinese Tutorial.pdf | |
| 16608 | Tokitsukaze and Good 01-String (easy version) | implementation | Statement | B1 | Codeforces Round 789 (Div. 2) {1678} | PROGRAMMING | 750.0 | Codeforces Round 789 Chinese Tutorial.pdf | |
| 19169 | Tokitsukaze and All Zero Sequence | implementation | Statement | A | Codeforces Round 789 (Div. 2) {1678} | PROGRAMMING | 500.0 | Codeforces Round 789 Chinese Tutorial.pdf | |
| 1414 | Typical Party in Dorm | bitmasks brute force combinatorics dp strings two pointers | Statement | E | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 2250.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 5811 | Toss a Coin to Your Graph... | binary search dfs and similar dp graphs | Statement | D | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 1750.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 27310 | Stone Age Problem | data structures implementation | Statement | B | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 1000.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 11713 | Rooks Defenders | data structures implementation | Statement | C | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 1500.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 772 | Formalism for Formalism | bitmasks dp math | Statement | F | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 3000.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 39878 | AvtoBus | brute force greedy math number theory | Statement | A | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 500.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 19077 | Robots | implementation | Statement | B | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 4331 | Moving Chips | binary search bitmasks dp greedy | Statement | E | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 22346 | Minimums and Maximums | math | Statement | A | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 897 | Lenient Vertex Cover | data structures dfs and similar divide and conquer dsu graphs | Statement | F | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 1347 | Dog Walking | brute force greedy math | Statement | D | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 11106 | Binary String | binary search greedy two pointers | Statement | C | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 18715 | Double Sort | implementation sortings | Statement | C | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 1200 | |
| 10744 | Required Length | brute force dfs and similar dp hashing shortest paths | Statement | D | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 1700 | |
| 2304 | Unique Occurrences | data structures dfs and similar divide and conquer dp dsu trees | Statement | F | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 2300 | |
| 934 | Labyrinth Adventures | data structures dp greedy matrices shortest paths | Statement | E | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 2600 | |
| 21681 | Game with Cards | games greedy | Statement | A | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 800 | |
| 21019 | Card Trick | implementation math | Statement | B | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 800 | |
| 747 | Unordered Swaps | constructive algorithms dfs and similar graphs greedy math sortings | Statement | E | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2500.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 19960 | Palindromic Indices | greedy strings | Statement | A | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 750.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 393 | MCMF? | data structures flows graphs greedy sortings two pointers | Statement | F | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2750.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 16462 | LIS or Reverse LIS? | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 1500.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 3723 | Circular Spanning Tree | constructive algorithms trees | Statement | D | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2000.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 26250 | AND Sorting | bitmasks constructive algorithms sortings | Statement | B | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 1000.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 13265 | Column Swapping | constructive algorithms implementation sortings | Statement | C | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 1250.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 1400 |
| 10745 | Traps | constructive algorithms greedy sortings | Statement | D | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 1500.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 1700 |
| 3623 | MEX vs DIFF | brute force constructive algorithms data structures greedy two pointers | Statement | E | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 1750.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 2100 |
| 1122 | Diverse Segments | data structures two pointers | Statement | F | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 2000.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 2600 |
| 779 | Euclid Guess | constructive algorithms flows graph matchings math number theory | Statement | G | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 2500.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 2800 |
| 275 | Hard Cut | constructive algorithms divide and conquer math | Statement | H | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 3250.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 3400 |
| 21836 | Z mod X = C | constructive algorithms math | Statement | B | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 750.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 800 |
| 24930 | Digit Minimization | constructive algorithms games math | Statement | A | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 500.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 800 |
| 18583 | Circular Local MiniMax | constructive algorithms greedy sortings | Statement | A | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 500.0 | 103198 | 1100 |
| 3668 | Linguistics | greedy implementation strings | Statement | B | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 1000.0 | 103198 | 2000 |
| 1337 | Bring Balance | constructive algorithms greedy | Statement | C | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 1500.0 | 103198 | 2600 |
| 510 | Permutation Weight (Easy Version) | constructive algorithms dfs and similar dsu | Statement | D1 | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 1500.0 | 103198 | 2800 |
| 196 | The Ultimate LIS Problem | data structures | Statement | E | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 3500.0 | 103198 | 3500 |
| 132 | Permutation Weight (Hard Version) | constructive algorithms greedy | Statement | D2 | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 1500.0 | 103198 | 3500 |
| 19332 | Odd Subarrays | dp greedy | Statement | B | Codeforces Round 794 (Div. 2) {1686} | PROGRAMMING | 1000.0 | 103198 | |
| 21238 | Everything Everywhere All But One | greedy | Statement | A | Codeforces Round 794 (Div. 2) {1686} | PROGRAMMING | 500.0 | 103198 | |
| 11389 | The Enchanted Forest | constructive algorithms greedy math | Statement | A | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 796 | |
| 1681 | Sanae and Giant Robot | brute force constructive algorithms data structures dfs and similar dsu | Statement | C | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 796 | |
| 4135 | Railway System | constructive algorithms dsu graphs greedy interactive sortings | Statement | B | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 796 | |
| 109 | Koishi's Unconscious Permutation | fft math | Statement | F | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 796 | |
| 732 | Cute number | binary search brute force implementation math | Statement | D | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 796 | |
| 309 | Become Big For Me | combinatorics constructive algorithms math number theory | Statement | E | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 796 | |
| 18998 | Patchouli's Magical Talisman | bitmasks constructive algorithms greedy sortings | Statement | B | Codeforces Round 796 (Div. 2) {1688} | PROGRAMMING | 750.0 | Tutorial | |
| 8737 | Manipulating History | math strings | Statement | C | Codeforces Round 796 (Div. 2) {1688} | PROGRAMMING | 1250.0 | Tutorial | |
| 23453 | Cirno's Perfect Bitmasks Classroom | bitmasks brute force constructive algorithms | Statement | A | Codeforces Round 796 (Div. 2) {1688} | PROGRAMMING | 500.0 | Tutorial | |
| 19058 | Mystic Permutation | data structures greedy implementation | Statement | B | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 750.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 17723 | Lex String | brute force greedy implementation sortings two pointers | Statement | A | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 500.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 4736 | Lena and Matrix | brute force data structures dp shortest paths | Statement | D | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 1750.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 13434 | Infected Tree | constructive algorithms dfs and similar dp greedy trees | Statement | C | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 1360 | ANDfinity | bitmasks brute force constructive algorithms dfs and similar dsu graphs | Statement | E | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 46723 | Black and White Stripe | implementation two pointers | Statement | D | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 1000 | |
| 16965 | Price Maximization | binary search greedy math two pointers | Statement | E | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 1500 | |
| 8854 | Shifting String | graphs math number theory strings | Statement | F | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 1700 | |
| 4121 | Count the Trains | binary search data structures sortings | Statement | G | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 2000 | |
| 28052 | Restoring the Duration of Tasks | data structures greedy implementation | Statement | C | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 800 | |
| 35596 | Print a Pedestal (Codeforces logo?) | constructive algorithms greedy | Statement | A | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 800 | |
| 26916 | Array Decrements | greedy implementation | Statement | B | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 800 | |
| 17202 | Sum of Substrings | brute force constructive algorithms greedy math strings | Statement | C | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 1250.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 35163 | Shoe Shuffling | constructive algorithms greedy implementation two pointers | Statement | B | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 2092 | Number of Groups | data structures dfs and similar dsu graphs greedy sortings | Statement | E | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 2250.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 7458 | Max GEQ Sum | binary search constructive algorithms data structures divide and conquer implementation sortings two pointers | Statement | D | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 1750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 1131 | K-Set Tree | combinatorics dfs and similar dp math trees | Statement | F | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 2750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 32118 | Beat The Odds | constructive algorithms greedy math | Statement | A | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 500.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 38813 | Where's the Bishop? | implementation | Statement | C | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 21621 | The Clock | brute force implementation | Statement | D | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 85405 | Marathon | implementation | Statement | A | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 9556 | Gambling | data structures dp math | Statement | H | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 33119 | Binary Deque | binary search implementation two pointers | Statement | E | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 39355 | All Distinct | greedy sortings | Statement | B | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 27081 | 3SUM | brute force math | Statement | F | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 26309 | 2^Sort | data structures dp sortings two pointers | Statement | G | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 17430 | Directional Increase | greedy | Statement | A | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 750.0 | Codeforces Round #800 Editorial | 1300 |
| 9578 | Fake Plastic Trees | dfs and similar dp greedy trees | Statement | B | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 1000.0 | Codeforces Round #800 Editorial | 1700 |
| 3183 | Keshi in Search of AmShZ | graphs greedy shortest paths | Statement | C | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 1500.0 | Codeforces Round #800 Editorial | 2300 |
| 1106 | Decinc Dividing | brute force data structures divide and conquer dp greedy | Statement | D | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 2250.0 | Codeforces Round #800 Editorial | 2800 |
| 558 | Outermost Maximums | data structures greedy | Statement | E | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 2500.0 | Codeforces Round #800 Editorial | 3400 |
| 615 | I Might Be Wrong | greedy | Statement | F | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 3000.0 | Codeforces Round #800 Editorial | 3400 |
| 20644 | Paranoid String | constructive algorithms greedy | Statement | B | Codeforces Round 800 (Div. 2) {1694} | PROGRAMMING | 1000.0 | Codeforces Round #800 Editorial | 1200 |
| 23516 | Creep | greedy implementation | Statement | A | Codeforces Round 800 (Div. 2) {1694} | PROGRAMMING | 500.0 | Codeforces Round #800 Editorial | 800 |
| 14001 | Zero Path | brute force data structures dp greedy shortest paths | Statement | C | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 2288 | Tree Queries (Hard Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D2 | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 2453 | Tree Queries (Easy Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D1 | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 16787 | Subrectangle Guess | games | Statement | A | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 500.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 19956 | Circle Game | games | Statement | B | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 750.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 512 | Ambiguous Dominoes | constructive algorithms dfs and similar graphs | Statement | E | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 1130 | Tree Recovery | bitmasks brute force constructive algorithms dfs and similar dsu graphs trees | Statement | F | Codeforces Global Round 21 {1696} | PROGRAMMING | 2500.0 | Editorial of Codeforces Global Round 21 | |
| 4892 | Placing Jinas | combinatorics math | Statement | E | Codeforces Global Round 21 {1696} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round 21 | |
| 6006 | Permutation Graph | binary search constructive algorithms data structures greedy shortest paths trees | Statement | D | Codeforces Global Round 21 {1696} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round 21 | |
| 20176 | NIT orz! | bitmasks greedy | Statement | A | Codeforces Global Round 21 {1696} | PROGRAMMING | 500.0 | Editorial of Codeforces Global Round 21 | |
| 36122 | NIT Destroys the Universe | greedy | Statement | B | Codeforces Global Round 21 {1696} | PROGRAMMING | 1000.0 | Editorial of Codeforces Global Round 21 | |
| 203 | Maximum Product? | brute force combinatorics dp greedy math two pointers | Statement | H | Codeforces Global Round 21 {1696} | PROGRAMMING | 4000.0 | Editorial of Codeforces Global Round 21 | |
| 320 | Fishingprince Plays With Array Again | data structures | Statement | G | Codeforces Global Round 21 {1696} | PROGRAMMING | 3250.0 | Editorial of Codeforces Global Round 21 | |
| 12579 | Fishingprince Plays With Array | constructive algorithms greedy implementation | Statement | C | Codeforces Global Round 21 {1696} | PROGRAMMING | 1500.0 | Editorial of Codeforces Global Round 21 | |
| 713 | Too Many Constraints | 2-sat | Statement | F | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 30829 | Promo | greedy sortings | Statement | B | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 26729 | Parkway Walk | greedy implementation | Statement | A | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 4988 | Guess The String | binary search brute force constructive algorithms dsu interactive | Statement | D | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 1449 | Coloring | brute force combinatorics constructive algorithms dfs and similar dp dsu graphs implementation | Statement | E | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 15789 | awoo's Favorite Problem | constructive algorithms data structures dp greedy implementation strings two pointers | Statement | C | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 32807 | XOR Mixup | bitmasks brute force | Statement | A | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 250.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 21459 | Rising Sand | constructive algorithms greedy implementation | Statement | B | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 1785 | PermutationForces II | binary search brute force combinatorics constructive algorithms greedy sortings | Statement | E | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 2000.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 383 | Long Binary String | math matrices meet-in-the-middle number theory | Statement | G | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 3250.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 12048 | Fixed Point Guessing | binary search constructive algorithms interactive | Statement | D | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 1500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 756 | Equal Reversal | constructive algorithms graphs math | Statement | F | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 2500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 19738 | 3SUM Closure | brute force data structures | Statement | C | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 1000.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 1372 | Three Days Grace | dp math two pointers | Statement | E | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 2500.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 24769 | The Third Three Number Problem | constructive algorithms math | Statement | A | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 500.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 10716 | The Third Problem | combinatorics math two pointers | Statement | C | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 1500.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 3512 | Almost Triple Deletions | data structures dp greedy | Statement | D | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 1750.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 21679 | Almost Ternary Matrix | 2-sat bitmasks constructive algorithms matrices | Statement | B | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 1000.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 19873 | Palindromic Numbers | constructive algorithms implementation math | Statement | B | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1000.0 | 103978 | 1100 |
| 12141 | Helping the Nature | constructive algorithms greedy | Statement | C | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1500.0 | 103978 | 1700 |
| 6982 | River Locks | binary search dp greedy math | Statement | D | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1750.0 | 103978 | 1900 |
| 954 | Serega the Pirate | brute force constructive algorithms | Statement | E | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 2500.0 | 103978 | 2600 |
| 1055 | Puzzle | dp greedy | Statement | F | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 3000.0 | 103978 | 2600 |
| 23656 | Optimal Path | dp greedy math | Statement | A | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 500.0 | 103978 | 800 |
| 1344 | Text Editor | brute force dp greedy strings two pointers | Statement | E | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 23731 | Schedule Management | binary search greedy | Statement | C | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 1125 | Points | combinatorics data structures math matrices | Statement | F | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 6265 | Permutation Restoration | binary search data structures greedy math sortings | Statement | D | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 20803 | Permutation | greedy | Statement | B | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 27523 | Grass Field | implementation | Statement | A | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 25025 | Train and Queries | data structures greedy | Statement | C | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 17765 | Split Into Two Sets | dfs and similar dsu graph matchings graphs | Statement | E | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 38143 | Round Down the Price | constructive algorithms | Statement | A | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 29284 | Polycarp Writes a String from Memory | greedy | Statement | B | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 5763 | Passable Paths (hard version) | bitmasks data structures dfs and similar dp sortings trees | Statement | G2 | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 6327 | Passable Paths (easy version) | data structures dfs and similar sortings trees | Statement | G1 | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 25907 | Not a Cheap String | greedy | Statement | D | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 9437 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 29880 | Yet Another Problem About Pairs Satisfying an Inequality | binary search data structures dp greedy sortings | Statement | F | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 96777 | YES or YES? | implementation strings | Statement | A | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 27456 | Mirror Grid | implementation | Statement | E | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 65880 | ICPC Balloons | data structures implementation | Statement | B | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 12709 | Good Key, Bad Key | bitmasks brute force dp greedy math | Statement | G | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 29150 | Double Strings | brute force data structures strings | Statement | D | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 40771 | Cypher | implementation strings | Statement | C | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 24655 | Virus | greedy sortings | Statement | C | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 1250.0 | CodeTON Round 2 Editorial | |
| 16645 | Two 0-1 Sequences | constructive algorithms greedy | Statement | A | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 500.0 | CodeTON Round 2 Editorial | |
| 133 | Mio and Lucky Array | constructive algorithms fft math strings | Statement | G | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 3500.0 | CodeTON Round 2 Editorial | |
| 5378 | Magical Array | constructive algorithms hashing math | Statement | D | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 1750.0 | CodeTON Round 2 Editorial | |
| 29772 | Luke is a Foodie | greedy | Statement | B | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 750.0 | CodeTON Round 2 Editorial | |
| 110 | Game of AI (hard version) | combinatorics fft math | Statement | H2 | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 2750.0 | CodeTON Round 2 Editorial | |
| 237 | Game of AI (easy version) | combinatorics fft math | Statement | H1 | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 2250.0 | CodeTON Round 2 Editorial | |
| 2672 | Count Seconds | brute force constructive algorithms dp graphs | Statement | E | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 2000.0 | CodeTON Round 2 Editorial | |
| 1300 | Colouring Game | constructive algorithms games | Statement | F | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 2750.0 | CodeTON Round 2 Editorial | |
| 26560 | Mark the Photographer | greedy | Statement | A | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 500.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 25390 | Mark the Dust Sweeper | greedy implementation | Statement | B | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 1000.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 693 | Mark and the Online Exam | bitmasks constructive algorithms interactive math probabilities | Statement | F | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 3000.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 2450 | Mark and Professor Koro | binary search bitmasks combinatorics data structures greedy | Statement | E | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 2500.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 7147 | Mark and Lightbulbs | combinatorics constructive algorithms math sortings | Statement | D | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 1750.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 14565 | Mark and His Unfinished Essay | brute force implementation | Statement | C | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 1250.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 3697 | Qpwoeirut and Vertices | binary search data structures dsu trees | Statement | E | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 2250.0 | Codeforces Round #809 Editorial | |
| 16131 | Qpwoeirut And The City | dp greedy implementation | Statement | C | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1250.0 | Codeforces Round #809 Editorial | |
| 17478 | Making Towers | dp greedy math | Statement | B | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 1939 | Chopping Carrots (Hard Version) | constructive algorithms dp number theory two pointers | Statement | D2 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1250.0 | Codeforces Round #809 Editorial | |
| 7710 | Chopping Carrots (Easy Version) | binary search brute force constructive algorithms dp greedy number theory | Statement | D1 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 24242 | Another String Minimization Problem | greedy strings | Statement | A | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 500.0 | Codeforces Round #809 Editorial | |
| 933 | Replace | data structures | Statement | E | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 2500.0 | 104930 | |
| 889 | Partial Virtual Trees | combinatorics dp math trees | Statement | D | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1750.0 | 104930 | |
| 15424 | Doremy's IQ | binary search greedy implementation | Statement | A | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 500.0 | 104930 | |
| 6391 | Difference Array | brute force implementation math sortings | Statement | B | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 750.0 | 104930 | |
| 1895 | DFS Trees | data structures dfs and similar dsu graphs greedy trees | Statement | C | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1250.0 | 104930 | |
| 174 | Bugaboo | bitmasks constructive algorithms dp number theory | Statement | F | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 3250.0 | 104930 | |
| 22570 | Difference Operations | greedy math | Statement | A | Codeforces Round 808 (Div. 2) {1708} | PROGRAMMING | 500.0 | 104930 | |
| 28295 | Difference of GCDs | constructive algorithms math | Statement | B | Codeforces Round 808 (Div. 2) {1708} | PROGRAMMING | 1000.0 | 104930 | |
| 3931 | XOR Tree | data structures dfs and similar dsu greedy trees | Statement | E | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 31575 | Three Doors | brute force dfs and similar math | Statement | A | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 |