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 ... 7 8 9 10 11 12 13 14 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 39907 | All Distinct | greedy sortings | Statement | B | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 17565 | Directional Increase | greedy | Statement | A | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 750.0 | Codeforces Round #800 Editorial | 1300 |
| 9709 | 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 |
| 3250 | 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 |
| 1146 | Decinc Dividing | brute force data structures divide and conquer dp greedy | Statement | D | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 2250.0 | Codeforces Round #800 Editorial | 2800 |
| 563 | Outermost Maximums | data structures greedy | Statement | E | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 2500.0 | Codeforces Round #800 Editorial | 3400 |
| 623 | I Might Be Wrong | greedy | Statement | F | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 3000.0 | Codeforces Round #800 Editorial | 3400 |
| 20775 | Paranoid String | constructive algorithms greedy | Statement | B | Codeforces Round 800 (Div. 2) {1694} | PROGRAMMING | 1000.0 | Codeforces Round #800 Editorial | 1200 |
| 23604 | Creep | greedy implementation | Statement | A | Codeforces Round 800 (Div. 2) {1694} | PROGRAMMING | 500.0 | Codeforces Round #800 Editorial | 800 |
| 14478 | 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 | |
| 2499 | 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 | |
| 2329 | 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 | |
| 6059 | 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 | |
| 20410 | NIT orz! | bitmasks greedy | Statement | A | Codeforces Global Round 21 {1696} | PROGRAMMING | 500.0 | Editorial of Codeforces Global Round 21 | |
| 214 | 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 | |
| 12650 | Fishingprince Plays With Array | constructive algorithms greedy implementation | Statement | C | Codeforces Global Round 21 {1696} | PROGRAMMING | 1500.0 | Editorial of Codeforces Global Round 21 | |
| 38768 | NIT Destroys the Universe | greedy | Statement | B | Codeforces Global Round 21 {1696} | PROGRAMMING | 1000.0 | Editorial of Codeforces Global Round 21 | |
| 15906 | 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 | ||
| 26827 | Parkway Walk | greedy implementation | Statement | A | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 31308 | Promo | greedy sortings | Statement | B | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 1860 | 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 | |
| 21518 | Rising Sand | constructive algorithms greedy implementation | Statement | B | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 3600 | Almost Triple Deletions | data structures dp greedy | Statement | D | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 1750.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 12284 | Helping the Nature | constructive algorithms greedy | Statement | C | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1500.0 | 103978 | 1700 |
| 7127 | River Locks | binary search dp greedy math | Statement | D | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1750.0 | 103978 | 1900 |
| 1096 | Puzzle | dp greedy | Statement | F | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 3000.0 | 103978 | 2600 |
| 23734 | Optimal Path | dp greedy math | Statement | A | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 500.0 | 103978 | 800 |
| 6317 | 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 | ||
| 24886 | Schedule Management | binary search greedy | Statement | C | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 1393 | 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 | ||
| 20867 | Permutation | greedy | Statement | B | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 9576 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 25459 | Train and Queries | data structures greedy | Statement | C | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 29513 | Polycarp Writes a String from Memory | greedy | Statement | B | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 26147 | Not a Cheap String | greedy | Statement | D | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 31536 | 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 | ||
| 12950 | Good Key, Bad Key | bitmasks brute force dp greedy math | Statement | G | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 16697 | Two 0-1 Sequences | constructive algorithms greedy | Statement | A | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 500.0 | CodeTON Round 2 Editorial | |
| 31803 | Luke is a Foodie | greedy | Statement | B | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 750.0 | CodeTON Round 2 Editorial | |
| 26295 | Virus | greedy sortings | Statement | C | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 1250.0 | CodeTON Round 2 Editorial | |
| 2504 | Mark and Professor Koro | binary search bitmasks combinatorics data structures greedy | Statement | E | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 2500.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 26695 | Mark the Photographer | greedy | Statement | A | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 500.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 25751 | Mark the Dust Sweeper | greedy implementation | Statement | B | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 1000.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 7790 | 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 | |
| 16241 | Qpwoeirut And The City | dp greedy implementation | Statement | C | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1250.0 | Codeforces Round #809 Editorial | |
| 17618 | Making Towers | dp greedy math | Statement | B | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 24330 | Another String Minimization Problem | greedy strings | Statement | A | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 500.0 | Codeforces Round #809 Editorial | |
| 15659 | Doremy's IQ | binary search greedy implementation | Statement | A | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 500.0 | 104930 | |
| 1961 | DFS Trees | data structures dfs and similar dsu graphs greedy trees | Statement | C | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1250.0 | 104930 | |
| 22677 | Difference Operations | greedy math | Statement | A | Codeforces Round 808 (Div. 2) {1708} | PROGRAMMING | 500.0 | 104930 | |
| 4147 | XOR Tree | data structures dfs and similar dsu greedy trees | Statement | E | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 711 | Multiset of Strings | dp fft flows graphs greedy math | Statement | F | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 10472 | Recover an RBS | greedy implementation strings | Statement | C | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 11974 | Color the Picture | constructive algorithms greedy | Statement | A | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 500.0 | Codeforces Round #810 Editorial | |
| 5173 | Empty Graph | binary search data structures greedy | Statement | D | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 2000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 22455 | Woeful Permutation | constructive algorithms greedy number theory | Statement | B | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 1000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 25163 | Wonderful Permutation | greedy implementation | Statement | A | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 500.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 21362 | Sort Zero | greedy sortings two pointers | Statement | C | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 1500.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 6298 | 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 |
| 2018 | Cross Swapping | dsu greedy matrices | Statement | E | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 2500.0 | Codeforces Round #812 (Div. 2) Editorial | 2400 |
| 22885 | Traveling Salesman Problem | geometry greedy implementation | Statement | A | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 500.0 | Codeforces Round #812 (Div. 2) Editorial | 800 |
| 33710 | Minimum Varied Number | bitmasks brute force greedy | Statement | C | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 3735 | 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 | ||
| 10474 | Color with Occurrences | dp greedy strings | Statement | D | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 6220 | 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 | |
| 10614 | 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 | |
| 24440 | Crossmarket | constructive algorithms greedy math | Statement | A | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 500.0 | Codeforces Round #816 (Div. 2) editorial | |
| 35522 | Beautiful Array | constructive algorithms greedy math | Statement | B | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 1000.0 | Codeforces Round #816 (Div. 2) editorial | |
| 36176 | 2-3 Moves | greedy math | Statement | A | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 15691 | Madoka and Underground Competitions | constructive algorithms greedy | Statement | B | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 1000.0 | Codeforces Round #818 (Div. 2) Editorial. | 1100 |
| 15991 | Madoka and Formal Statement | greedy math | Statement | C | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 1500.0 | Codeforces Round #818 (Div. 2) Editorial. | 1300 |
| 3527 | 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 | |
| 1882 | 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 | |
| 5969 | 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 | |
| 6471 | 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 | |
| 447 | 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 | |
| 22497 | Interesting Sum | data structures greedy math | Statement | B | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1000.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 18316 | Corners | greedy implementation | Statement | C | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1250.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 14657 | Min-Max Array Transformation | binary search greedy two pointers | Statement | C | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 7789 | Maximum AND | bitmasks brute force divide and conquer greedy math sortings | Statement | D | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 26849 | Line | greedy sortings | Statement | D | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1100 | |
| 14473 | Even-Odd XOR | bitmasks constructive algorithms greedy | Statement | G | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1500 | |
| 30580 | Basketball Together | binary search greedy sortings | Statement | B | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 433 | 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 | |
| 38885 | 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 | |
| 2065 | 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 | ||
| 20709 | Best Permutation | constructive algorithms greedy | Statement | B | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 18089 | Digital Logarithm | data structures greedy | Statement | C | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 25506 | Colored Balls: Revisited | greedy implementation sortings | Statement | A | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 32634 | Decode String | greedy strings | Statement | B | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 32355 | Friends and the Restaurant | greedy two pointers | Statement | D | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 18043 | Minimum Notation | data structures greedy math sortings | Statement | C | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 1500.0 | Codeforces Round #823 — editorial | 1200 |
| 17962 | 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 |
| 24983 | Planets | data structures data structures greedy sortings | Statement | A | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 500.0 | Codeforces Round #823 — editorial | 800 |
| 3551 | 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 | |
| 23741 | 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 | |
| 28195 | 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 | |
| 7907 | Sheikh (Easy version) | binary search bitmasks greedy two pointers | Statement | C1 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1000.0 | 108327 | 1800 |
| 3148 | 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 |
| 17534 | Ugu | dp greedy | Statement | B | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 750.0 | 108327 | 900 |
| 4797 | Zero-One (Hard Version) | dp greedy | Statement | D2 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 750.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 15138 | Zero-One (Easy Version) | dp greedy math | Statement | D1 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 21905 | Consecutive Sum | greedy sortings | Statement | A | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 7118 | 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 | |
| 30214 | Removing Smallest Multiples | greedy math | Statement | C | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 1250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 22484 | Select Three Sticks | greedy math sortings | Statement | A | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 500.0 | Codeforces Round #822 (Div.2) Editorial | |
| 1266 | House Planning | constructive algorithms data structures flows graph matchings greedy | Statement | E | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 2250.0 | Codeforces Round #824 — editorial | |
| 21124 | Working Week | constructive algorithms greedy math | Statement | A | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 500.0 | Codeforces Round #824 — editorial | |
| 11033 | Phase Shift | dfs and similar dsu graphs greedy strings | Statement | C | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 1250.0 | Codeforces Round #824 — editorial | |
| 19517 | Tea with Tangerines | greedy math | Statement | B | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 750.0 | Codeforces Round #824 — editorial | |
| 2805 | Equal Binary Subsequences | constructive algorithms greedy strings | Statement | D | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 889 | Swap and Take | dp greedy | Statement | E | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2500.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 2124 | Ela and the Wiring Wizard | graphs greedy shortest paths | Statement | D | Dytechlab Cup 2022 {1737} | PROGRAMMING | 2000.0 | Editorial of Dytechlab Cup 2022 | |
| 10905 | Ela Sorting Books | greedy implementation strings | Statement | A | Dytechlab Cup 2022 {1737} | PROGRAMMING | 500.0 | Editorial of Dytechlab Cup 2022 | |
| 577 | 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> | |
| 1408 | 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> | |
| 12989 | 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> | |
| 14230 | Glory Addicts | greedy implementation | Statement | A | Codeforces Global Round 22 {1738} | PROGRAMMING | 500.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 6409 | 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 | ||
| 24619 | Array Recovery | constructive algorithms greedy math | Statement | B | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 12427 | Bricks and Bags | constructive algorithms games greedy sortings | Statement | C | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1500.0 | Tutorial | 1400 |
| 9143 | Knowledge Cards | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1750.0 | Tutorial | 1500 |
| 5130 | 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 |
| 14384 | Jumbo Extra Cheese 2 | geometry greedy sortings | Statement | B | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1000.0 | Tutorial | 800 |
| 19556 | Minimize the Thickness | brute force greedy math two pointers | Statement | C | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 40689 | Scuza | binary search greedy math | Statement | E | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 13587 | Orray | bitmasks brute force greedy math | Statement | G | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 35798 | Coprime | brute force greedy number theory | Statement | D | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 14249 | Smaller | constructive algorithms greedy strings | Statement | F | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 62385 | Increasing | greedy implementation sortings | Statement | B | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 20805 | 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 | |
| 1911 | FTL | binary search dp greedy | Statement | E | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 2400 | |
| 23261 | Permutation Value | greedy | Statement | B | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 800 | |
| 28889 | Number Replacement | greedy implementation | Statement | A | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 24769 | Divisibility by 2^n | greedy math sortings | Statement | D | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 21192 | Maxmina | constructive algorithms greedy | Statement | A | Codeforces Global Round 23 {1746} | PROGRAMMING | 500.0 | Codeforces Global Round 23 Editorial | |
| 18740 | Rebellion | constructive algorithms greedy | Statement | B | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial | |
| 14171 | Permutation Operations | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial | |
| 5155 | 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 | |
| 26559 | Two Groups | constructive algorithms greedy | Statement | A | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 500.0 | Codeforces Round #832 (Div. 2) Editorial | |
| 13248 | 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 |
| 15895 | Number Game | games greedy implementation | Statement | C | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 22726 | Death's Blessing | greedy | Statement | B | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 1697 | 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 | |
| 16860 | 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 | |
| 16568 | Make Nonzero Sum (easy version) | constructive algorithms dp greedy | Statement | A1 | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 500.0 | Tutorial | 1300 |
| 11711 | Make Nonzero Sum (hard version) | constructive algorithms dp greedy | Statement | A2 | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 500.0 | Tutorial | 1500 |
| 15217 | Factorial Divisibility | greedy math | Statement | B | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 750.0 | Tutorial | 1600 |
| 438 | N Machines | binary search brute force greedy | Statement | E | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 2500.0 | Tutorial | 3300 |
| 15360 | Almost All Multiples | greedy number theory | Statement | C | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 1500.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 5628 | Restore the Permutation | binary search data structures greedy math | Statement | G | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 4564 | All Possible Digits | binary search data structures greedy math number theory | Statement | F | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 19549 | Thermostat | greedy math shortest paths | Statement | C | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 15148 | Quests | binary search greedy sortings | Statement | F | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 10640 | SlavicG's Favorite Problem | bitmasks brute force constructive algorithms data structures dfs and similar graphs greedy | Statement | G | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 23200 | Binary Inversions | data structures greedy math | Statement | E | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 54111 | Atilla's Favorite Problem | greedy implementation strings | Statement | B | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 10809 | Set Construction | constructive algorithms dfs and similar graphs greedy | Statement | C | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1250.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 2198 | Make It Connected | constructive algorithms graphs greedy | Statement | E | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1750.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 14837 | Elimination of a Ring | constructive algorithms greedy implementation | Statement | B | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1000.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 20681 | Divide and Conquer | greedy math number theory | Statement | A | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 500.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 17093 | Absolute Maximization | bitmasks constructive algorithms greedy math | Statement | A | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 500.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 7931 | Another Array Problem | brute force constructive algorithms greedy | Statement | C | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 1500.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 1459 | Doremy's Number Line | binary search dp greedy sortings | Statement | E | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 10521 | Doremy's City Construction | constructive algorithms greedy math | Statement | C | Codeforces Global Round 24 {1764} | PROGRAMMING | 1500.0 | Codeforces Global Round 24 Editorial | |
| 17530 | Doremy's Paint | greedy | Statement | A | Codeforces Global Round 24 {1764} | PROGRAMMING | 500.0 | Codeforces Global Round 24 Editorial | |
| 6836 | Torus Path | dp greedy math | Statement | K | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1500 | |
| 6084 | Number Reduction | greedy | Statement | N | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1500 | |
| 1561 | Hospital Queue | binary search graphs greedy | Statement | H | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2200 | |
| 9930 | Broken Keyboard | greedy | Statement | B | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 800 | |
| 10932 | Lucky Chains | brute force dp greedy math number theory | Statement | D | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 24054 | Notepad# | brute force greedy implementation | Statement | B | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 11297 | Playoff | combinatorics constructive algorithms dp graphs greedy | Statement | D | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 22156 | Block Towers | greedy sortings | Statement | B | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 15836 | Elemental Decompress | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 9237 | Lucky Permutation | dfs and similar dsu graphs greedy | Statement | D | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1750.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 25854 | Quick Sort | greedy math | Statement | B | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1000.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 31192 | Greatest Convex | greedy math number theory | Statement | A | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 25411 | Koxia and Whiteboards | brute force greedy | Statement | A | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 500.0 | Good Bye 2022 -- Editorial | |
| 1634 | Gaining Rating | binary search greedy math sortings | Statement | G | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 26419 | Different Differences | greedy math | Statement | C | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 13352 | Ice and Fire | constructive algorithms dp greedy | Statement | C | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1500.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 14111 | Coloring | constructive algorithms greedy | Statement | B | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 4013 | Two Chess Pieces | dfs and similar dp greedy trees | Statement | E | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 2000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 916 | Laboratory on Pluto | brute force combinatorics dp fft greedy math | Statement | F | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 3000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 20040 | 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 | |
| 3941 | The Human Equation | data structures dp dsu greedy | Statement | E | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 2250.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 4214 | Train Splitting | constructive algorithms graphs greedy | Statement | F | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 924 | Spinach Pizza | games geometry greedy interactive | Statement | I | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 993 | Library game | games greedy interactive sortings | Statement | C | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 8030 | Walking Boy | greedy | Statement | A | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 577 | Teamwork | greedy | Statement | D | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 47049 | Everybody Likes Good Arrays! | greedy math | Statement | A | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 500.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 19382 | Emordnilap | greedy math | Statement | B | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 1000.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 25848 | Flip Flop Sum | greedy implementation | Statement | A | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 500.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 14618 | The Forbidden Permutation | greedy math | Statement | B | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1000.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 9139 | Boris and His Amazing Haircut | constructive algorithms data structures dp dsu greedy | Statement | D | Hello 2023 {1779} | PROGRAMMING | 1500.0 | ||
| 2079 | Anya's Simultaneous Exhibition | constructive algorithms data structures graphs greedy interactive sortings | Statement | E | Hello 2023 {1779} | PROGRAMMING | 2250.0 | ||
| 24129 | Hall of Fame | constructive algorithms greedy math strings | Statement | A | Hello 2023 {1779} | PROGRAMMING | 500.0 | ||
| 14672 | Least Prefix Sum | data structures greedy | Statement | C | Hello 2023 {1779} | PROGRAMMING | 1250.0 | ||
| 27247 | GCD Partition | brute force greedy math number theory | Statement | B | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1000.0 | 111841 | |
| 22763 | Hayato and School | constructive algorithms greedy | Statement | A | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 500.0 | 111841 | |
| 1451 | Rectangle Shrinking | binary search data structures greedy implementation two pointers | Statement | E | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 2750.0 | Tutorial | |
| 10919 | Equal Frequencies | greedy implementation | Statement | C | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 1500.0 | Tutorial | |
| 11020 | Yet Another Tournament | binary search greedy sortings | Statement | C | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 1415 | Double Sort II | dfs and similar flows graphs greedy | Statement | F | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 17314 | Monsters (easy version) | greedy | Statement | A | VK Cup 2022 - Финальный раунд (Engine) {1784} | PROGRAMMING | 500.0 | Codeforces Round #850 Editorial | |
| 2781 | The Harmonization of XOR | bitmasks constructive algorithms greedy math | Statement | E | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 2250.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 8433 | Remove the Bracket | dp greedy math | Statement | C | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 1750.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 15156 | Number Factorization | greedy math number theory | Statement | B | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 1000.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 22575 | Sum of Two Numbers | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1000.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 19615 | Matching Numbers | constructive algorithms greedy math | Statement | C | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1500.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 1020 | Serval and Brain Power | brute force dp dp greedy implementation | Statement | F | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 2750.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 4129 | Timofey and Black-White Tree | brute force dfs and similar divide and conquer graphs greedy math shortest paths trees | Statement | F | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 33385 | Matryoshkas | data structures greedy sortings | Statement | D | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 29124 | Taisia and Dice | greedy greedy math | Statement | B | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 6121 | Teleporters (Hard Version) | binary search greedy sortings | Statement | G2 | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 52072 | Distinct Split | brute force greedy strings | Statement | D | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 43178 | Negatives and Positives | greedy sortings | Statement | E | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 35679 | Teleporters (Easy Version) | greedy sortings | Statement | G1 | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 17030 | Min Max Sort | binary search brute force greedy math | Statement | C | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 24419 | Stand-up Comedian | greedy math | Statement | B | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 31217 | GamingForces | greedy sortings | Statement | A | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 1361 | Velepin and Marketing | data structures dp greedy sortings | Statement | E | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 2500.0 | Codeforces Round #852 Editorial | |
| 7230 | Moscow Gorillas | dp greedy implementation two pointers | Statement | D | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 1750.0 | Codeforces Round #852 Editorial | |
| 18887 | Yet Another Promotion | greedy math | Statement | A | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 500.0 | Codeforces Round #852 Editorial | |
| 23256 | Scoring Subsequences | binary search greedy math two pointers | Statement | C | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1250.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 42602 | Not Dividing | constructive algorithms greedy math | Statement | B | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 1400 | Blocking Chips | binary search dfs and similar dp greedy | Statement | F | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 24301 | Ideal Point | geometry greedy | Statement | B | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 5539 | Maximum Subarray | data structures dp greedy | Statement | D | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 1067 | Colored Subgraphs | data structures dp greedy trees | Statement | E | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 9039 | Li Hua and Chess | brute force constructive algorithms greedy hashing interactive | Statement | C | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1500.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 19638 | Li Hua and Maze | constructive algorithms greedy | Statement | A | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 500.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 26042 | Li Hua and Pattern | constructive algorithms greedy | Statement | B | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1000.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 19004 | Three Sevens | brute force data structures greedy implementation | Statement | B | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 860 (Div. 2) | 1000 |
| 14725 | Shocking Arrangement | constructive algorithms greedy math | Statement | D | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round 860 (Div. 2) | 1600 |
| 9538 | Candy Store | greedy math number theory | Statement | C | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 860 (Div. 2) | 1700 |
| 21141 | Showstopper | greedy implementation sortings | Statement | A | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 860 (Div. 2) | 800 |
| 12917 | Equalize by Divide | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1000.0 | Codeforces Round #854 Editorial | |
| 1102 | Halve or Subtract | brute force flows greedy sortings | Statement | F | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 2500.0 | Codeforces Round #854 Editorial | |
| 1425 | City Union | constructive algorithms dp geometry greedy implementation math | Statement | E | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 2250.0 | Codeforces Round #854 Editorial | |
| 7020 | 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 | |
| 12426 | Recent Actions | data structures greedy implementation math | Statement | A | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 500.0 | Codeforces Round #854 Editorial | |
| 15543 | Unforgivable Curse (hard version) | brute force constructive algorithms constructive algorithms dsu graphs greedy | Statement | E2 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 15914 | Unforgivable Curse (easy version) | brute force constructive algorithms dsu graphs greedy | Statement | E1 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 27511 | Powering the Hero (easy version) | data structures greedy | Statement | C1 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 27692 | Powering the Hero (hard version) | data structures greedy | Statement | C2 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 30109 | Remove Two Letters | data structures greedy hashing strings | Statement | D | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial |