Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
< 1 2 3 4 5 6 7 8 9 10 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2682 | Omkar and Landslide | binary search constructive algorithms greedy math | Statement | F | Codeforces Global Round 10 {1392} | PROGRAMMING | 2500.0 | Codeforces Global Round 10 — Editorial | |
| 10024 | 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 | |
| 19726 | Omkar and Waterslide | greedy implementation | Statement | C | Codeforces Global Round 10 {1392} | PROGRAMMING | 1000.0 | Codeforces Global Round 10 — Editorial | |
| 11105 | 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 | |
| 17470 | Applejack and Storages | data structures greedy implementation | Statement | B | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1000.0 | Codeforces Round #662 Editorial | |
| 20861 | Rainbow Dash, Fluttershy and Chess Coloring | greedy math | Statement | A | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 500.0 | Codeforces Round #662 Editorial | |
| 7164 | Boboniu Chats with Du | brute force dp greedy sortings two pointers | Statement | A | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 500.0 | Codeforces Round #664 Editorial | 1800 |
| 1314 | Boboniu and Jianghu | dp greedy sortings trees | Statement | D | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1750.0 | Codeforces Round #664 Editorial | 2800 |
| 16840 | Multiples of Length | constructive algorithms greedy number theory | Statement | A | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 500.0 | Codeforces Round #666 — Editorial | |
| 29986 | Juggling Letters | greedy strings | Statement | A | Codeforces Round 666 (Div. 2) {1397} | PROGRAMMING | 500.0 | Codeforces Round #666 — Editorial | |
| 2641 | 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 | ||
| 12776 | Colored Rectangles | dp graph matchings greedy sortings | Statement | D | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 26144 | Substring Removal Game | games greedy sortings strings | Statement | B | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 2593 | Weights Division (hard version) | binary search data structures dfs and similar greedy trees two pointers | Statement | E2 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 6430 | Weights Division (easy version) | data structures dfs and similar greedy trees | Statement | E1 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 83237 | Remove Smallest | greedy sortings | Statement | A | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 18651 | Binary String Reconstruction | 2-sat constructive algorithms greedy strings | Statement | C | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 11765 | RPG Protagonist | binary search brute force greedy math | Statement | B | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 1284 | x-prime Substrings | bitmasks dp greedy number theory string suffix structures strings | Statement | F | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 6535 | Clear the Multiset | divide and conquer dp greedy sortings | Statement | E | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 10784 | 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 | |
| 21868 | Ternary Sequence | constructive algorithms greedy math | Statement | B | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1000.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 3873 | 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 | |
| 24813 | Maximum Product | brute force dp greedy implementation sortings | Statement | B | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 1000.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 23293 | Subset Mex | greedy implementation math | Statement | A | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 500.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 18239 | Big Vova | brute force greedy math number theory | Statement | B | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 1000.0 | Codeforces Round #669 Editorial | |
| 2010 | Egor in the Republic of Dagestan | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | E | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2500.0 | Codeforces Round #669 Editorial | |
| 10508 | Arrays Sum | constructive algorithms greedy math | Statement | B | Grakn Forces 2020 {1408} | PROGRAMMING | 1000.0 | Grakn Forces -- Editorial | |
| 2238 | Avoid Rainbow Cycles | dsu graphs greedy sortings | Statement | E | Grakn Forces 2020 {1408} | PROGRAMMING | 2500.0 | Grakn Forces -- Editorial | |
| 31265 | Minimum Product | brute force greedy math | Statement | B | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 21685 | Decrease the Sum of Digits | greedy math | Statement | D | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 2765 | Grime Zoo | constructive algorithms greedy implementation | Statement | D | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 2000.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 1865 | 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 | |
| 527 | 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 | |
| 6962 | Shurikens | data structures greedy implementation | Statement | D | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 2000.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 3058 | 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) | |
| 5221 | XOR Inverse | bitmasks data structures divide and conquer greedy strings trees | Statement | C | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 1250.0 | Codeforces Round #673 Editorial | 2000 |
| 6768 | Make Them Equal | constructive algorithms greedy math | Statement | B | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 1000.0 | Codeforces Round #673 Editorial | 2000 |
| 15149 | Two Arrays | greedy math sortings | Statement | B | Codeforces Round 673 (Div. 2) {1417} | PROGRAMMING | 1000.0 | Codeforces Round #673 Editorial | 1100 |
| 18781 | Copy-paste | greedy math | Statement | A | Codeforces Round 673 (Div. 2) {1417} | PROGRAMMING | 500.0 | Codeforces Round #673 Editorial | 800 |
| 17812 | Negative Prefixes | greedy sortings | Statement | B | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 17660 | Sage's Birthday (hard version) | binary search constructive algorithms greedy implementation sortings two pointers | Statement | D2 | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 1000.0 | Codeforces Round #671 Editorial | |
| 26673 | Sage's Birthday (easy version) | binary search greedy implementation sortings | Statement | D1 | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 750.0 | Codeforces Round #671 Editorial | |
| 17108 | 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 | |
| 16411 | Killjoy | greedy implementation math | Statement | C | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 1250.0 | Codeforces Round #671 Editorial | |
| 5282 | Pokémon Army (hard version) | data structures divide and conquer dp greedy implementation | Statement | C2 | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1250.0 | ||
| 36734 | XORwice | bitmasks greedy math | Statement | A | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 500.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 915 | Minlexes | dp greedy implementation strings | Statement | E | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 2000.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 15142 | Nice Matrix | greedy implementation ternary search | Statement | B | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 750.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 1027 | Excitation of Atoms | greedy implementation | Statement | E | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 2200 | |
| 8214 | Rock, Paper, Scissors | brute force constructive algorithms flows greedy math | Statement | E | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1800 | |
| 11535 | Chess Cheater | greedy implementation sortings | Statement | B | Codeforces Global Round 11 {1427} | PROGRAMMING | 750.0 | Editorial of Global Round 11 | 1400 |
| 431 | Boring Card Game | data structures greedy trees | Statement | F | Codeforces Global Round 11 {1427} | PROGRAMMING | 2250.0 | Editorial of Global Round 11 | 3200 |
| 4371 | 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 | |
| 22924 | ABBB | greedy strings | Statement | C | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1000.0 | Codeforces Raif Round 1 Editorial | |
| 7437 | String Reversal | data structures greedy strings | Statement | E | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 20415 | Barrels | greedy implementation sortings | Statement | B | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 9428 | String Deletion | greedy two pointers | Statement | D | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 30063 | Yet Another Bookshelf | greedy implementation | Statement | B | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 6571 | Bandit in a City | binary search dfs and similar greedy trees | Statement | D | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 2000.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 18514 | Marketing Scheme | brute force constructive algorithms greedy math | Statement | A | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 14629 | Minimal Height Tree | graphs greedy shortest paths trees | Statement | D | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 1503 | Yurii Can Do Everything | brute force divide and conquer greedy implementation | Statement | E | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 2250.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 31162 | Valerii Against Everyone | constructive algorithms greedy sortings | Statement | B | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 750.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 5420 | Binary Table (Hard Version) | constructive algorithms graphs greedy implementation | Statement | A2 | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 500.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 32776 | Sum of Medians | greedy math | Statement | B | Codeforces Round 684 (Div. 2) {1440} | PROGRAMMING | 1000.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 5441 | Identify the Operations | brute force combinatorics data structures dsu greedy implementation | Statement | B | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1000.0 | 84298 | |
| 2032 | Graph Transpositions | graphs greedy shortest paths | Statement | C | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1500.0 | 84298 | |
| 17071 | The Delivery Dilemma | binary search greedy sortings | Statement | C | Codeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final) {1443} | PROGRAMMING | 1500.0 | VK Cup 2019-2020 -- Engine Editorial | |
| 16757 | 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 | |
| 20426 | Array Rearrangment | greedy sortings | Statement | A | Codeforces Round 680 (Div. 2, based on Moscow Team Olympiad) {1445} | PROGRAMMING | 500.0 | Codeforces Round #680 Editorial | |
| 18126 | Knapsack | constructive algorithms greedy sortings | Statement | A | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 500.0 | E | |
| 28662 | Numbers Box | greedy math | Statement | B | Codeforces Round 683 (Div. 2, by Meet IT) {1447} | PROGRAMMING | 1000.0 | Meet IT Codeforces Round Editorial | |
| 17460 | String Equality | dp greedy hashing implementation strings | Statement | C | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #685 | |
| 20481 | Non-Substring Subsequence | greedy implementation strings | Statement | B | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 750.0 | Editorial — Codeforces Round #685 | |
| 25402 | Subtract or Divide | greedy math | Statement | A | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 500.0 | Editorial — Codeforces Round #685 | |
| 15587 | Toy Blocks | binary search greedy math sortings | Statement | B | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 1763 | Two Editorials | brute force data structures greedy implementation | Statement | E | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 2260 | Dog Snacks | binary search dfs and similar dp greedy trees | Statement | E | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 2500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 4478 | 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 | |
| 6277 | Triangles | greedy implementation | Statement | C | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 1500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 4957 | Array Partition | binary search brute force data structures greedy two pointers | Statement | F | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 22670 | Sequence Transformation | greedy implementation | Statement | C | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 1681 | 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 | ||
| 13303 | Sequence and Swaps | dp greedy sortings | Statement | D | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 2248 | 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 | |
| 8827 | The Treasure of The Segments | binary search data structures greedy sortings | Statement | F | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 37010 | Unique Number | dp greedy math | Statement | C | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 18452 | Add to Neighbour and Remove | greedy math number theory | Statement | D | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 717 | Finding satisfactory solutions | dp graphs greedy math | Statement | H | Good Bye 2020 {1466} | PROGRAMMING | 3500.0 | Good Bye 2020 Editorial | |
| 18929 | Canine poetry | dp greedy strings | Statement | C | Good Bye 2020 {1466} | PROGRAMMING | 1000.0 | Good Bye 2020 Editorial | |
| 15331 | 13th Labour of Heracles | greedy trees | Statement | D | Good Bye 2020 {1466} | PROGRAMMING | 1000.0 | Good Bye 2020 Editorial | |
| 25424 | Wizard of Orz | greedy math | Statement | A | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 500.0 | Codeforces Round #695 (Div. 2) Editorial | 900 |
| 9258 | Waste Sorting | flows greedy implementation | Statement | N | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 384 | 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) | ||
| 11766 | Building a Fence | dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 30916 | Strange Birthday Party | dp greedy sortings two pointers | Statement | A | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 500.0 | 86464 | |
| 20024 | Strange List | brute force greedy implementation math | Statement | B | Codeforces Round 694 (Div. 2) {1471} | PROGRAMMING | 750.0 | Codeforces Round #694 Editorial | |
| 40823 | Strange Partition | greedy math number theory | Statement | A | Codeforces Round 694 (Div. 2) {1471} | PROGRAMMING | 500.0 | Codeforces Round #694 Editorial | |
| 3330 | New Year's Puzzle | brute force dp graph matchings greedy sortings | Statement | F | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 31213 | Even-Odd Game | dp games greedy sortings | Statement | D | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 46145 | Cards for Friends | greedy math | Statement | A | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 37790 | Replacing Elements | greedy implementation sortings | Statement | A | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 42873 | 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 | |
| 14376 | Array Destruction | constructive algorithms data structures greedy implementation sortings | Statement | C | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 1500.0 | Codeforces Round #696 Editorial | |
| 4359 | Cleaning | data structures dp greedy implementation | Statement | D | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 2000.0 | Codeforces Round #696 Editorial | |
| 11354 | Cleaning the Phone | binary search dp greedy sortings two pointers | Statement | D | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 21831 | Inflation | binary search brute force greedy math | Statement | B | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 45823 | K-divisible Sum | binary search constructive algorithms greedy math | Statement | A | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 2652 | Nezzar and Nice Beatmap | constructive algorithms geometry greedy sortings | Statement | C | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 1500.0 | 87294 | 2200 |
| 7539 | 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 | |
| 4558 | 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 | |
| 27296 | Yet Another String Game | games greedy strings | Statement | A | Codeforces Round 700 (Div. 2) {1480} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #700 | |
| 18021 | The Great Hero | greedy implementation | Statement | B | Codeforces Round 700 (Div. 2) {1480} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #700 | |
| 12501 | Fence Painting | brute force constructive algorithms greedy implementation | Statement | C | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 1500.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 20014 | New Colony | brute force greedy implementation | Statement | B | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 750.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 4929 | 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 | |
| 902 | AB Tree | dp greedy trees | Statement | F | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 3000.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 25857 | Space Navigation | greedy implementation strings | Statement | A | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 500.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 3852 | Basic Diplomacy | constructive algorithms flows greedy implementation | Statement | A | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 35488 | 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 |
| 1590 | Move and Swap | dp greedy trees | Statement | E | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #701 (Div. 2) | 2500 |
| 27289 | Shifting Stacks | greedy implementation | Statement | A | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 500.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 15578 | 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 | ||
| 137 | Painting Numbers | *special data structures greedy number theory | Statement | G | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 18687 | 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 | ||
| 33268 | Dense Array | greedy math | Statement | A | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 8454 | Pekora and Trampoline | brute force data structures dp graphs greedy implementation | Statement | C | Codeforces Global Round 13 {1491} | PROGRAMMING | 1000.0 | Codeforces Global Round 13 Editorial | |
| 19121 | K-th Largest Value | brute force greedy implementation | Statement | A | Codeforces Global Round 13 {1491} | PROGRAMMING | 500.0 | Codeforces Global Round 13 Editorial | |
| 14314 | Minimal Cost | brute force greedy implementation math | Statement | B | Codeforces Global Round 13 {1491} | PROGRAMMING | 750.0 | Codeforces Global Round 13 Editorial | |
| 1328 | Almost Fault-Tolerant Database | brute force constructive algorithms dfs and similar greedy implementation | Statement | E | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 3000.0 | Codeforces Round #704 Editorial | |
| 17674 | Maximum width | data structures dp greedy two pointers | Statement | C | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1500.0 | Codeforces Round #704 Editorial | |
| 21071 | Card Deck | data structures greedy math | Statement | B | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1000.0 | Codeforces Round #704 Editorial | |
| 5006 | K-beautiful Strings | binary search brute force greedy implementation strings | Statement | C | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 1750.0 | Codeforces Round #705 (Div.2) Editorial | |
| 1121 | Enormous XOR | bitmasks greedy strings two pointers | Statement | E | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 2750.0 | Codeforces Round #705 (Div.2) Editorial | |
| 15465 | Berland Crossword | binary search bitmasks brute force greedy implementation | Statement | B | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 2867 | Dogeforces | brute force constructive algorithms divide and conquer dsu greedy implementation trees | Statement | D | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 548 | Qingshan and Daniel | brute force data structures greedy implementation | Statement | E | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2500.0 | Codeforces Round #706 Editorial | |
| 6380 | Let's Go Hiking | constructive algorithms games greedy implementation | Statement | B | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 1000.0 | Codeforces Round #706 Editorial | |
| 18031 | Diamond Miner | geometry greedy math sortings | Statement | A | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 500.0 | Codeforces Round #706 Editorial | |
| 22424 | Split it! | brute force constructive algorithms greedy strings | Statement | A | Codeforces Round 706 (Div. 2) {1496} | PROGRAMMING | 500.0 | Codeforces Round #706 Editorial | |
| 29074 | M-arrays | constructive algorithms greedy math | Statement | B | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 750.0 | Codeforces Round #708 Editorial | 1200 |
| 9194 | 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 |
| 1961 | 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 |
| 26429 | Meximization | brute force data structures greedy sortings | Statement | A | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 500.0 | Codeforces Round #708 Editorial | 800 |
| 2537 | Bananas in a Microwave | dfs and similar dp greedy shortest paths | Statement | D | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 2500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 22143 | Binary Removals | brute force dp greedy implementation | Statement | B | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 986 | Matrix Sorting | bitmasks constructive algorithms dfs and similar greedy hashing string suffix structures two pointers | Statement | C | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 1500.0 | Codeforces Round #707 Editorial | 2600 |
| 3921 | Travelling Salesman Problem | binary search data structures dp greedy shortest paths sortings | Statement | C | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1250.0 | T | 2200 |
| 1321 | Flip the Cards | 2-sat constructive algorithms data structures dsu greedy sortings | Statement | D | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1750.0 | T | 2600 |
| 27276 | Flip the Bits | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 712 (Div. 2) {1504} | PROGRAMMING | 1000.0 | Codeforces Round #712 Editorial | 1200 |
| 1931 | Cakewalk | constructive algorithms greedy implementation shortest paths | Statement | E | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 4922 | Maximize the Remaining String | brute force data structures dp greedy strings two pointers | Statement | G | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 3766 | Triangular Paths | constructive algorithms greedy math shortest paths sortings | Statement | F | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 21281 | Partial Replacement | greedy implementation | Statement | B | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 6732 | 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 | |
| 1811 | 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 | |
| 599 | 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 | ||
| 6891 | Education | binary search greedy implementation math | Statement | F | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 11488 | Permutation by Sum | greedy math | Statement | E | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 5088 | Cut and Stick | binary search data structures greedy probabilities sortings | Statement | D | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 2000.0 | Codeforces round #716 editorial | |
| 2214 | Phoenix and Earthquake | constructive algorithms dfs and similar dsu graphs greedy trees | Statement | F | Codeforces Global Round 14 {1515} | PROGRAMMING | 3250.0 | Editorial | |
| 12927 | Phoenix and Socks | greedy sortings two pointers | Statement | D | Codeforces Global Round 14 {1515} | PROGRAMMING | 2000.0 | Editorial | |
| 14267 | Fillomino 2 | constructive algorithms greedy implementation | Statement | C | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 1500.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 13909 | Morning Jogging | constructive algorithms greedy sortings | Statement | B | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 1250.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 27042 | 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 | |
| 23592 | Berland Regional | brute force greedy sortings two pointers | Statement | C | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 4385 | To Go Or Not To Go? | dfs and similar graphs greedy shortest paths | Statement | G | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 30108 | Arranging The Sheep | dp greedy math | Statement | E | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 768 | Nastia and a Beautiful Matrix | binary search constructive algorithms greedy math | Statement | E | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2750.0 | 90477 | |
| 2398 | Nastia Plays with a Tree | constructive algorithms data structures dfs and similar dp flows graphs greedy implementation trees | Statement | D | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2250.0 | 90477 | |
| 9219 | Compression and Expansion | brute force data structures greedy implementation trees | Statement | C | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 1500.0 | Deltix Round, Spring 2021. Editorial | 1600 |
| 5070 | Robot Collisions | data structures greedy implementation sortings | Statement | C | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 19939 | Parsa's Humongous Tree | brute force dfs and similar dp greedy trees | Statement | A | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 750.0 | Codeforces Round #722 Editorial | |
| 3041 | Trees of Tranquillity | data structures dfs and similar greedy trees | Statement | C | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 1750.0 | Codeforces Round #722 Editorial | |
| 21295 | Sifid and Strange Subsequences | greedy sortings | Statement | B | Codeforces Round 722 (Div. 2) {1529} | PROGRAMMING | 1250.0 | Codeforces Round #722 Editorial | |
| 15714 | Pursuit | binary search greedy sortings | Statement | C | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 1000.0 | Codeforces Round #733 Editorial (all problems) | |
| 3399 | Minimax | constructive algorithms greedy implementation strings | Statement | E | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 2000.0 | Codeforces Round #733 Editorial (all problems) | |
| 13024 | 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 | |
| 3151 | Gold Transfer | binary search data structures greedy interactive trees | Statement | E | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 34550 | Array Reodering | brute force greedy math number theory sortings | Statement | B | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 18002 | Unstable String | dp greedy implementation strings two pointers | Statement | C | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 5185 | Omkar and Medians | data structures greedy implementation | Statement | D | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 2000.0 | Codeforces Round #724 — Editorial | 2000 |
| 16985 | Erase and Extend (Easy Version) | binary search brute force dp greedy hashing string suffix structures strings | Statement | E1 | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1250.0 | Codeforces Round #726 (Div.2) Editorial | |
| 6379 | Erase and Extend (Hard Version) | binary search data structures greedy hashing string suffix structures strings | Statement | E2 | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1750.0 | Codeforces Round #726 (Div.2) Editorial | |
| 44977 | Bad Boy | constructive algorithms greedy math | Statement | B | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 750.0 | Codeforces Round #726 (Div.2) Editorial | |
| 30780 | Challenging Cliffs | greedy implementation math | Statement | C | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1000.0 | Codeforces Round #726 (Div.2) Editorial | |
| 41508 | Arithmetic Array | greedy math | Statement | A | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 500.0 | Codeforces Round #726 (Div.2) Editorial | |
| 5429 | Gift Set | binary search geometry greedy math ternary search | Statement | G | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 33362 | Stable Groups | greedy sortings | Statement | C | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 1250.0 | tutorial | 1200 |
| 12896 | PriceFixed | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 1500.0 | tutorial | 1600 |
| 1091 | Strange Array | data structures greedy sortings | Statement | F | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 2500.0 | tutorial | 2600 |
| 15118 | Great Graphs | constructive algorithms graphs greedy shortest paths sortings | Statement | A | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 500.0 | Tutorial | |
| 30871 | Pretty Permutations | constructive algorithms greedy implementation | Statement | A | Codeforces Round 728 (Div. 2) {1541} | PROGRAMMING | 500.0 | Tutorial | |
| 24693 | Customising the Track | combinatorics greedy math | Statement | B | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 750.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 43752 | Exciting Bets | greedy math number theory | Statement | A | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 500.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 24665 | Pair Programming | dp greedy two pointers | Statement | C | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 28101 | Alphabetical Strings | greedy implementation strings | Statement | B | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 27294 | Gregor and the Pawn Game | flows graphs greedy implementation | Statement | B | Codeforces Round 736 (Div. 2) {1549} | PROGRAMMING | 750.0 | Codeforces Round 736 Editorial | |
| 1956 | Stringforces | binary search bitmasks data structures dp greedy strings two pointers | Statement | E | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 10931 | Manhattan Subarrays | brute force geometry greedy implementation | Statement | C | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 29607 | Find The Array | greedy math | Statement | A | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 28793 | Maximum Cost Deletion | greedy math | Statement | B | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 14692 | Interesting Story | greedy sortings strings | Statement | C | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 17121 | Running for Gold | combinatorics graphs greedy probabilities sortings | Statement | B | Codeforces Global Round 15 {1552} | PROGRAMMING | 500.0 | Editorial of Global Round 15 | |
| 2147 | Colors and Intervals | constructive algorithms data structures greedy sortings | Statement | E | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 15285 | Backspace | greedy strings two pointers | Statement | D | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 1250.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 13960 | 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 |
| 9897 | Mikasa | binary search bitmasks greedy implementation | Statement | C | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #735 (Div. 2) | 1800 |
| 10697 | Diane | constructive algorithms greedy strings | Statement | D | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #735 (Div. 2) | 1800 |
| 626 | 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 |
| 24922 | Moamen and k-subarrays | greedy sortings | Statement | B | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 1000.0 | Codeforces Round #737 Editorial | |
| 16547 | Mocha and Diana (Easy Version) | brute force constructive algorithms dsu graphs greedy trees | Statement | D1 | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1500.0 | Tutorial (en) | 1400 |
| 3232 | Mocha and Diana (Hard Version) | brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers | Statement | D2 | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1500.0 | Tutorial (en) | 2500 |
| 19644 | Make a Power of Two | greedy math strings | Statement | D | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 1300 | |
| 22935 | Deep Down Below | binary search greedy sortings | Statement | C | Codeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine)) {1561} | PROGRAMMING | 1250.0 | Codeforces Round #740 Editorial | 1300 |
| 26449 | 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) | |
| 444 | Four Vertices | constructive algorithms data structures graphs greedy implementation shortest paths | Statement | G | Codeforces Global Round 16 {1566} | PROGRAMMING | 3000.0 | Codeforces Global Round 16 Editorial | |
| 8372 | Seating Arrangements (hard version) | data structures greedy implementation sortings two pointers | Statement | D2 | Codeforces Global Round 16 {1566} | PROGRAMMING | 1000.0 | Codeforces Global Round 16 Editorial | |
| 14781 | Seating Arrangements (easy version) | data structures greedy sortings | Statement | D1 | Codeforces Global Round 16 {1566} | PROGRAMMING | 750.0 | Codeforces Global Round 16 Editorial | |
| 4482 | Buds Re-hanging | dfs and similar graphs greedy trees | Statement | E | Codeforces Global Round 16 {1566} | PROGRAMMING | 2000.0 | Codeforces Global Round 16 Editorial | |
| 25611 | Median Maximization | greedy math | Statement | A | Codeforces Global Round 16 {1566} | PROGRAMMING | 500.0 | Codeforces Global Round 16 Editorial | |
| 4952 | Expression Evaluation Error | constructive algorithms greedy implementation math | Statement | D | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 1750.0 | Codeforces Round #742 Editorial | |
| 294 | Shooting | *special greedy implementation | Statement | C | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 15686 | Swaps | greedy math | Statement | B | Codeforces Round 743 (Div. 2) {1573} | PROGRAMMING | 1000.0 | Tutorial | 1400 |
| 18771 | Slay the Dragon | binary search greedy sortings | Statement | C | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 18315 | Combinatorics Homework | combinatorics greedy math | Statement | B | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 4909 | The Strongest Build | data structures dfs and similar graphs greedy hashing implementation shortest paths | Statement | D | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 5432 | 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 | ||
| 11764 | Ticks | brute force dp greedy implementation | Statement | C | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 25777 | Permutation Minimization by Deque | constructive algorithms greedy math | Statement | E1 | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 3945 | Portal | brute force dp greedy implementation | Statement | A | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 500.0 | Codeforces Round #745 Editorial | 1700 |
| 12654 | Diameter of Graph | constructive algorithms graphs greedy math | Statement | B | Codeforces Round 745 (Div. 2) {1581} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 1200 |
| 4306 | 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 | |
| 25430 | Grandma Capa Knits a Scarf | data structures greedy strings two pointers | Statement | C | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 1186 | Strange LCS | bitmasks dp graphs greedy strings | Statement | F | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 2500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2600 |
| 17909 | 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 | |
| 1981 | Bored Bakry | bitmasks greedy math two pointers | Statement | E | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 2500.0 | 95583 | |
| 23989 | Gamer Hemose | greedy math sortings | Statement | A | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 500.0 | 95583 | |
| 28329 | Save More Mice | binary search greedy greedy | Statement | C | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 15203 | Gardener and Tree | dfs and similar greedy implementation trees | Statement | E | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 43508 | 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) | ||
| 30374 | Make Them Equal | brute force greedy math strings | Statement | C | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1500.0 | 95525 | 1200 |
| 921 | Weights | constructive algorithms greedy two pointers | Statement | A | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | Tutorial | ||
| 2440 | Array Game | games greedy two pointers | Statement | E | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 2) {1600} | PROGRAMMING | BubbleCup2021.pdf | ||
| 2399 | Optimal Insertion | data structures divide and conquer greedy sortings | Statement | C | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2000.0 | 95865 | 2300 |
| 2060 | Difficult Mountain | data structures dp greedy sortings | Statement | D | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2700 |
| 651 | Phys Ed Online | data structures dp greedy trees | Statement | E | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2900 |
| 2346 | Extreme Extension | dp greedy math number theory | Statement | C | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #752 | 2300 |