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 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 10095 | Diverse Matrix | constructive algorithms greedy math number theory | Statement | C | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 1400 | |
| 3903 | Decreasing Debts | constructive algorithms data structures graphs greedy implementation math two pointers | Statement | D | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2000 | |
| 3125 | Just Arrange the Icons | greedy implementation math | Statement | J | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 1900 | |
| 6523 | Domino for Young | dp greedy math | Statement | B | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 2000 | |
| 17477 | Interesting Subarray | constructive algorithms greedy math | Statement | B | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1300 | |
| 17862 | Card Game | games greedy math | Statement | A | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 700 | |
| 12137 | Blocks | greedy math | Statement | B | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 1300 | |
| 15716 | Suits | brute force greedy math | Statement | A | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 900 | |
| 22206 | Three Friends | brute force greedy math sortings | Statement | A | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 900 | |
| 1794 | Beautiful Rectangle | brute force combinatorics constructive algorithms data structures greedy math | Statement | C | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 2300 | |
| 14252 | A and B | greedy math | Statement | B | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 1500 | |
| 1273 | Miss Punyverse | dp greedy trees | Statement | D | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2700 | |
| 4693 | Petya and Exam | greedy sortings two pointers | Statement | C | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 1800 | |
| 20844 | Even But Not Even | greedy math strings | Statement | A | Codeforces Round 616 (Div. 2) {1291} | PROGRAMMING | 500.0 | Codeforces Round #616 Editorial | 1000 |
| 1025 | Chaotic V. | dp graphs greedy math number theory trees | Statement | D | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 1750.0 | Codeforces Round #614 Editorial | 2700 |
| 469 | Rin and The Unknown Flower | constructive algorithms greedy interactive math | Statement | E | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 2250.0 | Codeforces Round #614 Editorial | 3500 |
| 22397 | JOE is on TV! | combinatorics greedy math | Statement | B | Codeforces Round 614 (Div. 2) {1293} | PROGRAMMING | 750.0 | Codeforces Round #614 Editorial | 1000 |
| 48094 | Product of Three Numbers | greedy math number theory | Statement | C | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 1300 | |
| 12776 | MEX maximizing | data structures greedy implementation math | Statement | D | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 1600 | |
| 5268 | Obtain a Permutation | greedy implementation math | Statement | E | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 2000 | |
| 12653 | Anu Has a Function | brute force greedy math | Statement | A | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 500.0 | Codeforces Round #618 Editorial | 1500 |
| 9950 | Ayoub's function | binary search combinatorics greedy math strings | Statement | C | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 1250.0 | Codeforces Round #619 (Div. 2) Editorial | 1700 |
| 3294 | Kuroni and the Score Distribution | constructive algorithms greedy implementation math | Statement | E | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 2000.0 | Ozon Tech Challenge 2020 Editorial | 2100 |
| 13912 | Cow and Friend | geometry greedy math | Statement | B | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 1000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1300 |
| 1422 | Cow and Treats | binary search combinatorics dp greedy implementation math | Statement | E | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 2500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 2400 |
| 46647 | Add Odd or Subtract Even | greedy implementation math | Statement | A | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 700 | |
| 18502 | Adding Powers | bitmasks greedy implementation math number theory ternary search | Statement | C | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 7040 | Different Rules | binary search constructive algorithms greedy implementation math | Statement | B | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1700 |
| 16535 | Permutation Partitions | combinatorics greedy math | Statement | C | Codeforces Global Round 7 {1326} | PROGRAMMING | 1000.0 | 74961 | 1300 |
| 14668 | Carousel | greedy math | Statement | D | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 1800 | |
| 9793 | Dreamoon Likes Coloring | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 500.0 | Codeforces Round #631 Editorial | 1800 |
| 19902 | Exercising Walk | greedy implementation math | Statement | A | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 500.0 | Codeforces Round #630 Editorial | 1200 |
| 19273 | Composite Coloring | brute force constructive algorithms greedy math number theory | Statement | B | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1000.0 | Codeforces Round #630 Editorial | 1500 |
| 4165 | Challenges in school №41 | brute force constructive algorithms games graphs greedy implementation sortings | Statement | D | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1750.0 | Codeforces Round #632 (Div. 2) editorial | |
| 4606 | Kate and imperfection | greedy implementation math number theory sortings two pointers | Statement | F | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 2500.0 | Codeforces Round #632 (Div. 2) editorial | |
| 18117 | Circle of Monsters | brute force constructive algorithms greedy math | Statement | C | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 3219 | Divisor Paths | combinatorics graphs greedy math number theory | Statement | E | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 12314 | Xenia and Colorful Gems | binary search greedy math sortings two pointers | Statement | B | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 750.0 | Codeforces Round #635 Editorial | 1800 |
| 37110 | Kana and Dragon Quest game | greedy implementation math | Statement | B | Codeforces Round 635 (Div. 2) {1337} | PROGRAMMING | 1000.0 | Codeforces Round #635 Editorial | 1000 |
| 3482 | Perfect Triples | bitmasks brute force constructive algorithms divide and conquer greedy implementation math | Statement | C | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1500.0 | Editorial | |
| 9664 | Edge Weight Assignment | bitmasks constructive algorithms greedy math trees | Statement | B | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1000.0 | Editorial | |
| 31276 | Powered Addition | greedy math | Statement | A | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 500.0 | Editorial | |
| 47009 | Road To Zero | greedy math | Statement | A | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 1100 | |
| 1326 | Résumé Review | binary search greedy math | Statement | D | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1750.0 | Codeforces Round #639 Editorial | 2700 |
| 256 | Dune II: Battle For Arrakis | *special data structures greedy math | Statement | F | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2000 | |
| 9380 | Phoenix and Science | binary search bitmasks constructive algorithms greedy math | Statement | D | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 2000.0 | Codeforces Round #638 (Div. 2) Editorial | 1900 |
| 43250 | Phoenix and Balance | greedy math | Statement | A | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 500.0 | Codeforces Round #638 (Div. 2) Editorial | 800 |
| 9012 | Orac and Medians | constructive algorithms greedy math | Statement | B | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 1250.0 | Codeforces Round #641 Editorial | 2000 |
| 44942 | Most Unstable Array | constructive algorithms greedy math | Statement | A | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 800 | |
| 5936 | Restorer Distance | binary search greedy math sortings ternary search | Statement | E | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 2000.0 | Codeforces Round #643 (Div. 2) Editorial | 2100 |
| 31919 | Berland Poker | brute force greedy math | Statement | A | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 1000 | |
| 8392 | A/B Matrix | constructive algorithms flows greedy math number theory | Statement | G | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1900 | |
| 57719 | Minimal Square | greedy math | Statement | A | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 800 | |
| 3880 | Johnny and Grandmaster | greedy implementation math sortings | Statement | B | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 1250.0 | Codeforces Round #647 Editorial | 1900 |
| 364 | Johnny and James | greedy implementation math trees | Statement | D | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 2500.0 | Codeforces Round #647 Editorial | 2900 |
| 24600 | Johnny and Another Rating Drop | bitmasks greedy math | Statement | C | Codeforces Round 647 (Div. 2) - Thanks, Algo Muse! {1362} | PROGRAMMING | 1500.0 | Codeforces Round #647 Editorial | 1400 |
| 33273 | Shovels and Swords | binary search greedy math | Statement | A | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 14307 | Palindromic Paths | dsu greedy math | Statement | C | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 25490 | Social Distance | constructive algorithms greedy math | Statement | C | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 65366 | Even Array | greedy math | Statement | B | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 14136 | AND, OR and square sum | bitmasks greedy math | Statement | D | Codeforces Global Round 8 {1368} | PROGRAMMING | 1750.0 | Codeforces Global Round 8: editorial | |
| 21687 | Codeforces Subsequences | brute force constructive algorithms greedy math strings | Statement | B | Codeforces Global Round 8 {1368} | PROGRAMMING | 1000.0 | Codeforces Global Round 8: editorial | |
| 46988 | C+= | brute force greedy math | Statement | A | Codeforces Global Round 8 {1368} | PROGRAMMING | 500.0 | Codeforces Global Round 8: editorial | |
| 1123 | Lamps on a Circle | games greedy implementation interactive math | Statement | F | Codeforces Global Round 8 {1368} | PROGRAMMING | 3000.0 | Codeforces Global Round 8: editorial | |
| 21040 | RationalLee | greedy math sortings | Statement | C | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 1500.0 | Codeforces Round #652 (Div. 2) Editorial | 1400 |
| 9274 | TediousLee | dp graphs greedy math matrices trees | Statement | D | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2000.0 | Codeforces Round #652 (Div. 2) Editorial | 1900 |
| 66256 | Maximum GCD | brute force greedy implementation number theory | Statement | A | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 500.0 | Editorial — Codeforces Round #651 | |
| 21476 | A Cookie for You | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1250.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 13759 | Grid-00100 | constructive algorithms greedy math | Statement | D | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1500.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 37690 | Omkar and Last Class of Math | constructive algorithms greedy math number theory | Statement | B | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 1000.0 | Codeforces Round #655 Editorial | 1300 |
| 19480 | Pluses and Minuses | binary search dp greedy implementation math | Statement | C | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 2985 | Sum of Digits | brute force constructive algorithms dp greedy math number theory | Statement | E | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 29825 | Donut Shops | greedy implementation math | Statement | A | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 6154 | Choosing flowers | binary search data structures greedy math sortings two pointers | Statement | C | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 1250.0 | Codeforces Round #657 Editorial | 2000 |
| 5058 | Berserk And Fireball | brute force greedy math | Statement | D | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 994 | Circular Dungeon | greedy math probabilities | Statement | G | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 5553 | GameGame | bitmasks constructive algorithms dp games greedy math | Statement | B | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 22873 | Captain Flint and a Long Voyage | greedy math | Statement | B | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1000.0 | Codeforces Round #660 Editorial | 1000 |
| 10471 | Uncle Bogdan and Country Happiness | dfs and similar dp greedy math trees | Statement | C | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1500.0 | Codeforces Round #660 Editorial | 1800 |
| 4579 | Segment Intersections | binary search brute force greedy implementation math | Statement | D | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 51080 | LCM Problem | constructive algorithms greedy math number theory | Statement | A | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 20903 | Array Walk | dp greedy math | Statement | B | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 2428 | Omkar and Landslide | binary search constructive algorithms greedy math | Statement | F | Codeforces Global Round 10 {1392} | PROGRAMMING | 2500.0 | Codeforces Global Round 10 — Editorial | |
| 9981 | Omkar and Bed Wars | constructive algorithms dp greedy math strings | Statement | D | Codeforces Global Round 10 {1392} | PROGRAMMING | 1500.0 | Codeforces Global Round 10 — Editorial | |
| 11089 | Pinkie Pie Eats Patty-cakes | binary search constructive algorithms data structures greedy math sortings | Statement | C | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 20850 | Rainbow Dash, Fluttershy and Chess Coloring | greedy math | Statement | A | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 500.0 | Codeforces Round #662 Editorial | |
| 2620 | Two Types of Spells | binary search data structures greedy implementation math sortings | Statement | E | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 11743 | RPG Protagonist | binary search brute force greedy math | Statement | B | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 10716 | Maximum Distributed Tree | constructive algorithms dfs and similar greedy math number theory sortings trees | Statement | D | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1750.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 21841 | Ternary Sequence | constructive algorithms greedy math | Statement | B | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1000.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 3847 | Three Sequences | binary search data structures greedy math | Statement | D | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 2000.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 23221 | Subset Mex | greedy implementation math | Statement | A | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 500.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 18197 | Big Vova | brute force greedy math number theory | Statement | B | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 1000.0 | Codeforces Round #669 Editorial | |
| 10492 | Arrays Sum | constructive algorithms greedy math | Statement | B | Grakn Forces 2020 {1408} | PROGRAMMING | 1000.0 | Grakn Forces -- Editorial | |
| 31196 | Minimum Product | brute force greedy math | Statement | B | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 21610 | Decrease the Sum of Digits | greedy math | Statement | D | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 1855 | Poman Numbers | greedy implementation math | Statement | E | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 2250.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 490 | The Thorny Path | greedy math matrices | Statement | F | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 2750.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 3039 | New Game Plus! | constructive algorithms greedy math | Statement | E | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 6755 | Make Them Equal | constructive algorithms greedy math | Statement | B | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 1000.0 | Codeforces Round #673 Editorial | 2000 |
| 15114 | Two Arrays | greedy math sortings | Statement | B | Codeforces Round 673 (Div. 2) {1417} | PROGRAMMING | 1000.0 | Codeforces Round #673 Editorial | 1100 |
| 18769 | Copy-paste | greedy math | Statement | A | Codeforces Round 673 (Div. 2) {1417} | PROGRAMMING | 500.0 | Codeforces Round #673 Editorial | 800 |
| 17081 | Stairs | brute force constructive algorithms greedy implementation math two pointers | Statement | B | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 750.0 | Codeforces Round #671 Editorial | |
| 16375 | Killjoy | greedy implementation math | Statement | C | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 1250.0 | Codeforces Round #671 Editorial | |
| 36418 | XORwice | bitmasks greedy math | Statement | A | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 500.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 8191 | Rock, Paper, Scissors | brute force constructive algorithms flows greedy math | Statement | E | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1800 | |
| 4325 | Carrots for Rabbits | binary search data structures greedy math | Statement | E | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1750.0 | Codeforces Raif Round 1 Editorial | |
| 18503 | Marketing Scheme | brute force constructive algorithms greedy math | Statement | A | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 32134 | Sum of Medians | greedy math | Statement | B | Codeforces Round 684 (Div. 2) {1440} | PROGRAMMING | 1000.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 16734 | Saving the City | greedy math sortings | Statement | B | Codeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final) {1443} | PROGRAMMING | 1000.0 | VK Cup 2019-2020 -- Engine Editorial | |
| 28115 | Numbers Box | greedy math | Statement | B | Codeforces Round 683 (Div. 2, by Meet IT) {1447} | PROGRAMMING | 1000.0 | Meet IT Codeforces Round Editorial | |
| 25379 | Subtract or Divide | greedy math | Statement | A | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 500.0 | Editorial — Codeforces Round #685 | |
| 15561 | Toy Blocks | binary search greedy math sortings | Statement | B | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 4468 | Checkpoints | brute force constructive algorithms greedy math probabilities | Statement | D | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 2000.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 1679 | Four Points | brute force constructive algorithms flows geometry greedy math ternary search | Statement | E | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 2238 | Water Level | brute force graphs greedy implementation math | Statement | E | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 2250.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 36839 | Unique Number | dp greedy math | Statement | C | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 18327 | Add to Neighbour and Remove | greedy math number theory | Statement | D | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 649 | Finding satisfactory solutions | dp graphs greedy math | Statement | H | Good Bye 2020 {1466} | PROGRAMMING | 3500.0 | Good Bye 2020 Editorial | |
| 25394 | Wizard of Orz | greedy math | Statement | A | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 500.0 | Codeforces Round #695 (Div. 2) Editorial | 900 |
| 382 | Prime Divisors Selection | greedy math number theory | Statement | L | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 20006 | Strange List | brute force greedy implementation math | Statement | B | Codeforces Round 694 (Div. 2) {1471} | PROGRAMMING | 750.0 | Codeforces Round #694 Editorial | |
| 40205 | Strange Partition | greedy math number theory | Statement | A | Codeforces Round 694 (Div. 2) {1471} | PROGRAMMING | 500.0 | Codeforces Round #694 Editorial | |
| 45936 | Cards for Friends | greedy math | Statement | A | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 42131 | Different Divisors | binary search constructive algorithms greedy math number theory | Statement | B | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 1000.0 | Codeforces Round #696 Editorial | |
| 21748 | Inflation | binary search brute force greedy math | Statement | B | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 45591 | K-divisible Sum | binary search constructive algorithms greedy math | Statement | A | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 7516 | Painting the Array I | constructive algorithms data structures dp greedy implementation | Statement | B1 | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #700 | |
| 4503 | Painting the Array II | data structures dp greedy implementation | Statement | B2 | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #700 | |
| 4911 | AB Graph | constructive algorithms graphs greedy implementation strings | Statement | D | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 2000.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 34878 | Add and Divide | brute force greedy math ternary search | Statement | A | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #701 (Div. 2) | 1000 |
| 15541 | Minimum Ties | brute force constructive algorithms dfs and similar graphs greedy implementation math | Statement | C | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 18605 | Equalize the Array | binary search data structures greedy math sortings | Statement | F | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 33171 | Dense Array | greedy math | Statement | A | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 14288 | Minimal Cost | brute force greedy implementation math | Statement | B | Codeforces Global Round 13 {1491} | PROGRAMMING | 750.0 | Codeforces Global Round 13 Editorial | |
| 21020 | Card Deck | data structures greedy math | Statement | B | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1000.0 | Codeforces Round #704 Editorial | |
| 17985 | Diamond Miner | geometry greedy math sortings | Statement | A | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 500.0 | Codeforces Round #706 Editorial | |
| 28628 | M-arrays | constructive algorithms greedy math | Statement | B | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 750.0 | Codeforces Round #708 Editorial | 1200 |
| 9167 | Square-free division (easy version) | data structures dp greedy math number theory | Statement | E1 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 1700 |
| 1949 | Square-free division (hard version) | data structures dp greedy hashing math number theory | Statement | E2 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 2500 |
| 26905 | Flip the Bits | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 712 (Div. 2) {1504} | PROGRAMMING | 1000.0 | Codeforces Round #712 Editorial | 1200 |
| 3744 | Triangular Paths | constructive algorithms greedy math shortest paths sortings | Statement | F | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 6715 | 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 | |
| 1770 | Complete the MST | data structures dfs and similar dsu graphs greedy math | Statement | C | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1500.0 | Codeforces Round #715 Editorial | |
| 598 | Is It Rated? | greedy interactive math probabilities | Statement | I | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 6871 | Education | binary search greedy implementation math | Statement | F | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 11469 | Permutation by Sum | greedy math | Statement | E | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 26974 | Sum of 2050 | greedy math | Statement | A | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 500.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 29679 | Arranging The Sheep | dp greedy math | Statement | E | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 745 | Nastia and a Beautiful Matrix | binary search constructive algorithms greedy math | Statement | E | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2750.0 | 90477 | |
| 12999 | Histogram Ugliness | greedy implementation math | Statement | B | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1000.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 34457 | Array Reodering | brute force greedy math number theory sortings | Statement | B | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 44314 | Bad Boy | constructive algorithms greedy math | Statement | B | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 750.0 | Codeforces Round #726 (Div.2) Editorial | |
| 30650 | Challenging Cliffs | greedy implementation math | Statement | C | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1000.0 | Codeforces Round #726 (Div.2) Editorial | |
| 41388 | Arithmetic Array | greedy math | Statement | A | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 500.0 | Codeforces Round #726 (Div.2) Editorial | |
| 5291 | Gift Set | binary search geometry greedy math ternary search | Statement | G | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 24627 | Customising the Track | combinatorics greedy math | Statement | B | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 750.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 43043 | Exciting Bets | greedy math number theory | Statement | A | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 500.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 29570 | Find The Array | greedy math | Statement | A | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 28732 | Maximum Cost Deletion | greedy math | Statement | B | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 13931 | Cobb | bitmasks brute force greedy math | Statement | B | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #735 (Div. 2) | 1700 |
| 500 | DIY Tree | graphs greedy math | Statement | H | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 3500.0 | 94384 | 3300 |
| 19600 | Make a Power of Two | greedy math strings | Statement | D | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 1300 | |
| 26431 | The Miracle and the Sleeper | greedy math | Statement | A | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 25559 | Median Maximization | greedy math | Statement | A | Codeforces Global Round 16 {1566} | PROGRAMMING | 500.0 | Codeforces Global Round 16 Editorial | |
| 4921 | Expression Evaluation Error | constructive algorithms greedy implementation math | Statement | D | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 1750.0 | Codeforces Round #742 Editorial | |
| 15640 | Swaps | greedy math | Statement | B | Codeforces Round 743 (Div. 2) {1573} | PROGRAMMING | 1000.0 | Tutorial | 1400 |
| 18282 | Combinatorics Homework | combinatorics greedy math | Statement | B | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 5403 | Array Stabilization (AND version) | binary search brute force graphs greedy implementation math number theory shortest paths | Statement | F | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 25580 | Permutation Minimization by Deque | constructive algorithms greedy math | Statement | E1 | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 12619 | Diameter of Graph | constructive algorithms graphs greedy math | Statement | B | Codeforces Round 745 (Div. 2) {1581} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 1200 |
| 4278 | Pchelyonok and Segments | binary search data structures dp greedy math | Statement | E | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 2500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 17826 | Two Arrays | greedy math sortings | Statement | C | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 1000.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 900 |
| 5097 | Minimize Distance | greedy math | Statement | C | Codeforces Round 759 (Div. 2, based on Technocup 2022 Elimination Round 3) {1591} | PROGRAMMING | 1500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 1953 | Bored Bakry | bitmasks greedy math two pointers | Statement | E | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 2500.0 | 95583 | |
| 23903 | Gamer Hemose | greedy math sortings | Statement | A | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 500.0 | 95583 | |
| 42806 | Make it Divisible by 25 | dp greedy math math | Statement | B | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 29833 | Make Them Equal | brute force greedy math strings | Statement | C | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1500.0 | 95525 | 1200 |
| 2304 | Extreme Extension | dp greedy math number theory | Statement | C | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #752 | 2300 |
| 18236 | Blue-Red Permutation | greedy math sortings | Statement | D | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 551 | A Stroll Around the Matrix | data structures greedy math | Statement | G | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 3250.0 | Deltix Round, Autumn 2021. Editorial | 3000 |
| 19055 | Divide and Multiply | greedy implementation math number theory | Statement | A | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 500.0 | Deltix Round, Autumn 2021. Editorial | 900 |
| 1966 | AmShZ and G.O.A.T. | binary search brute force greedy math | Statement | E | Codeforces Global Round 17 {1610} | PROGRAMMING | 2500.0 | Codeforces Global Round 17 Editorial | |
| 2884 | Messages | greedy math probabilities sortings | Statement | E | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 18087 | And It's Non-Zero | bitmasks greedy math | Statement | B | Codeforces Global Round 18 {1615} | PROGRAMMING | 1000.0 | Global Round 18 Editorial | |
| 9256 | Menorah | brute force graphs greedy math | Statement | C | Codeforces Global Round 18 {1615} | PROGRAMMING | 1750.0 | Global Round 18 Editorial | |
| 1745 | Purple Crayon | dp games greedy math trees | Statement | E | Codeforces Global Round 18 {1615} | PROGRAMMING | 2750.0 | Global Round 18 Editorial | |
| 21640 | Closing The Gap | greedy math | Statement | A | Codeforces Global Round 18 {1615} | PROGRAMMING | 250.0 | Global Round 18 Editorial | |
| 5661 | Keep the Average High | dp greedy math | Statement | D | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 2000.0 | Good Bye 2021 -- Editorial | 2000 |
| 16079 | Paprika and Permutation | greedy math | Statement | C | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 1986 | Trader Problem | binary search data structures dsu greedy math sortings | Statement | G | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 21055 | Array and Operations | dp greedy math | Statement | D | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 10328 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 7318 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 33173 | Triangles on a Rectangle | geometry greedy math | Statement | B | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 4431 | The Winter Hike | constructive algorithms greedy math | Statement | D | Hello 2022 {1621} | PROGRAMMING | 1750.0 | ||
| 19297 | Palindromes Coloring | binary search greedy sortings strings | Statement | D | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 27054 | 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 | ||
| 18355 | Ancient Civilization | bitmasks greedy math | Statement | A | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 17172 | Meximum Array | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 500.0 | 99276 | |
| 3632 | Grid Xor | constructive algorithms greedy implementation interactive math | Statement | C | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 1250.0 | 99276 | |
| 25440 | GCD Arrays | greedy math number theory | Statement | B | Codeforces Round 767 (Div. 2) {1629} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #767 | |
| 14195 | Strange Test | binary search bitmasks brute force greedy math | Statement | C | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 5419 | New Year Concert | binary search data structures dp greedy math number theory two pointers | Statement | D | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #769 | |
| 15502 | MEX and Array | brute force dp greedy math | Statement | B | Codeforces Global Round 19 {1637} | PROGRAMMING | 1000.0 | Tutorial | |
| 22195 | Reverse | greedy math | Statement | A | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 500.0 | Codeforces Round #771 Editorial | |
| 4492 | Rescheduling the Exam | binary search data structures greedy implementation math sortings | Statement | E | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 657 | Sum of Matchings | dfs and similar greedy implementation math | Statement | E | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 1274 | Parametric MST | binary search graphs greedy math ternary search | Statement | F | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3000.0 | Tutorial | |
| 4479 | Reverse Sort Sum | constructive algorithms data structures greedy implementation math two pointers | Statement | D | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2000.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 32913 | Red Versus Blue | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 15749 | Line Empire | dp greedy implementation math | Statement | C | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 1500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 10656 | Water the Trees | binary search greedy math | Statement | C | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 894 | Teleporters | binary search greedy math | Statement | F | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 19453 | Array Balancing | greedy math | Statement | A | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 15764 | Make it Increasing | brute force greedy math | Statement | A | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 250.0 | Codeforces Round #783 Editorial | 1300 |
| 17993 | Social Distance | greedy math sortings | Statement | B | Codeforces Round 783 (Div. 2) {1668} | PROGRAMMING | 500.0 | Codeforces Round #783 Editorial | 900 |
| 30853 | Maximal AND | bitmasks greedy math | Statement | H | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1300 | |
| 42192 | Odd/Even Increments | greedy greedy implementation math | Statement | C | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 800 | |
| 26821 | Dolce Vita | binary search brute force greedy math | Statement | C | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 977 | Anti-Theft Road Planning | bitmasks constructive algorithms divide and conquer greedy interactive math | Statement | F | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 3250.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 7794 | Breaking the Wall | binary search brute force constructive algorithms greedy math | Statement | E | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 35285 | 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 | ||
| 61893 | Equal Candies | greedy math sortings | Statement | B | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 42668 | AvtoBus | brute force greedy math number theory | Statement | A | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 500.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 1377 | Dog Walking | brute force greedy math | Statement | D | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 777 | Unordered Swaps | constructive algorithms dfs and similar graphs greedy math sortings | Statement | E | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2500.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 16587 | LIS or Reverse LIS? | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 1500.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 11505 | The Enchanted Forest | constructive algorithms greedy math | Statement | A | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 796 | |
| 17144 | Price Maximization | binary search greedy math two pointers | Statement | E | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 1500 | |
| 17361 | 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) | |
| 32327 | Beat The Odds | constructive algorithms greedy math | Statement | A | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 500.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 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 | |
| 7124 | River Locks | binary search dp greedy math | Statement | D | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1750.0 | 103978 | 1900 |
| 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 | ||
| 9575 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 12948 | Good Key, Bad Key | bitmasks brute force dp greedy math | Statement | G | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 17618 | Making Towers | dp greedy math | Statement | B | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 22677 | Difference Operations | greedy math | Statement | A | Codeforces Round 808 (Div. 2) {1708} | PROGRAMMING | 500.0 | 104930 | |
| 711 | Multiset of Strings | dp fft flows graphs greedy math | Statement | F | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 24438 | Crossmarket | constructive algorithms greedy math | Statement | A | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 500.0 | Codeforces Round #816 (Div. 2) editorial | |
| 35500 | 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 | ||
| 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 | |
| 5968 | 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 |