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 ... 5 6 7 8 9 ... 12 13 14 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 18769 | Copy-paste | greedy math | Statement | A | Codeforces Round 673 (Div. 2) {1417} | PROGRAMMING | 500.0 | Codeforces Round #673 Editorial | 800 |
| 29506 | Mortal Kombat Tower | dp greedy | Statement | C | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 17708 | Negative Prefixes | greedy sortings | Statement | B | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 17585 | 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 | |
| 26602 | 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 | |
| 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 | |
| 19155 | Pokémon Army (easy version) | constructive algorithms dp greedy | Statement | C1 | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1000.0 | Editorial | |
| 5247 | Pokémon Army (hard version) | data structures divide and conquer dp greedy implementation | Statement | C2 | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1250.0 | ||
| 36418 | XORwice | bitmasks greedy math | Statement | A | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 500.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 897 | Minlexes | dp greedy implementation strings | Statement | E | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 2000.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 15127 | Nice Matrix | greedy implementation ternary search | Statement | B | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 750.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 7263 | Arena of Greed | games greedy | Statement | A | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 1400 | |
| 1026 | 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 | |
| 17751 | Non-zero Segments | constructive algorithms data structures greedy | Statement | D | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1500 | |
| 8191 | Rock, Paper, Scissors | brute force constructive algorithms flows greedy math | Statement | E | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1800 | |
| 11524 | Chess Cheater | greedy implementation sortings | Statement | B | Codeforces Global Round 11 {1427} | PROGRAMMING | 750.0 | Editorial of Global Round 11 | 1400 |
| 411 | Boring Card Game | data structures greedy trees | Statement | F | Codeforces Global Round 11 {1427} | PROGRAMMING | 2250.0 | Editorial of Global Round 11 | 3200 |
| 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 | |
| 4749 | Bouncing Boomerangs | constructive algorithms greedy | Statement | D | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1500.0 | Codeforces Raif Round 1 Editorial | |
| 685 | Lucky Numbers (Easy Version) | dp greedy | Statement | G1 | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 2250.0 | Codeforces Raif Round 1 Editorial | |
| 824 | Lucky Numbers (Hard Version) | dp greedy | Statement | G2 | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 750.0 | Codeforces Raif Round 1 Editorial | |
| 22858 | ABBB | greedy strings | Statement | C | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1000.0 | Codeforces Raif Round 1 Editorial | |
| 7403 | String Reversal | data structures greedy strings | Statement | E | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 1071 | Realistic Gameplay | dp greedy | Statement | F | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 20378 | Barrels | greedy implementation sortings | Statement | B | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 9414 | String Deletion | greedy two pointers | Statement | D | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 165 | Neural Network Problem | *special binary search greedy | Statement | F | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 82 | Rogue-like Game | *special brute force greedy | Statement | H | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 212 | Number Deletion Game | *special dp games greedy | Statement | G | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 489 | Used Markers | *special greedy | Statement | D | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 28802 | Dominant Piranha | constructive algorithms greedy | Statement | C | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 29980 | Yet Another Bookshelf | greedy implementation | Statement | B | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 6549 | 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 | |
| 18503 | Marketing Scheme | brute force constructive algorithms greedy math | Statement | A | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 21036 | Reverse Binary Strings | constructive algorithms greedy | Statement | B | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 12447 | Chef Monocarp | dp flows graph matchings greedy | Statement | C | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 14558 | Minimal Height Tree | graphs greedy shortest paths trees | Statement | D | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 1495 | 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 | |
| 30634 | Valerii Against Everyone | constructive algorithms greedy sortings | Statement | B | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 750.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 2272 | Greedy Shopping | binary search data structures greedy | Statement | C | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 1750.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 5412 | 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 | |
| 32134 | Sum of Medians | greedy math | Statement | B | Codeforces Round 684 (Div. 2) {1440} | PROGRAMMING | 1000.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 5409 | 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 | |
| 2962 | Sum | data structures divide and conquer dp greedy | Statement | D | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1750.0 | 84298 | |
| 9782 | Extreme Subtraction | dp greedy | Statement | A | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 500.0 | 84298 | |
| 2021 | 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 | |
| 16997 | 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 | |
| 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 | |
| 20412 | Array Rearrangment | greedy sortings | Statement | A | Codeforces Round 680 (Div. 2, based on Moscow Team Olympiad) {1445} | PROGRAMMING | 500.0 | Codeforces Round #680 Editorial | |
| 18026 | Knapsack | constructive algorithms greedy sortings | Statement | A | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 500.0 | E | |
| 2131 | Frequency Problem (Easy Version) | data structures greedy | Statement | D1 | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1750.0 | E | |
| 1858 | Frequency Problem (Hard Version) | data structures greedy | Statement | D2 | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 750.0 | E | |
| 28115 | Numbers Box | greedy math | Statement | B | Codeforces Round 683 (Div. 2, by Meet IT) {1447} | PROGRAMMING | 1000.0 | Meet IT Codeforces Round Editorial | |
| 16084 | Balls of Steel | brute force geometry greedy | Statement | B | Codeforces Global Round 12 {1450} | PROGRAMMING | 750.0 | Codeforces Global Round 12 Editorial | |
| 1488 | The Struggling Contestant | constructive algorithms greedy | Statement | F | Codeforces Global Round 12 {1450} | PROGRAMMING | 2750.0 | Codeforces Global Round 12 Editorial | |
| 17404 | String Equality | dp greedy hashing implementation strings | Statement | C | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #685 | |
| 20327 | Non-Substring Subsequence | greedy implementation strings | Statement | B | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 750.0 | Editorial — Codeforces Round #685 | |
| 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 | ||
| 1743 | Two Editorials | brute force data structures greedy implementation | Statement | E | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 381 | Divide Powers | constructive algorithms greedy | Statement | F | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 21241 | Two Brackets | data structures greedy | Statement | C | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 2246 | 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 | |
| 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 | |
| 6272 | Triangles | greedy implementation | Statement | C | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 1500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 4744 | 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 | ||
| 22597 | Sequence Transformation | greedy implementation | Statement | C | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) 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 | ||
| 525 | String and Operations | dp greedy | Statement | F | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 13277 | Sequence and Swaps | dp greedy sortings | Statement | D | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 1664 | Flip and Reverse | graphs greedy | Statement | D | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 2000.0 | Codeforces Round #691 Editorial (finished) | |
| 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 | |
| 663 | Mathematical Expression | constructive algorithms dp greedy | Statement | F | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 2750.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 19025 | String Generation | constructive algorithms greedy | Statement | A | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 500.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 8745 | 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 | ||
| 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 | ||
| 4899 | Pairs | binary search constructive algorithms greedy | Statement | D | Educational Codeforces Round 100 (Rated for Div. 2) {1463} | PROGRAMMING | Educational Codeforces Round 100 Editorial | ||
| 649 | Finding satisfactory solutions | dp graphs greedy math | Statement | H | Good Bye 2020 {1466} | PROGRAMMING | 3500.0 | Good Bye 2020 Editorial | |
| 18902 | Canine poetry | dp greedy strings | Statement | C | Good Bye 2020 {1466} | PROGRAMMING | 1000.0 | Good Bye 2020 Editorial | |
| 23657 | Last minute enhancements | greedy | Statement | B | Good Bye 2020 {1466} | PROGRAMMING | 750.0 | Good Bye 2020 Editorial | |
| 15163 | 13th Labour of Heracles | greedy trees | Statement | D | Good Bye 2020 {1466} | PROGRAMMING | 1000.0 | Good Bye 2020 Editorial | |
| 6836 | Three Bags | brute force constructive algorithms greedy | Statement | C | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 1500.0 | Codeforces Round #695 (Div. 2) Editorial | 1900 |
| 25394 | Wizard of Orz | greedy math | Statement | A | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 500.0 | Codeforces Round #695 (Div. 2) Editorial | 900 |
| 1978 | LaIS | data structures dp greedy | Statement | A | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 6165 | Road Reform | dsu graphs greedy | Statement | J | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) — Tutorials | ||
| 9227 | 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) | ||
| 9846 | Four Segments | greedy | Statement | E | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 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) | ||
| 1117 | Power Sockets | binary search data structures greedy | Statement | F | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 30211 | Regular Bracket Sequence | constructive algorithms greedy | Statement | A | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 11750 | 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 | ||
| 31383 | Red and Blue | greedy | Statement | B | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 30518 | Strange Birthday Party | dp greedy sortings two pointers | Statement | A | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 500.0 | 86464 | |
| 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 | |
| 3320 | 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 | ||
| 30993 | Even-Odd Game | dp games greedy sortings | Statement | D | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 60752 | Fair Division | dp greedy | Statement | B | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 45936 | Cards for Friends | greedy math | Statement | A | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 37711 | Replacing Elements | greedy implementation sortings | Statement | A | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 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 | |
| 14308 | Array Destruction | constructive algorithms data structures greedy implementation sortings | Statement | C | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 1500.0 | Codeforces Round #696 Editorial | |
| 1513 | What Is It? | constructive algorithms greedy | Statement | E | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 2250.0 | Codeforces Round #696 Editorial | |
| 4351 | Cleaning | data structures dp greedy implementation | Statement | D | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 2000.0 | Codeforces Round #696 Editorial | |
| 23455 | Puzzle From the Future | greedy | Statement | A | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 500.0 | Codeforces Round #696 Editorial | |
| 5972 | Unusual Matrix | 2-sat constructive algorithms greedy | Statement | F | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 11296 | 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 | ||
| 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 | ||
| 12384 | Longest Simple Cycle | constructive algorithms dp graphs greedy | Statement | C | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 2622 | Nezzar and Nice Beatmap | constructive algorithms geometry greedy sortings | Statement | C | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 1500.0 | 87294 | 2200 |
| 244 | Nezzar and Tournaments | data structures greedy | Statement | E | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 2750.0 | 87294 | 3300 |
| 28138 | Nezzar and Colorful Balls | brute force greedy | Statement | A | Codeforces Round 698 (Div. 2) {1478} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 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 | |
| 27254 | Yet Another String Game | games greedy strings | Statement | A | Codeforces Round 700 (Div. 2) {1480} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #700 | |
| 17993 | The Great Hero | greedy implementation | Statement | B | Codeforces Round 700 (Div. 2) {1480} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #700 | |
| 12492 | 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 | |
| 19965 | New Colony | brute force greedy implementation | Statement | B | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 750.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 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 | |
| 2466 | Sorting Books | data structures dp greedy | Statement | E | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 2500.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 789 | AB Tree | dp greedy trees | Statement | F | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 3000.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 25817 | Space Navigation | greedy implementation strings | Statement | A | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 500.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 10064 | Basic Diplomacy | greedy | Statement | C | Технокубок 2021 - Финал {1482} | PROGRAMMING | 1500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 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 | |
| 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 |
| 1565 | 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 |
| 27194 | Shifting Stacks | greedy implementation | Statement | A | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 500.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 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 | ||
| 517 | Ones | dp greedy | Statement | F | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 360 | Problemsolving Marathon | *special binary search greedy | Statement | D | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 137 | Painting Numbers | *special data structures greedy number theory | Statement | G | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 603 | RBS Deletion | *special greedy | Statement | B | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 21180 | Accidental Victory | binary search data structures greedy | Statement | E | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 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 | ||
| 8444 | 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 | |
| 19105 | K-th Largest Value | brute force greedy implementation | Statement | A | Codeforces Global Round 13 {1491} | PROGRAMMING | 500.0 | Codeforces Global Round 13 Editorial | |
| 14288 | Minimal Cost | brute force greedy implementation math | Statement | B | Codeforces Global Round 13 {1491} | PROGRAMMING | 750.0 | Codeforces Global Round 13 Editorial | |
| 1316 | 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 | |
| 17633 | Maximum width | data structures dp greedy two pointers | Statement | C | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1500.0 | Codeforces Round #704 Editorial | |
| 21020 | Card Deck | data structures greedy math | Statement | B | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1000.0 | Codeforces Round #704 Editorial | |
| 4989 | 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 | |
| 1115 | Enormous XOR | bitmasks greedy strings two pointers | Statement | E | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 2750.0 | Codeforces Round #705 (Div.2) Editorial | |
| 19833 | Anti-knapsack | constructive algorithms greedy | Statement | A | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 750.0 | Codeforces Round #705 (Div.2) Editorial | |
| 15407 | 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 | ||
| 2847 | 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 | ||
| 547 | Qingshan and Daniel | brute force data structures greedy implementation | Statement | E | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2500.0 | Codeforces Round #706 Editorial | |
| 6361 | Let's Go Hiking | constructive algorithms games greedy implementation | Statement | B | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 1000.0 | Codeforces Round #706 Editorial | |
| 17985 | Diamond Miner | geometry greedy math sortings | Statement | A | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 500.0 | Codeforces Round #706 Editorial | |
| 22382 | Split it! | brute force constructive algorithms greedy strings | Statement | A | Codeforces Round 706 (Div. 2) {1496} | 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 |
| 26331 | Meximization | brute force data structures greedy sortings | Statement | A | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 500.0 | Codeforces Round #708 Editorial | 800 |
| 24442 | Box Fitting | binary search bitmasks data structures greedy | Statement | B | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 1000.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 2525 | 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 | |
| 13497 | Minimum Grid Path | brute force data structures dp greedy | Statement | C | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 22096 | Binary Removals | brute force dp greedy implementation | Statement | B | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 979 | 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 |
| 14845 | Balance the Bits | constructive algorithms greedy | Statement | A | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 750.0 | T | 1600 |
| 3896 | 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 |
| 1297 | 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 |
| 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 |
| 1928 | Cakewalk | constructive algorithms greedy implementation shortest paths | Statement | E | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 4889 | Maximize the Remaining String | brute force data structures dp greedy strings two pointers | Statement | G | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 14327 | Restoring the Permutation | constructive algorithms data structures dsu greedy | Statement | E | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 25894 | Epic Transformation | constructive algorithms greedy | Statement | D | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 3744 | Triangular Paths | constructive algorithms greedy math shortest paths sortings | Statement | F | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 21254 | Partial Replacement | greedy implementation | Statement | B | 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 | |
| 15773 | The Sports Festival | dp greedy | Statement | C | Codeforces Round 715 (Div. 2) {1509} | PROGRAMMING | 1500.0 | Codeforces Round #715 Editorial | |
| 23253 | TMT Document | greedy | Statement | B | Codeforces Round 715 (Div. 2) {1509} | PROGRAMMING | 1000.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 | ||
| 12544 | Min Cost String | brute force constructive algorithms dfs and similar graphs greedy | Statement | D | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 28957 | Review Site | greedy | Statement | A | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 6871 | Education | binary search greedy implementation math | Statement | F | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 24815 | Corrupted Array | constructive algorithms data structures greedy | Statement | D | 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 | ||
| 5044 | 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 | |
| 18933 | Phoenix and Towers | constructive algorithms data structures greedy | Statement | C | Codeforces Global Round 14 {1515} | PROGRAMMING | 1500.0 | Editorial | |
| 2137 | Phoenix and Earthquake | constructive algorithms dfs and similar dsu graphs greedy trees | Statement | F | Codeforces Global Round 14 {1515} | PROGRAMMING | 3250.0 | Editorial | |
| 12892 | Phoenix and Socks | greedy sortings two pointers | Statement | D | Codeforces Global Round 14 {1515} | PROGRAMMING | 2000.0 | Editorial | |
| 26455 | AGAGA XOOORRR | bitmasks brute force dp greedy | Statement | B | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 1000.0 | Codeforces round #717 editorial | |
| 24814 | Tit for Tat | greedy | Statement | A | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 500.0 | Codeforces round #717 editorial | |
| 14248 | 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 | |
| 13878 | 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 | |
| 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 | |
| 23302 | 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 | ||
| 4329 | To Go Or Not To Go? | dfs and similar graphs greedy shortest paths | Statement | G | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | 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 | |
| 2371 | 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 | |
| 9213 | 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 |
| 448 | Goblins And Gnomes | brute force dp graph matchings | Statement | F | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 10971 | Armchairs | brute force dp greedy | Statement | D | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 26768 | Permutation Sort | constructive algorithms greedy | Statement | B | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 4862 | Robot Collisions | data structures greedy implementation sortings | Statement | C | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 27751 | Potions (Easy Version) | brute force data structures dp greedy | Statement | C1 | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 750.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 31405 | Potions (Hard Version) | data structures greedy | Statement | C2 | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 1000.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 19724 | 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 | |
| 3018 | 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 | |
| 31112 | Eshag Loves Big Arrays | constructive algorithms greedy | Statement | A | Codeforces Round 722 (Div. 2) {1529} | PROGRAMMING | 500.0 | Codeforces Round #722 Editorial | |
| 21270 | Sifid and Strange Subsequences | greedy sortings | Statement | B | Codeforces Round 722 (Div. 2) {1529} | PROGRAMMING | 1250.0 | Codeforces Round #722 Editorial | |
| 15665 | 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) | |
| 3363 | 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) | |
| 285 | Chess Team Forming | *special binary search data structures greedy | Statement | E | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 224 | Binary String Partition | *special binary search greedy | Statement | F | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 777 | Falling Sand (Hard Version) | dfs and similar dp graphs greedy | Statement | F2 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 1465 | Falling Sand (Easy Version) | dfs and similar graphs greedy | Statement | F1 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1750.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 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 | |
| 3129 | Gold Transfer | binary search data structures greedy interactive trees | Statement | E | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 34457 | Array Reodering | brute force greedy math number theory sortings | Statement | B | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 17897 | Unstable String | dp greedy implementation strings two pointers | Statement | C | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 5131 | Omkar and Medians | data structures greedy implementation | Statement | D | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 2000.0 | Codeforces Round #724 — Editorial | 2000 |
| 16843 | 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 | |
| 6330 | 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 | |
| 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 | ||
| 40792 | Stone Game | greedy | Statement | A | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 32884 | Stable Groups | greedy sortings | Statement | C | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 1250.0 | tutorial | 1200 |
| 12854 | PriceFixed | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 1500.0 | tutorial | 1600 |
| 1058 | Strange Array | data structures greedy sortings | Statement | F | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 2500.0 | tutorial | 2600 |
| 15074 | Great Graphs | constructive algorithms graphs greedy shortest paths sortings | Statement | A | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 500.0 | Tutorial | |
| 30839 | Pretty Permutations | constructive algorithms greedy implementation | Statement | A | Codeforces Round 728 (Div. 2) {1541} | PROGRAMMING | 500.0 | Tutorial | |
| 24627 | Customising the Track | combinatorics greedy math | Statement | B | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 750.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 487 | The Final Pursuit | constructive algorithms graphs greedy | Statement | E | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 3000.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 | |
| 18618 | AquaMoon and Two Arrays | brute force greedy | Statement | A | Codeforces Round 732 (Div. 2) {1546} | PROGRAMMING | 500.0 | Codeforces Round #732 Editorial | 800 |
| 24582 | Pair Programming | dp greedy two pointers | Statement | C | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 28038 | Alphabetical Strings | greedy implementation strings | Statement | B | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 17855 | Web of Lies | brute force graphs greedy | Statement | A | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 500.0 | Codeforces Round 736 Editorial | |
| 27188 | Gregor and the Pawn Game | flows graphs greedy implementation | Statement | B | Codeforces Round 736 (Div. 2) {1549} | PROGRAMMING | 750.0 | Codeforces Round 736 Editorial | |
| 1920 | 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 | ||
| 10919 | Manhattan Subarrays | brute force geometry greedy implementation | Statement | C | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 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 | ||
| 16778 | Wonderful Coloring - 2 | binary search constructive algorithms data structures greedy | Statement | B2 | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 14646 | Interesting Story | greedy sortings strings | Statement | C | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 6325 | Maximize the Intersections | combinatorics constructive algorithms geometry greedy | Statement | C | Codeforces Global Round 15 {1552} | PROGRAMMING | 1000.0 | Editorial of Global Round 15 | |
| 17071 | Running for Gold | combinatorics graphs greedy probabilities sortings | Statement | B | Codeforces Global Round 15 {1552} | PROGRAMMING | 500.0 | Editorial of Global Round 15 | |
| 2146 | Colors and Intervals | constructive algorithms data structures greedy sortings | Statement | E | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 20007 | Penalty | brute force dp greedy | Statement | C | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 750.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 15225 | 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 | |
| 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 |