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 4 5 6 7 8 9 10 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 19239 | Reverse Sort | greedy sortings | Statement | B | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 1000.0 | tutorial | 1000 |
| 3244 | Treelabeling | bitmasks constructive algorithms dfs and similar games graphs greedy trees | Statement | D | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2000.0 | tutorial | 2100 |
| 18113 | Blue-Red Permutation | greedy math sortings | Statement | D | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 1420 | Banquet Preparations 2 | greedy sortings | Statement | H | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 7352 | Game Master | data structures dfs and similar dp graphs greedy two pointers | Statement | C | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 8374 | Social Network | dsu graphs greedy implementation trees | Statement | D | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 2000.0 | Deltix Round, Autumn 2021. Editorial | 1600 |
| 484 | A Stroll Around the Matrix | data structures greedy math | Statement | G | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 3250.0 | Deltix Round, Autumn 2021. Editorial | 3000 |
| 18867 | Divide and Multiply | greedy implementation math number theory | Statement | A | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 500.0 | Deltix Round, Autumn 2021. Editorial | 900 |
| 1922 | AmShZ and G.O.A.T. | binary search brute force greedy math | Statement | E | Codeforces Global Round 17 {1610} | PROGRAMMING | 2500.0 | Codeforces Global Round 17 Editorial | |
| 627 | Squid Game | data structures dfs and similar divide and conquer greedy trees | Statement | H | Codeforces Global Round 17 {1610} | PROGRAMMING | 3500.0 | Codeforces Global Round 17 Editorial | |
| 23214 | Kalindrome Array | greedy two pointers | Statement | B | Codeforces Global Round 17 {1610} | PROGRAMMING | 1000.0 | Codeforces Global Round 17 Editorial | |
| 8333 | Escape The Maze (easy version) | dfs and similar greedy shortest paths trees two pointers | Statement | E1 | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1700 | |
| 4311 | Escape The Maze (hard version) | dfs and similar dp greedy shortest paths trees two pointers | Statement | E2 | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 2000 | |
| 692 | Armor and Weapons | brute force dp greedy shortest paths | Statement | F | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 998 | Max Sum Array | combinatorics constructive algorithms greedy sortings | Statement | G | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 2806 | Messages | greedy math probabilities sortings | Statement | E | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 17877 | And It's Non-Zero | bitmasks greedy math | Statement | B | Codeforces Global Round 18 {1615} | PROGRAMMING | 1000.0 | Global Round 18 Editorial | |
| 9180 | Menorah | brute force graphs greedy math | Statement | C | Codeforces Global Round 18 {1615} | PROGRAMMING | 1750.0 | Global Round 18 Editorial | |
| 1697 | Purple Crayon | dp games greedy math trees | Statement | E | Codeforces Global Round 18 {1615} | PROGRAMMING | 2750.0 | Global Round 18 Editorial | |
| 21569 | Closing The Gap | greedy math | Statement | A | Codeforces Global Round 18 {1615} | PROGRAMMING | 250.0 | Global Round 18 Editorial | |
| 20678 | Mirror in the String | greedy strings | Statement | B | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 1000.0 | Good Bye 2021 -- Editorial | 1100 |
| 5556 | Keep the Average High | dp greedy math | Statement | D | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 2000.0 | Good Bye 2021 -- Editorial | 2000 |
| 2711 | Lexicographically Small Enough | data structures greedy strings | Statement | E | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 2500.0 | Good Bye 2021 -- Editorial | 2200 |
| 15988 | Paprika and Permutation | greedy math | Statement | C | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 1923 | Trader Problem | binary search data structures dsu greedy math sortings | Statement | G | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 20861 | Array and Operations | dp greedy math | Statement | D | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 8440 | New Year's Problem | binary search brute force greedy sortings | Statement | D | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 10189 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 7264 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 9623 | Replace the Numbers | data structures dsu greedy trees | Statement | E | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 31254 | Triangles on a Rectangle | geometry greedy math | Statement | B | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1915 | New School | binary search data structures greedy implementation sortings | Statement | E | Hello 2022 {1621} | PROGRAMMING | 2250.0 | ||
| 4389 | The Winter Hike | constructive algorithms greedy math | Statement | D | Hello 2022 {1621} | PROGRAMMING | 1750.0 | ||
| 14538 | Integers Shop | data structures greedy implementation | Statement | B | Hello 2022 {1621} | PROGRAMMING | 1000.0 | ||
| 15498 | Set or Decrease | binary search greedy ternary search | Statement | C | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 22297 | Berland Music | greedy sortings | Statement | B | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 1255 | Middle Duplication | data structures dfs and similar greedy strings trees | Statement | E | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 2750.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 19042 | Palindromes Coloring | binary search greedy sortings strings | Statement | D | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 26797 | Division by Two and Permutation | constructive algorithms flows graph matchings greedy math | Statement | C | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 18275 | Ancient Civilization | bitmasks greedy math | Statement | A | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 11796 | Monsters And Spells | data structures dp fft greedy implementation two pointers | Statement | C | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 1852 | Black and White Tree | dp greedy trees | Statement | E | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 23917 | Minor Reduction | greedy greedy strings strings | Statement | B | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 17540 | Not Sitting | games greedy sortings | Statement | B | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1250.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 16956 | Meximum Array | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 500.0 | 99276 | |
| 3572 | Grid Xor | constructive algorithms greedy implementation interactive math | Statement | C | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 1250.0 | 99276 | |
| 12683 | Peculiar Movie Preferences | greedy strings | Statement | B | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 750.0 | 99276 | |
| 25236 | GCD Arrays | greedy math number theory | Statement | B | Codeforces Round 767 (Div. 2) {1629} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #767 | |
| 30889 | Download More RAM | greedy sortings | Statement | A | Codeforces Round 767 (Div. 2) {1629} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #767 | |
| 6474 | Range and Partition | binary search data structures greedy two pointers | Statement | B | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 3321 | Paint the Middle | data structures dp greedy sortings | Statement | C | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 1943 | Flipping Range | dp greedy number theory | Statement | D | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #768 | |
| 14052 | Strange Test | binary search bitmasks brute force greedy math | Statement | C | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 5314 | New Year Concert | binary search data structures dp greedy math number theory two pointers | Statement | D | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #769 | |
| 18578 | Make Them Equal | dp greedy shortest paths | Statement | D | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 4714 | Finding Zero | constructive algorithms greedy interactive | Statement | D | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2000.0 | Codeforces Round #770 (Div. 2) editorial | |
| 2722 | Cars | constructive algorithms dfs and similar dsu graphs greedy sortings | Statement | E | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 15452 | MEX and Array | brute force dp greedy math | Statement | B | Codeforces Global Round 19 {1637} | PROGRAMMING | 1000.0 | Tutorial | |
| 2158 | Towers | constructive algorithms dfs and similar dp greedy trees | Statement | F | Codeforces Global Round 19 {1637} | PROGRAMMING | 3250.0 | Tutorial | |
| 4721 | Big Brush | dfs and similar greedy implementation | Statement | D | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 1750.0 | Codeforces Round #771 Editorial | |
| 22140 | Reverse | greedy math | Statement | A | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 500.0 | Codeforces Round #771 Editorial | |
| 18967 | Great Sequence | brute force greedy sortings | Statement | A | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 500.0 | Codeforces Round #773 editorial | |
| 659 | Playing Around the Table | constructive algorithms greedy implementation | Statement | F | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 3000.0 | Codeforces Round #774 (Div. 2) Editorial | 2900 |
| 22656 | Quality vs Quantity | brute force constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 1000.0 | Codeforces Round #774 (Div. 2) Editorial | 800 |
| 1097 | Madoka and the Sixth-graders | dfs and similar greedy trees | Statement | E | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 2500.0 | Codeforces Round #777 Editorial | |
| 13945 | Game of Ball Passing | greedy implementation | Statement | B | Codeforces Round 775 (Div. 2, based on Moscow Open Olympiad in Informatics) {1649} | PROGRAMMING | 1000.0 | Codeforces Round #775 Editorial | |
| 4458 | Rescheduling the Exam | binary search data structures greedy implementation math sortings | Statement | E | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 18478 | Weight of the System of Nested Segments | greedy hashing implementation sortings | Statement | C | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 616 | Sum of Matchings | dfs and similar greedy implementation math | Statement | E | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 14494 | Alice and the Cake | constructive algorithms data structures greedy sortings | Statement | C | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 1400 |
| 454 | Snowy Mountain | data structures graphs greedy shortest paths trees | Statement | G | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2900 |
| 19379 | Maximum Cake Tastiness | greedy implementation sortings | Statement | A | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 800 |
| 1213 | Parametric MST | binary search graphs greedy math ternary search | Statement | F | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3000.0 | Tutorial | |
| 17676 | Bracket Sequence Deletion | greedy hashing | Statement | C | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 12016 | Bit Flipping | bitmasks constructive algorithms greedy strings | Statement | B | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 750.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 4444 | Reverse Sort Sum | constructive algorithms data structures greedy implementation math two pointers | Statement | D | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2000.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 30710 | Red Versus Blue | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 14955 | Line Empire | dp greedy implementation math | Statement | C | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 1500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 8082 | Matrix and Shifts | constructive algorithms greedy implementation | Statement | E | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 21968 | Get an Even String | dp greedy strings | Statement | C | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 10481 | Water the Trees | binary search greedy math | Statement | C | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 805 | Teleporters | binary search greedy math | Statement | F | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 20581 | Getting Zero | brute force dfs and similar graphs greedy shortest paths | Statement | B | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 5383 | Progressions Covering | data structures greedy implementation | Statement | D | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 19337 | Array Balancing | greedy math | Statement | A | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 152 | Toys | greedy greedy strings strings | Statement | B | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 1793 | MinimizOR | binary search bitmasks data structures dp greedy implementation | Statement | E | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 2250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 9837 | Tree Infection | binary search dfs and similar greedy trees | Statement | C | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 1250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 32648 | Array Cloning Technique | constructive algorithms greedy sortings | Statement | B | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 750.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 15672 | Make it Increasing | brute force greedy math | Statement | A | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 250.0 | Codeforces Round #783 Editorial | 1300 |
| 17912 | Social Distance | greedy math sortings | Statement | B | Codeforces Round 783 (Div. 2) {1668} | PROGRAMMING | 500.0 | Codeforces Round #783 Editorial | 900 |
| 39280 | Eating Candies | binary search data structures greedy two pointers | Statement | F | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1100 | |
| 28851 | Maximal AND | bitmasks greedy math | Statement | H | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1300 | |
| 41334 | Odd/Even Increments | greedy greedy implementation math | Statement | C | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 800 | |
| 15990 | Prof. Slim | greedy implementation sortings | Statement | A | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 25220 | Dolce Vita | binary search brute force greedy math | Statement | C | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 14026 | Unequal Array | constructive algorithms greedy implementation | Statement | C | Codeforces Global Round 20 {1672} | PROGRAMMING | 750.0 | Global Round 20 Editorial | 1100 |
| 6935 | Cyclic Rotation | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Global Round 20 {1672} | PROGRAMMING | 1000.0 | Global Round 20 Editorial | 1700 |
| 2515 | notepad.exe | binary search constructive algorithms greedy interactive | Statement | E | Codeforces Global Round 20 {1672} | PROGRAMMING | 1500.0 | Global Round 20 Editorial | 2200 |
| 955 | 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 | |
| 21631 | 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 | |
| 19133 | Subtle Substring Subtraction | games greedy strings | Statement | A | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 500.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 7283 | Breaking the Wall | binary search brute force constructive algorithms greedy math | Statement | E | 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 | ||
| 6241 | Vlad and Unfinished Business | dfs and similar dp greedy trees | Statement | F | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 12060 | Replace With the Previous, Minimize | dsu greedy strings | Statement | E | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 32834 | Eating Queries | binary search greedy sortings | Statement | E | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 29216 | X-Sum | brute force greedy implementation | Statement | D | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 34528 | 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 | ||
| 19993 | Longest Strike | data structures greedy implementation sortings two pointers | Statement | F | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 60329 | Equal Candies | greedy math sortings | Statement | B | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 39767 | AvtoBus | brute force greedy math number theory | Statement | A | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 500.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 11088 | Binary String | binary search greedy two pointers | Statement | C | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 1345 | Dog Walking | brute force greedy math | Statement | D | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 931 | Labyrinth Adventures | data structures dp greedy matrices shortest paths | Statement | E | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 2600 | |
| 745 | 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 | |
| 16448 | 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 | |
| 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 | |
| 19959 | Palindromic Indices | greedy strings | Statement | A | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 750.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 10742 | 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 |
| 3620 | 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 |
| 18577 | Circular Local MiniMax | constructive algorithms greedy sortings | Statement | A | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 500.0 | 103198 | 1100 |
| 3661 | Linguistics | greedy implementation strings | Statement | B | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 1000.0 | 103198 | 2000 |
| 4134 | 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 | |
| 11388 | The Enchanted Forest | constructive algorithms greedy math | Statement | A | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 796 | |
| 18997 | Patchouli's Magical Talisman | bitmasks constructive algorithms greedy sortings | Statement | B | Codeforces Round 796 (Div. 2) {1688} | PROGRAMMING | 750.0 | Tutorial | |
| 17720 | 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) | |
| 13416 | 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) | |
| 19054 | Mystic Permutation | data structures greedy implementation | Statement | B | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 750.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 16955 | Price Maximization | binary search greedy math two pointers | Statement | E | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 1500 | |
| 28044 | 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 | |
| 26911 | Array Decrements | greedy implementation | Statement | B | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 800 | |
| 17195 | 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) | |
| 35087 | 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) | |
| 32105 | 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) | |
| 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) | |
| 39308 | All Distinct | greedy sortings | Statement | B | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 9568 | 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 |
| 3182 | 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 |
| 23512 | Creep | greedy implementation | Statement | A | Codeforces Round 800 (Div. 2) {1694} | PROGRAMMING | 500.0 | Codeforces Round #800 Editorial | 800 |
| 13982 | 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 | |
| 2452 | 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 | |
| 2287 | 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 | |
| 6005 | 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 | |
| 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 | |
| 12575 | Fishingprince Plays With Array | constructive algorithms greedy implementation | Statement | C | Codeforces Global Round 21 {1696} | PROGRAMMING | 1500.0 | Editorial of Codeforces Global Round 21 | |
| 15775 | 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 | ||
| 26722 | Parkway Walk | greedy implementation | Statement | A | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 30803 | Promo | greedy sortings | Statement | B | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 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 | |
| 21456 | Rising Sand | constructive algorithms greedy implementation | Statement | B | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 6977 | River Locks | binary search dp greedy math | Statement | D | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1750.0 | 103978 | 1900 |
| 23655 | Optimal Path | dp greedy math | Statement | A | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 500.0 | 103978 | 800 |
| 6262 | 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 | ||
| 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 | ||
| 9434 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 29797 | 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 | ||
| 12702 | Good Key, Bad Key | bitmasks brute force dp greedy math | Statement | G | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 24595 | Virus | greedy sortings | Statement | C | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 1250.0 | CodeTON Round 2 Editorial | |
| 25312 | Mark the Dust Sweeper | greedy implementation | Statement | B | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 1000.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 7708 | 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 | |
| 16125 | Qpwoeirut And The City | dp greedy implementation | Statement | C | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1250.0 | Codeforces Round #809 Editorial | |
| 17474 | Making Towers | dp greedy math | Statement | B | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 24237 | Another String Minimization Problem | greedy strings | Statement | A | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 500.0 | Codeforces Round #809 Editorial | |
| 15416 | Doremy's IQ | binary search greedy implementation | Statement | A | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 500.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 | |
| 22567 | Difference Operations | greedy math | Statement | A | Codeforces Round 808 (Div. 2) {1708} | PROGRAMMING | 500.0 | 104930 | |
| 3929 | XOR Tree | data structures dfs and similar dsu greedy trees | Statement | E | 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 | ||
| 10248 | Recover an RBS | greedy implementation strings | Statement | C | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 22392 | Woeful Permutation | constructive algorithms greedy number theory | Statement | B | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 1000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 25049 | Wonderful Permutation | greedy implementation | Statement | A | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 500.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 21248 | Sort Zero | greedy sortings two pointers | Statement | C | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 1500.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 6220 | 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 |
| 1969 | Cross Swapping | dsu greedy matrices | Statement | E | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 2500.0 | Codeforces Round #812 (Div. 2) Editorial | 2400 |
| 22804 | Traveling Salesman Problem | geometry greedy implementation | Statement | A | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 500.0 | Codeforces Round #812 (Div. 2) Editorial | 800 |
| 3657 | 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 | ||
| 10300 | Color with Occurrences | dp greedy strings | Statement | D | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 6062 | 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 | |
| 10345 | 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 | |
| 24362 | Crossmarket | constructive algorithms greedy math | Statement | A | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 500.0 | Codeforces Round #816 (Div. 2) editorial | |
| 33364 | Beautiful Array | constructive algorithms greedy math | Statement | B | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 1000.0 | Codeforces Round #816 (Div. 2) editorial | |
| 35792 | 2-3 Moves | greedy math | Statement | A | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 15881 | Madoka and Formal Statement | greedy math | Statement | C | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 1500.0 | Codeforces Round #818 (Div. 2) Editorial. | 1300 |
| 3455 | 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 | |
| 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 | |
| 5901 | 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 | |
| 6408 | 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 | |
| 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 | |
| 22400 | Interesting Sum | data structures greedy math | Statement | B | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1000.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 18212 | Corners | greedy implementation | Statement | C | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1250.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 14545 | Min-Max Array Transformation | binary search greedy two pointers | Statement | C | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 7665 | Maximum AND | bitmasks brute force divide and conquer greedy math sortings | Statement | D | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 26501 | Line | greedy sortings | Statement | D | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1100 | |
| 27904 | Basketball Together | binary search greedy sortings | Statement | B | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 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 | |
| 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 | |
| 36261 | 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 | |
| 2026 | 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 | ||
| 25433 | Colored Balls: Revisited | greedy implementation sortings | Statement | A | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 32436 | Decode String | greedy strings | Statement | B | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 30519 | Friends and the Restaurant | greedy two pointers | Statement | D | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 17915 | Minimum Notation | data structures greedy math sortings | Statement | C | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 1500.0 | Codeforces Round #823 — editorial | 1200 |
| 17171 | 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 |
| 24773 | Planets | data structures data structures greedy sortings | Statement | A | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 500.0 | Codeforces Round #823 — editorial | 800 |
| 3468 | 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 | |
| 23652 | 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 | |
| 26617 | 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 | |
| 7526 | Sheikh (Easy version) | binary search bitmasks greedy two pointers | Statement | C1 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1000.0 | 108327 | 1800 |
| 3060 | 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 |
| 15008 | Zero-One (Easy Version) | dp greedy math | Statement | D1 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 21842 | Consecutive Sum | greedy sortings | Statement | A | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 7033 | 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 | |
| 28428 | Removing Smallest Multiples | greedy math | Statement | C | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 1250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 22397 | Select Three Sticks | greedy math sortings | Statement | A | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 500.0 | Codeforces Round #822 (Div.2) Editorial | |
| 21047 | Working Week | constructive algorithms greedy math | Statement | A | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 500.0 | Codeforces Round #824 — editorial | |
| 10907 | Phase Shift | dfs and similar dsu graphs greedy strings | Statement | C | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 1250.0 | Codeforces Round #824 — editorial | |
| 19292 | Tea with Tangerines | greedy math | Statement | B | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 750.0 | Codeforces Round #824 — editorial | |
| 2764 | Equal Binary Subsequences | constructive algorithms greedy strings | Statement | D | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 2101 | Ela and the Wiring Wizard | graphs greedy shortest paths | Statement | D | Dytechlab Cup 2022 {1737} | PROGRAMMING | 2000.0 | Editorial of Dytechlab Cup 2022 | |
| 10832 | Ela Sorting Books | greedy implementation strings | Statement | A | Dytechlab Cup 2022 {1737} | PROGRAMMING | 500.0 | Editorial of Dytechlab Cup 2022 | |
| 1373 | 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> | |
| 12745 | 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> | |
| 14182 | Glory Addicts | greedy implementation | Statement | A | Codeforces Global Round 22 {1738} | PROGRAMMING | 500.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 | ||
| 24406 | Array Recovery | constructive algorithms greedy math | Statement | B | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 12303 | Bricks and Bags | constructive algorithms games greedy sortings | Statement | C | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1500.0 | Tutorial | 1400 |
| 9048 | Knowledge Cards | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1750.0 | Tutorial | 1500 |
| 5031 | 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 |
| 14349 | Jumbo Extra Cheese 2 | geometry greedy sortings | Statement | B | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1000.0 | Tutorial | 800 |
| 19341 | Minimize the Thickness | brute force greedy math two pointers | Statement | C | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 38292 | Scuza | binary search greedy math | Statement | E | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 13205 | Orray | bitmasks brute force greedy math | Statement | G | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 33862 | Coprime | brute force greedy number theory | Statement | D | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 13982 | Smaller | constructive algorithms greedy strings | Statement | F | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 60755 | Increasing | greedy implementation sortings | Statement | B | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 20604 | 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 | |
| 28734 | Number Replacement | greedy implementation | Statement | A | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 24480 | Divisibility by 2^n | greedy math sortings | Statement | D | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 14023 | Permutation Operations | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial | |
| 5103 | 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 | |
| 12954 | 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 |
| 15689 | Number Game | games greedy implementation | Statement | C | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 1655 | 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 | |
| 14955 | Factorial Divisibility | greedy math | Statement | B | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 750.0 | Tutorial | 1600 |
| 15232 | Almost All Multiples | greedy number theory | Statement | C | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 1500.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 5480 | Restore the Permutation | binary search data structures greedy math | Statement | G | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 4495 | All Possible Digits | binary search data structures greedy math number theory | Statement | F | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 19364 | Thermostat | greedy math shortest paths | Statement | C | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 14734 | Quests | binary search greedy sortings | Statement | F | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 |