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 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 27686 | Flip the Bits | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 712 (Div. 2) {1504} | PROGRAMMING | 1000.0 | Codeforces Round #712 Editorial | 1200 |
| 22946 | Déjà Vu | constructive algorithms strings | Statement | A | Codeforces Round 712 (Div. 2) {1504} | PROGRAMMING | 500.0 | Codeforces Round #712 Editorial | 800 |
| 4939 | Maximize the Remaining String | brute force data structures dp greedy strings two pointers | Statement | G | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 38495 | Double-ended Strings | brute force dp hashing strings | Statement | C | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 21313 | Partial Replacement | greedy implementation | Statement | B | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 6762 | Binary Literature | constructive algorithms greedy implementation math strings two pointers | Statement | A | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 750.0 | Codeforces Round #715 Editorial | |
| 990 | Button Lock | flows graph matchings | Statement | B | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 12627 | Min Cost String | brute force constructive algorithms dfs and similar graphs greedy | Statement | D | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 611 | Chainword | data structures dp math matrices strings | Statement | F | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 22139 | A-B Palindrome | constructive algorithms implementation strings | Statement | C | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 33747 | The Cake Is a Lie | dp math | Statement | B | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 30848 | Red and Blue Beans | math | Statement | A | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 59693 | Do Not Be Distracted! | brute force implementation | Statement | A | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 2869 | Kill Anton | brute force constructive algorithms data structures math strings | Statement | D | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 2250.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 1593 | Oolimry and Suffix Array | combinatorics constructive algorithms math string suffix structures | Statement | E | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 2500.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 189 | What a Reversal | constructive algorithms | Statement | G | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 3750.0 | Codeforces Round #733 Editorial (all problems) | |
| 3405 | Minimax | constructive algorithms greedy implementation strings | Statement | E | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 2000.0 | Codeforces Round #733 Editorial (all problems) | |
| 220 | Prefixes and Suffixes | *special strings | Statement | F | Kotlin Heroes: Practice 7 {1532} | PROGRAMMING | |||
| 224 | Binary String Partition | *special binary search greedy | Statement | F | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 515 | String Searching | *special hashing | Statement | D | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 735 | String Distance | binary search data structures hashing string suffix structures strings | Statement | F | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 18080 | Unstable String | dp greedy implementation strings two pointers | Statement | C | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 26852 | Prinzessin der Verurteilung | brute force strings | Statement | B | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 1000.0 | Codeforces Round #724 — Editorial | 1200 |
| 16471 | Diluc and Kaeya | dp hashing number theory | Statement | C | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 1500.0 | Codeforces Round #724 — Editorial | 1500 |
| 17166 | Erase and Extend (Easy Version) | binary search brute force dp greedy hashing string suffix structures strings | Statement | E1 | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1250.0 | Codeforces Round #726 (Div.2) Editorial | |
| 6442 | Erase and Extend (Hard Version) | binary search data structures greedy hashing string suffix structures strings | Statement | E2 | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1750.0 | Codeforces Round #726 (Div.2) Editorial | |
| 3297 | Funny Substrings | brute force data structures hashing implementation strings | Statement | E | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 15664 | Another Problem About Dividing Numbers | constructive algorithms number theory | Statement | D | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 27033 | Love Song | dp implementation strings | Statement | B | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 750.0 | tutorial | 800 |
| 7183 | AquaMoon and Chess | combinatorics math | Statement | B | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 1000.0 | Codeforces Round #732 Editorial | 1900 |
| 14133 | AquaMoon and Stolen String | interactive | Statement | B | Codeforces Round 732 (Div. 2) {1546} | PROGRAMMING | 1000.0 | Codeforces Round #732 Editorial | 1200 |
| 28190 | Alphabetical Strings | greedy implementation strings | Statement | B | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 1972 | Stringforces | binary search bitmasks data structures dp greedy strings two pointers | Statement | E | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 978 | Jumping Around | data structures divide and conquer dp dsu graphs shortest paths trees | Statement | F | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 14744 | Interesting Story | greedy sortings strings | Statement | C | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 31653 | Wonderful Coloring - 1 | strings | Statement | B1 | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 25562 | Subsequence Permutation | sortings strings | Statement | A | Codeforces Global Round 15 {1552} | PROGRAMMING | 250.0 | Editorial of Global Round 15 | |
| 15629 | Reverse String | brute force dp hashing strings | Statement | B | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 500.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 15359 | Backspace | greedy strings two pointers | Statement | D | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 1250.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 10725 | Diane | constructive algorithms greedy strings | Statement | D | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #735 (Div. 2) | 1800 |
| 16239 | Say No to Palindromes | brute force dp strings | Statement | D | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 1600 | |
| 19693 | Make a Power of Two | greedy math strings | Statement | D | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 1300 | |
| 8956 | Polycarp and String Transformation | binary search implementation sortings strings | Statement | E | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 1800 | |
| 1664 | Rescue Niwen! | dp string suffix structures strings | Statement | E | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 21577 | MIN-MEX Cut | bitmasks constructive algorithms dp | Statement | B | Codeforces Global Round 16 {1566} | PROGRAMMING | 750.0 | Codeforces Global Round 16 Editorial | |
| 31940 | Domino Disaster | implementation strings | Statement | A | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 500.0 | Codeforces Round #742 Editorial | |
| 530 | Palindromic Hamiltonian Path | brute force dp graphs | Statement | F | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
| 26709 | Balanced Substring | implementation | Statement | A | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
| 20 | Chainword | *special data structures strings | Statement | H | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 271 | Erasing Zeroes | *special strings | Statement | E | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 376 | Fix the String | *special bitmasks dp greedy | Statement | E | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 404 | Rhyme | *special implementation | Statement | C | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 18355 | Combinatorics Homework | combinatorics greedy math | Statement | B | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 5305 | Another Sorting Problem | data structures sortings strings | Statement | A | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 811 | Holiday Wall Ornaments | strings | Statement | H | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 2212 | Higher Order Functions | implementation strings | Statement | H | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 11794 | Ticks | brute force dp greedy implementation | Statement | C | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 42682 | Casimir's String Solitaire | math strings | Statement | A | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 25884 | Grandma Capa Knits a Scarf | data structures greedy strings two pointers | Statement | C | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 1198 | Strange LCS | bitmasks dp graphs greedy strings | Statement | F | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 2500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2600 |
| 1943 | Changing Brackets | data structures greedy | Statement | G | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 30912 | Make Them Equal | brute force greedy math strings | Statement | C | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1500.0 | 95525 | 1200 |
| 1694 | RBS | binary search bitmasks data structures dp | Statement | F | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 492 | The Sum of Good Numbers | hashing probabilities | Statement | G | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 222 | Restaurant Game | Statement | B | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | BubbleCup2021.pdf | |||
| 372 | Two Sorts | binary search math | Statement | F | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 3000.0 | 95865 | 3400 |
| 19937 | Two Subsequences | implementation | Statement | A | Codeforces Round 751 (Div. 2) {1602} | PROGRAMMING | 500.0 | 95865 | 800 |
| 19203 | Dominant Character | brute force implementation strings | Statement | C | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 1500.0 | tutorial | 1400 |
| 40976 | AB Balance | constructive algorithms strings | Statement | A | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 18339 | Blue-Red Permutation | greedy math sortings | Statement | D | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 41322 | Linear Keyboard | implementation strings | Statement | A | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 325 | Alphabetic Tree | binary search data structures dfs and similar hashing string suffix structures strings trees | Statement | G | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 12212 | William the Vigilant | implementation strings | Statement | B | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 1000.0 | Deltix Round, Autumn 2021. Editorial | 1100 |
| 9305 | Menorah | brute force graphs greedy math | Statement | C | Codeforces Global Round 18 {1615} | PROGRAMMING | 1750.0 | Global Round 18 Editorial | |
| 20847 | Mirror in the String | greedy strings | Statement | B | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 1000.0 | Good Bye 2021 -- Editorial | 1100 |
| 2770 | Lexicographically Small Enough | data structures greedy strings | Statement | E | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 2500.0 | Good Bye 2021 -- Editorial | 2200 |
| 17110 | Forbidden Subsequence | constructive algorithms sortings strings | Statement | A | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 750.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 4824 | Reverse | bitmasks implementation math strings | Statement | F | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 64269 | Square String? | implementation strings | Statement | A | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 7368 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1223 | Subsequences Galore | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 5006 | Shuffle | combinatorics math two pointers | Statement | D | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 32411 | Construct a Rectangle | math | Statement | A | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 1303 | 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 | |
| 19470 | Palindromes Coloring | binary search greedy sortings strings | Statement | D | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 4702 | Masha-forgetful | brute force constructive algorithms dp hashing implementation strings | Statement | E | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 27228 | 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 | ||
| 57235 | Make AP | implementation math | Statement | B | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 1205 | Cats on the Upgrade (easy version) | data structures dfs and similar divide and conquer dp graphs trees | Statement | E1 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 743 | Cats on the Upgrade (hard version) | data structures dfs and similar graphs trees | Statement | E2 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 24174 | Minor Reduction | greedy greedy strings strings | Statement | B | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 12882 | Peculiar Movie Preferences | greedy strings | Statement | B | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 750.0 | 99276 | |
| 31311 | ABC | implementation | Statement | A | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #769 | |
| 29593 | Minority | greedy | Statement | B | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 24744 | Reverse and Concatenate | brute force strings | Statement | A | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 7172 | Infinite Set | dp math matrices number theory strings | Statement | D | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 3526 | Expand the Path | brute force combinatorics implementation math | Statement | E | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 22973 | 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 |
| 17279 | Madoka and the Elegant Gift | brute force graphs implementation | Statement | B | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 1250.0 | Codeforces Round #777 Editorial | |
| 3393 | Tyler and Strings | combinatorics data structures implementation strings | Statement | C | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 1500.0 | Codeforces Round #775 Editorial | |
| 37621 | Deletions of Two Adjacent Letters | implementation strings | Statement | A | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 1551 | Minimal String Xoration | bitmasks data structures divide and conquer hashing strings | Statement | F | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2800 |
| 16951 | Prefix Removals | strings | Statement | B | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 800 |
| 12213 | Bit Flipping | bitmasks constructive algorithms greedy strings | Statement | B | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 750.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 8052 | Promising String (easy version) | brute force implementation math strings | Statement | F1 | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 3239 | Promising String (hard version) | data structures implementation math strings | Statement | F2 | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 22387 | Get an Even String | dp greedy strings | Statement | C | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 30067 | Vlad and Candies | math | Statement | B | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 153 | Toys | greedy greedy strings strings | Statement | B | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 2208 | Evolution of Weasels | strings | Statement | D | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 140 | Admissible Map | Statement | A | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | |||
| 18031 | Social Distance | greedy math sortings | Statement | B | Codeforces Round 783 (Div. 2) {1668} | PROGRAMMING | 500.0 | Codeforces Round #783 Editorial | 900 |
| 21965 | 2-Letter Strings | data structures math strings | Statement | E | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1200 | |
| 42693 | Odd/Even Increments | greedy greedy implementation math | Statement | C | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 800 | |
| 13555 | Dorms War | brute force implementation strings | Statement | B | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 1000.0 | Tutorial | 1100 |
| 3390 | Preorder | combinatorics divide and conquer dp dsu hashing trees | Statement | E | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 21509 | String Building | implementation | Statement | A | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 7030 | Cyclic Rotation | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Global Round 20 {1672} | PROGRAMMING | 1000.0 | Global Round 20 Editorial | 1700 |
| 16558 | I love AAAB | constructive algorithms implementation | Statement | B | Codeforces Global Round 20 {1672} | PROGRAMMING | 500.0 | Global Round 20 Editorial | 800 |
| 23703 | 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 | |
| 19221 | Subtle Substring Subtraction | games greedy strings | Statement | A | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 500.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 26765 | Infinite Replacement | combinatorics implementation strings | Statement | C | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 12286 | Replace With the Previous, Minimize | dsu greedy strings | Statement | E | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 37322 | Food for Animals | math | Statement | A | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 35718 | 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 | ||
| 91781 | Lucky? | implementation | Statement | A | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 1465 | 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 | |
| 11377 | Binary String | binary search greedy two pointers | Statement | C | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 20072 | Palindromic Indices | greedy strings | Statement | A | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 750.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 313 | 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 |
| 3753 | Linguistics | greedy implementation strings | Statement | B | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 1000.0 | 103198 | 2000 |
| 21348 | Everything Everywhere All But One | greedy | Statement | A | Codeforces Round 794 (Div. 2) {1686} | PROGRAMMING | 500.0 | 103198 | |
| 8868 | Manipulating History | math strings | Statement | C | Codeforces Round 796 (Div. 2) {1688} | PROGRAMMING | 1250.0 | Tutorial | |
| 17869 | 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) | |
| 9300 | Shifting String | graphs math number theory strings | Statement | F | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 1700 | |
| 27143 | Array Decrements | greedy implementation | Statement | B | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 800 | |
| 17483 | 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) | |
| 28191 | 3SUM | brute force math | Statement | F | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 17621 | Directional Increase | greedy | Statement | A | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 750.0 | Codeforces Round #800 Editorial | 1300 |
| 20864 | Paranoid String | constructive algorithms greedy | Statement | B | Codeforces Round 800 (Div. 2) {1694} | PROGRAMMING | 1000.0 | Codeforces Round #800 Editorial | 1200 |
| 1176 | 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 | |
| 16004 | 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 | ||
| 20001 | 3SUM Closure | brute force data structures | Statement | C | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 1000.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 788 | Equal Reversal | constructive algorithms graphs math | Statement | F | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 2500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 398 | 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 | |
| 1426 | 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 | ||
| 9633 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 19194 | Split Into Two Sets | dfs and similar dsu graph matchings graphs | Statement | E | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 29919 | Double Strings | brute force data structures strings | Statement | D | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 102395 | YES or YES? | implementation strings | Statement | A | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 41914 | Cypher | implementation strings | Statement | C | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 186 | 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 | |
| 14718 | 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 | |
| 24384 | Another String Minimization Problem | greedy strings | Statement | A | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 500.0 | Codeforces Round #809 Editorial | |
| 731 | Multiset of Strings | dp fft flows graphs greedy math | Statement | F | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 10734 | Recover an RBS | greedy implementation strings | Statement | C | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 22919 | Optimal Reduction | constructive algorithms sortings | Statement | B | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 1000.0 | Codeforces Round #812 (Div. 2) Editorial | 1000 |
| 25305 | Add Modulo 10 | brute force math number theory | Statement | E | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 10550 | Color with Occurrences | dp greedy strings | Statement | D | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 3579 | 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 | |
| 6827 | Xor-Subsequence (easy version) | bitmasks brute force dp strings trees | Statement | D1 | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1500.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 2308 | Xor-Subsequence (hard version) | bitmasks data structures dp strings trees | Statement | D2 | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1000.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 2704 | Prefix Function Queries | bitmasks brute force data structures hashing string suffix structures strings trees | Statement | E | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 8177 | L-shapes | dfs and similar implementation | Statement | F | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1700 | |
| 37363 | Word Game | data structures implementation | Statement | C | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 800 | |
| 68351 | Spell Check | implementation | Statement | A | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 800 | |
| 58366 | Colourblindness | implementation | Statement | B | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 800 | |
| 8438 | Letter Picking | constructive algorithms dp games | Statement | D | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 4620 | Kirei and the Linear Function | brute force math | Statement | F | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 2614 | Cut Substrings | combinatorics dp hashing strings two pointers | Statement | G | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 21814 | Jumping on Tiles | constructive algorithms strings | Statement | C | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 32759 | Decode String | greedy strings | Statement | B | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 3105 | Prefixes and Suffixes | constructive algorithms dsu strings | Statement | D | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 2250.0 | Codeforces Round #823 — editorial | 2200 |
| 4863 | Zero-One (Hard Version) | dp greedy | Statement | D2 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 750.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 15242 | Zero-One (Easy Version) | dp greedy math | Statement | D1 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 1030 | Zeros and Ones | bitmasks divide and conquer dp math | Statement | F | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 3250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 11088 | Phase Shift | dfs and similar dsu graphs greedy strings | Statement | C | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 1250.0 | Codeforces Round #824 — editorial | |
| 2829 | Equal Binary Subsequences | constructive algorithms greedy strings | Statement | D | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 11011 | Ela Sorting Books | greedy implementation strings | Statement | A | Dytechlab Cup 2022 {1737} | PROGRAMMING | 500.0 | Editorial of Dytechlab Cup 2022 | |
| 584 | Anti-Increasing Addicts | constructive algorithms dfs and similar dp greedy | Statement | G | Codeforces Global Round 22 {1738} | PROGRAMMING | 3000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 19235 | Prefix Sum Addicts | constructive algorithms math sortings | Statement | B | Codeforces Global Round 22 {1738} | PROGRAMMING | 1000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 321 | Palindrome Addicts | data structures strings | Statement | H | Codeforces Global Round 22 {1738} | PROGRAMMING | 4000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 688 | Keyboard Design | bitmasks data structures dp string suffix structures strings | Statement | F | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 19088 | Sending a Sequence Over the Network | dp | Statement | E | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 34116 | Compare T-Shirt Sizes | implementation implementation strings | Statement | A | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 14450 | Smaller | constructive algorithms greedy strings | Statement | F | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 63536 | Increasing | greedy implementation sortings | Statement | B | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 110933 | Sum | implementation | Statement | A | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 8542 | Problem with Random Tests | brute force hashing probabilities | Statement | D | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 1700 | |
| 456 | Antifibonacci Cut | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 3000 | |
| 17031 | Diverse Substrings | brute force implementation strings | Statement | B | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 1000.0 | Codeforces Round #833 (Div. 2) Editorial | 1400 |
| 1718 | 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 | |
| 16887 | Maximum Substring | brute force greedy | Statement | B | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 750.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 10560 | Complementary XOR | constructive algorithms data structures | Statement | C | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 1250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 128 | BinaryStringForces | constructive algorithms data structures | Statement | H | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 3500.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 17921 | Indirect Sort | constructive algorithms math | Statement | A | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 500.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 1299 | Majority | dp strings | Statement | F | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 2500.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 27225 | SSeeeeiinngg DDoouubbllee | constructive algorithms strings | Statement | A | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 500.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 33092 | Yes-Yes? | implementation strings | Statement | A | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 54694 | Atilla's Favorite Problem | greedy implementation strings | Statement | B | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 27606 | Challenging Valleys | implementation | Statement | D | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 10273 | Binary Strings are Fun | combinatorics dp | Statement | C | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 1750.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 160 | Unequal Adjacent Elements | constructive algorithms sortings | Statement | G | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 3500.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 1474 | Doremy's Number Line | binary search dp greedy sortings | Statement | E | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 3210 | Count Binary Strings | Statement | C | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | |||
| 15906 | Elemental Decompress | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 9828 | Koxia and Number Theory | chinese remainder theorem math number theory | Statement | C | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 1250.0 | Good Bye 2022 -- Editorial | |
| 1741 | Hossam and Range Minimum Query | binary search bitmasks data structures hashing probabilities strings trees | Statement | F | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 3500.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 22509 | Gardener and the Array | bitmasks constructive algorithms | Statement | B | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 1000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 20509 | Gardener and the Capybaras (easy version) | brute force implementation strings | Statement | A1 | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 20143 | Gardener and the Capybaras (hard version) | constructive algorithms greedy strings | Statement | A2 | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 2483 | Another Wine Tasting Event | combinatorics constructive algorithms strings | Statement | G | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 1494 | Comfortably Numb | binary search bitmasks data structures divide and conquer dsu strings trees two pointers | Statement | F | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2750.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 11876 | Flexible String | bitmasks brute force strings | Statement | C | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1250.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 3615 | Flexible String Revisit | combinatorics dp math probabilities | Statement | D | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 24167 | Hall of Fame | constructive algorithms greedy math strings | Statement | A | Hello 2023 {1779} | PROGRAMMING | 500.0 | ||
| 1068 | Delicious Dessert | math number theory string suffix structures strings | Statement | G | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 2500.0 | 111841 | |
| 11247 | Equal Frequencies | greedy implementation | Statement | C | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 1500.0 | Tutorial | |
| 19768 | Matching Numbers | constructive algorithms greedy math | Statement | C | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1500.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 1978 | Serval and Shift-Shift-Shift | bitmasks brute force constructive algorithms implementation | Statement | D | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 1750.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 37655 | Serval and Mocha's Array | brute force math number theory | Statement | A | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 500.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 17775 | Serval and Inversion Magic | implementation strings | Statement | B | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 1000.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 41596 | Polycarp and the Day of Pi | implementation math strings | Statement | A | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 54289 | Distinct Split | brute force greedy strings | Statement | D | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 53946 | Following Directions | geometry implementation | Statement | B | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 84325 | Codeforces Checking | implementation strings | Statement | A | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 8469 | Fixed Prefix Permutations | binary search data structures math sortings strings | Statement | D | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 19143 | Prefix and Suffix Array | constructive algorithms strings | Statement | A | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 750.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 24830 | Two Towers | brute force implementation strings | Statement | A | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 19795 | Typical Interview Problem | implementation strings | Statement | A | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 18587 | Asterisk-Minor Template | implementation strings | Statement | B | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 26981 | Li Hua and Pattern | constructive algorithms greedy | Statement | B | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1000.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 21192 | Showstopper | greedy implementation sortings | Statement | A | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 860 (Div. 2) | 800 |
| 7069 | Double Lexicographically Minimum | constructive algorithms greedy implementation strings | Statement | C | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1500.0 | Codeforces Round #854 Editorial | |
| 30485 | Remove Two Letters | data structures greedy hashing strings | Statement | D | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 2666 | Symmetree | dfs and similar hashing trees | Statement | G | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 29123 | Count the Number of Pairs | greedy strings | Statement | B | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 37724 | Is It a Cat? | implementation strings | Statement | A | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 766 | A task for substrings | data structures string suffix structures strings | Statement | G | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 3500.0 | Codeforces Round #857 Editorial | |
| 20576 | The String Has a Target | greedy strings | Statement | B | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 22893 | Subsequence Addition (Easy Version) | brute force dp greedy implementation sortings | Statement | G1 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 63219 | Odd Queries | data structures implementation | Statement | D | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 30155 | Subsequence Addition (Hard Version) | dp greedy implementation math sortings | Statement | G2 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 50550 | Grab the Candies | greedy | Statement | B | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 34944 | Find and Replace | greedy implementation strings | Statement | C | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 7471 | Binary String Sorting | binary search dp greedy | Statement | D | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 4036 | Monsters | brute force data structures dfs and similar dsu graphs implementation trees | Statement | E | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 22085 | Beautiful Sequence | brute force greedy | Statement | A | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 500.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 8827 | Umka and a Long Flight | constructive algorithms implementation math | Statement | D | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 2298 | Is It Flower? | dfs and similar dsu graphs implementation | Statement | F | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 |