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 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 44942 | Most Unstable Array | constructive algorithms greedy math | Statement | A | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 800 | |
| 1516 | Summoning Minions | constructive algorithms dp flows graph matchings greedy sortings | Statement | F | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2500 | |
| 2472 | Are You Fired? | constructive algorithms data structures dp greedy implementation | Statement | E | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 2000.0 | Codeforces Round #645 (Div. 2) Editorial | 2400 |
| 527 | Tasty Cookie | binary search constructive algorithms greedy implementation | Statement | F | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 2500.0 | Codeforces Round #645 (Div. 2) Editorial | 2700 |
| 37163 | Similar Pairs | constructive algorithms graph matchings greedy sortings | Statement | C | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1100 | |
| 8392 | A/B Matrix | constructive algorithms flows greedy math number theory | Statement | G | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1900 | |
| 8875 | Johnny and Contribution | constructive algorithms graphs greedy sortings | Statement | A | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 500.0 | Codeforces Round #647 Editorial | 1700 |
| 14496 | Ehab and Prefix MEXs | brute force constructive algorithms greedy | Statement | C | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 1500.0 | Codeforces round #649 editorial | 1600 |
| 25161 | Rotation Matching | constructive algorithms data structures greedy implementation | Statement | C | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #648 | 1400 |
| 21251 | Solve The Maze | constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths | Statement | D | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 1500.0 | Editorial — Codeforces Round #648 | 1700 |
| 8903 | Task On The Board | constructive algorithms greedy implementation sortings | Statement | D | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 25490 | Social Distance | constructive algorithms greedy math | Statement | C | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 21687 | Codeforces Subsequences | brute force constructive algorithms greedy math strings | Statement | B | Codeforces Global Round 8 {1368} | PROGRAMMING | 1000.0 | Codeforces Global Round 8: editorial | |
| 2401 | Ski Accidents | constructive algorithms dfs and similar greedy | Statement | E | Codeforces Global Round 8 {1368} | PROGRAMMING | 2500.0 | Codeforces Global Round 8: editorial | |
| 2482 | DeadLee | constructive algorithms data structures graphs greedy implementation sortings | Statement | E | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2500.0 | Codeforces Round #652 (Div. 2) Editorial | 2400 |
| 21476 | A Cookie for You | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1250.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 13759 | Grid-00100 | constructive algorithms greedy math | Statement | D | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1500.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 37690 | Omkar and Last Class of Math | constructive algorithms greedy math number theory | Statement | B | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 1000.0 | Codeforces Round #655 Editorial | 1300 |
| 5902 | Omkar and Circle | brute force constructive algorithms dp games greedy | Statement | D | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 2000.0 | Codeforces Round #655 Editorial | 2100 |
| 2985 | Sum of Digits | brute force constructive algorithms dp greedy math number theory | Statement | E | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 17893 | Neighbor Grid | constructive algorithms greedy | Statement | B | Codeforces Global Round 9 {1375} | PROGRAMMING | 750.0 | 79731 | |
| 23125 | Element Extermination | constructive algorithms greedy | Statement | C | Codeforces Global Round 9 {1375} | PROGRAMMING | 1500.0 | 79731 | |
| 3433 | Inversion SwapSort | constructive algorithms greedy sortings | Statement | E | Codeforces Global Round 9 {1375} | PROGRAMMING | 2000.0 | 79731 | |
| 1734 | Mastermind | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 2000.0 | Codeforces Round #658 Editorial | 2500 |
| 5553 | GameGame | bitmasks constructive algorithms dp games greedy math | Statement | B | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 823 | Rearrange | brute force constructive algorithms graphs greedy sortings | Statement | D | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1750.0 | Codeforces Round #659 Editorial | |
| 2638 | Koa and the Beach (Hard Version) | constructive algorithms greedy | Statement | B2 | Codeforces Round 659 (Div. 2) {1384} | PROGRAMMING | 750.0 | Codeforces Round #659 Editorial | |
| 19823 | Common Prefixes | constructive algorithms greedy strings | Statement | A | Codeforces Round 659 (Div. 2) {1384} | PROGRAMMING | 500.0 | Codeforces Round #659 Editorial | |
| 51080 | LCM Problem | constructive algorithms greedy math number theory | Statement | A | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 2428 | Omkar and Landslide | binary search constructive algorithms greedy math | Statement | F | Codeforces Global Round 10 {1392} | PROGRAMMING | 2500.0 | Codeforces Global Round 10 — Editorial | |
| 9981 | Omkar and Bed Wars | constructive algorithms dp greedy math strings | Statement | D | Codeforces Global Round 10 {1392} | PROGRAMMING | 1500.0 | Codeforces Global Round 10 — Editorial | |
| 11089 | Pinkie Pie Eats Patty-cakes | binary search constructive algorithms data structures greedy math sortings | Statement | C | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 13196 | Stoned Game | brute force constructive algorithms games greedy | Statement | B | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 1000.0 | Codeforces Round #666 — Editorial | |
| 16803 | Multiples of Length | constructive algorithms greedy number theory | Statement | A | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 500.0 | Codeforces Round #666 — Editorial | |
| 20038 | Binary String To Subsequences | constructive algorithms data structures greedy | Statement | D | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 18616 | Binary String Reconstruction | 2-sat constructive algorithms greedy strings | Statement | C | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 10716 | Maximum Distributed Tree | constructive algorithms dfs and similar greedy math number theory sortings trees | Statement | D | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1750.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 21841 | Ternary Sequence | constructive algorithms greedy math | Statement | B | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1000.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 1948 | 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 | |
| 2718 | Two Different | bitmasks constructive algorithms divide and conquer greedy | Statement | F | Grakn Forces 2020 {1408} | PROGRAMMING | 2500.0 | Grakn Forces -- Editorial | |
| 10492 | Arrays Sum | constructive algorithms greedy math | Statement | B | Grakn Forces 2020 {1408} | PROGRAMMING | 1000.0 | Grakn Forces -- Editorial | |
| 2745 | 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 | |
| 3039 | New Game Plus! | constructive algorithms greedy math | Statement | E | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 6755 | Make Them Equal | constructive algorithms greedy math | Statement | B | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 1000.0 | Codeforces Round #673 Editorial | 2000 |
| 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 | |
| 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 | |
| 19155 | Pokémon Army (easy version) | constructive algorithms dp greedy | Statement | C1 | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1000.0 | Editorial | |
| 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 | |
| 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 | |
| 28802 | Dominant Piranha | constructive algorithms greedy | Statement | C | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) 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 | ||
| 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 | |
| 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 | |
| 18026 | Knapsack | constructive algorithms greedy sortings | Statement | A | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 500.0 | E | |
| 1488 | The Struggling Contestant | constructive algorithms greedy | Statement | F | Codeforces Global Round 12 {1450} | PROGRAMMING | 2750.0 | Codeforces Global Round 12 Editorial | |
| 381 | Divide Powers | constructive algorithms greedy | Statement | F | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 4468 | Checkpoints | brute force constructive algorithms greedy math probabilities | Statement | D | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 2000.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 1679 | Four Points | brute force constructive algorithms flows geometry greedy math ternary search | Statement | E | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 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 | |
| 4899 | Pairs | binary search constructive algorithms greedy | Statement | D | Educational Codeforces Round 100 (Rated for Div. 2) {1463} | PROGRAMMING | Educational Codeforces Round 100 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 |
| 30211 | Regular Bracket Sequence | constructive algorithms greedy | Statement | A | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 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 | |
| 5972 | Unusual Matrix | 2-sat constructive algorithms greedy | Statement | F | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 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 |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | ||
| 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 | |
| 19833 | Anti-knapsack | constructive algorithms greedy | Statement | A | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 750.0 | Codeforces Round #705 (Div.2) 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 | ||
| 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 | |
| 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 |
| 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 |
| 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 | ||
| 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 | ||
| 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 | |
| 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 | ||
| 24815 | Corrupted Array | constructive algorithms data structures greedy | Statement | D | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) 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 | |
| 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 | |
| 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 | |
| 26768 | Permutation Sort | constructive algorithms greedy | Statement | B | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 31112 | Eshag Loves Big Arrays | constructive algorithms greedy | Statement | A | Codeforces Round 722 (Div. 2) {1529} | PROGRAMMING | 500.0 | Codeforces Round #722 Editorial | |
| 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) | |
| 44314 | Bad Boy | constructive algorithms greedy math | Statement | B | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 750.0 | Codeforces Round #726 (Div.2) Editorial | |
| 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 | |
| 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 | |
| 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) | ||
| 6325 | Maximize the Intersections | combinatorics constructive algorithms geometry greedy | Statement | C | Codeforces Global Round 15 {1552} | PROGRAMMING | 1000.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 | |
| 10660 | Diane | constructive algorithms greedy strings | Statement | D | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #735 (Div. 2) | 1800 |
| 3776 | Bottom-Tier Reversals | constructive algorithms greedy | Statement | C | Codeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine)) {1558} | PROGRAMMING | 1500.0 | Codeforces Round #740 Editorial | 2000 |
| 16387 | 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 |
| 3182 | 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 |
| 6818 | Nearest Beautiful Number (easy version) | binary search bitmasks brute force constructive algorithms dfs and similar greedy | Statement | F1 | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 1900 | |
| 5063 | Nearest Beautiful Number (hard version) | bitmasks brute force constructive algorithms dfs and similar dp greedy | Statement | F2 | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 2100 | |
| 19182 | MAX-MEX Cut | bitmasks constructive algorithms dp greedy | Statement | C | Codeforces Global Round 16 {1566} | PROGRAMMING | 1000.0 | Codeforces Global Round 16 Editorial | |
| 422 | 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 | |
| 4921 | Expression Evaluation Error | constructive algorithms greedy implementation math | Statement | D | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 1750.0 | Codeforces Round #742 Editorial | |
| 2049 | Xor of 3 | brute force constructive algorithms greedy | Statement | B | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 1250.0 | Tutorial | 2500 |
| 25580 | Permutation Minimization by Deque | constructive algorithms greedy math | Statement | E1 | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 12619 | Diameter of Graph | constructive algorithms graphs greedy math | Statement | B | Codeforces Round 745 (Div. 2) {1581} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 1200 |
| 2520 | Moment of Bloom | constructive algorithms dfs and similar graph matchings graphs greedy | Statement | E | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 2250.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 895 | Weights | constructive algorithms greedy two pointers | Statement | A | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | Tutorial | ||
| 3297 | Treelabeling | bitmasks constructive algorithms dfs and similar games graphs greedy trees | Statement | D | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2000.0 | tutorial | 2100 |
| 15287 | Banknotes | constructive algorithms greedy | Statement | C | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 12569 | Build the Permutation | constructive algorithms greedy | Statement | B | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 1030 | Max Sum Array | combinatorics constructive algorithms greedy sortings | Statement | G | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 24682 | Divan and a Store | brute force constructive algorithms greedy | Statement | A | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 10328 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 4872 | Exact Change | binary search brute force constructive algorithms greedy | Statement | D | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 4431 | The Winter Hike | constructive algorithms greedy math | Statement | D | Hello 2022 {1621} | PROGRAMMING | 1750.0 | ||
| 27054 | Division by Two and Permutation | constructive algorithms flows graph matchings greedy math | Statement | C | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 17172 | Meximum Array | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 500.0 | 99276 | |
| 3632 | Grid Xor | constructive algorithms greedy implementation interactive math | Statement | C | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 1250.0 | 99276 | |
| 4817 | Finding Zero | constructive algorithms greedy interactive | Statement | D | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2000.0 | Codeforces Round #770 (Div. 2) editorial | |
| 2814 | Cars | constructive algorithms dfs and similar dsu graphs greedy sortings | Statement | E | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 26433 | Differential Sorting | constructive algorithms greedy | Statement | C | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 1500.0 | Codeforces Round #772 Editorial | |
| 2191 | Towers | constructive algorithms dfs and similar dp greedy trees | Statement | F | Codeforces Global Round 19 {1637} | PROGRAMMING | 3250.0 | Tutorial | |
| 18799 | Andrew and Stones | constructive algorithms greedy | Statement | C | Codeforces Global Round 19 {1637} | PROGRAMMING | 1500.0 | Tutorial | |
| 701 | Playing Around the Table | constructive algorithms greedy implementation | Statement | F | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 3000.0 | Codeforces Round #774 (Div. 2) Editorial | 2900 |
| 22848 | Quality vs Quantity | brute force constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 1000.0 | Codeforces Round #774 (Div. 2) Editorial | 800 |
| 13374 | Madoka and Childish Pranks | constructive algorithms greedy | Statement | C | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 1500.0 | Codeforces Round #777 Editorial | |
| 20516 | Prove Him Wrong | constructive algorithms greedy | Statement | B | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 14635 | Alice and the Cake | constructive algorithms data structures greedy sortings | Statement | C | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 1400 |
| 12084 | Bit Flipping | bitmasks constructive algorithms greedy strings | Statement | B | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 750.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 4479 | Reverse Sort Sum | constructive algorithms data structures greedy implementation math two pointers | Statement | D | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2000.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 32913 | Red Versus Blue | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 8154 | Matrix and Shifts | constructive algorithms greedy implementation | Statement | E | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 34940 | Array Cloning Technique | constructive algorithms greedy sortings | Statement | B | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 750.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 890 | Even Split | binary search constructive algorithms greedy | Statement | E | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 8521 | Insert a Progression | brute force constructive algorithms greedy | Statement | D | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 14080 | Unequal Array | constructive algorithms greedy implementation | Statement | C | Codeforces Global Round 20 {1672} | PROGRAMMING | 750.0 | Global Round 20 Editorial | 1100 |
| 6983 | Cyclic Rotation | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Global Round 20 {1672} | PROGRAMMING | 1000.0 | Global Round 20 Editorial | 1700 |
| 3595 | Array Shuffling | constructive algorithms graphs greedy | Statement | F1 | Codeforces Global Round 20 {1672} | PROGRAMMING | 1250.0 | Global Round 20 Editorial | 2000 |
| 2535 | notepad.exe | binary search constructive algorithms greedy interactive | Statement | E | Codeforces Global Round 20 {1672} | PROGRAMMING | 1500.0 | Global Round 20 Editorial | 2200 |
| 1154 | Zigu Zagu | constructive algorithms greedy | Statement | H | Codeforces Global Round 20 {1672} | PROGRAMMING | 3000.0 | Global Round 20 Editorial | 2700 |
| 977 | Anti-Theft Road Planning | bitmasks constructive algorithms divide and conquer greedy interactive math | Statement | F | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 3250.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 7794 | Breaking the Wall | binary search brute force constructive algorithms greedy math | Statement | E | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 4133 | Tokitsukaze and Two Colorful Tapes | constructive algorithms dfs and similar dsu graphs greedy | Statement | C | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 1250.0 | Tutorial | |
| 777 | Unordered Swaps | constructive algorithms dfs and similar graphs greedy math sortings | Statement | E | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2500.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 16587 | LIS or Reverse LIS? | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 1500.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 10838 | Traps | constructive algorithms greedy sortings | Statement | D | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 1500.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 1700 |
| 3683 | MEX vs DIFF | brute force constructive algorithms data structures greedy two pointers | Statement | E | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 1750.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 2100 |
| 18692 | Circular Local MiniMax | constructive algorithms greedy sortings | Statement | A | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 500.0 | 103198 | 1100 |
| 1414 | Bring Balance | constructive algorithms greedy | Statement | C | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 1500.0 | 103198 | 2600 |
| 144 | Permutation Weight (Hard Version) | constructive algorithms greedy | Statement | D2 | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 1500.0 | 103198 | 3500 |
| 4185 | Railway System | constructive algorithms dsu graphs greedy interactive sortings | Statement | B | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 796 | |
| 11505 | The Enchanted Forest | constructive algorithms greedy math | Statement | A | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 796 | |
| 19101 | Patchouli's Magical Talisman | bitmasks constructive algorithms greedy sortings | Statement | B | Codeforces Round 796 (Div. 2) {1688} | PROGRAMMING | 750.0 | Tutorial | |
| 13826 | Infected Tree | constructive algorithms dfs and similar dp greedy trees | Statement | C | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 35808 | Print a Pedestal (Codeforces logo?) | constructive algorithms greedy | Statement | A | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 800 | |
| 17361 | Sum of Substrings | brute force constructive algorithms greedy math strings | Statement | C | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 1250.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 37278 | Shoe Shuffling | constructive algorithms greedy implementation two pointers | Statement | B | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 32327 | Beat The Odds | constructive algorithms greedy math | Statement | A | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 500.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 20775 | Paranoid String | constructive algorithms greedy | Statement | B | Codeforces Round 800 (Div. 2) {1694} | PROGRAMMING | 1000.0 | Codeforces Round #800 Editorial | 1200 |
| 2499 | Tree Queries (Easy Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D1 | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 2329 | Tree Queries (Hard Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D2 | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 6059 | Permutation Graph | binary search constructive algorithms data structures greedy shortest paths trees | Statement | D | Codeforces Global Round 21 {1696} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round 21 | |
| 12644 | Fishingprince Plays With Array | constructive algorithms greedy implementation | Statement | C | Codeforces Global Round 21 {1696} | PROGRAMMING | 1500.0 | Editorial of Codeforces Global Round 21 | |
| 15905 | awoo's Favorite Problem | constructive algorithms data structures dp greedy implementation strings two pointers | Statement | C | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 1860 | PermutationForces II | binary search brute force combinatorics constructive algorithms greedy sortings | Statement | E | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 2000.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 21516 | Rising Sand | constructive algorithms greedy implementation | Statement | B | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 12281 | Helping the Nature | constructive algorithms greedy | Statement | C | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1500.0 | 103978 | 1700 |
| 9575 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 16697 | Two 0-1 Sequences | constructive algorithms greedy | Statement | A | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 500.0 | CodeTON Round 2 Editorial | |
| 7789 | Chopping Carrots (Easy Version) | binary search brute force constructive algorithms dp greedy number theory | Statement | D1 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 11974 | Color the Picture | constructive algorithms greedy | Statement | A | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 500.0 | Codeforces Round #810 Editorial | |
| 22455 | Woeful Permutation | constructive algorithms greedy number theory | Statement | B | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 1000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 6295 | Tournament Countdown | constructive algorithms fft greedy greedy interactive number theory probabilities | Statement | D | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 2000.0 | Codeforces Round #812 (Div. 2) Editorial | 1800 |
| 3735 | Build a Tree and That Is It | brute force constructive algorithms greedy implementation trees | Statement | F | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 24438 | Crossmarket | constructive algorithms greedy math | Statement | A | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 500.0 | Codeforces Round #816 (Div. 2) editorial | |
| 35500 | Beautiful Array | constructive algorithms greedy math | Statement | B | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 1000.0 | Codeforces Round #816 (Div. 2) editorial | |
| 15691 | Madoka and Underground Competitions | constructive algorithms greedy | Statement | B | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 1000.0 | Codeforces Round #818 (Div. 2) Editorial. | 1100 |
| 14454 | Even-Odd XOR | bitmasks constructive algorithms greedy | Statement | G | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1500 | |
| 20709 | Best Permutation | constructive algorithms greedy | Statement | B | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 1266 | House Planning | constructive algorithms data structures flows graph matchings greedy | Statement | E | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 2250.0 | Codeforces Round #824 — editorial | |
| 21124 | Working Week | constructive algorithms greedy math | Statement | A | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 500.0 | Codeforces Round #824 — editorial | |
| 2805 | Equal Binary Subsequences | constructive algorithms greedy strings | Statement | D | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 577 | Anti-Increasing Addicts | constructive algorithms dfs and similar dp greedy | Statement | G | Codeforces Global Round 22 {1738} | PROGRAMMING | 3000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 1408 | Connectivity Addicts | constructive algorithms dsu graphs greedy interactive shortest paths sortings trees | Statement | F | Codeforces Global Round 22 {1738} | PROGRAMMING | 2750.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 24617 | Array Recovery | constructive algorithms greedy math | Statement | B | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 12427 | Bricks and Bags | constructive algorithms games greedy sortings | Statement | C | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1500.0 | Tutorial | 1400 |
| 9142 | Knowledge Cards | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1750.0 | Tutorial | 1500 |
| 5130 | Hanging Hearts | constructive algorithms data structures dfs and similar dp greedy trees | Statement | E | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2000.0 | Tutorial | 1800 |
| 14247 | Smaller | constructive algorithms greedy strings | Statement | F | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 20803 | Save the Magazines | constructive algorithms greedy sortings string suffix structures | Statement | C | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 1100 | |
| 21192 | Maxmina | constructive algorithms greedy | Statement | A | Codeforces Global Round 23 {1746} | PROGRAMMING | 500.0 | Codeforces Global Round 23 Editorial | |
| 18740 | Rebellion | constructive algorithms greedy | Statement | B | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial | |
| 14169 | Permutation Operations | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial | |
| 26558 | Two Groups | constructive algorithms greedy | Statement | A | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 500.0 | Codeforces Round #832 (Div. 2) Editorial | |
| 16567 | Make Nonzero Sum (easy version) | constructive algorithms dp greedy | Statement | A1 | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 500.0 | Tutorial | 1300 |
| 11711 | Make Nonzero Sum (hard version) | constructive algorithms dp greedy | Statement | A2 | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 500.0 | Tutorial | 1500 |
| 10638 | SlavicG's Favorite Problem | bitmasks brute force constructive algorithms data structures dfs and similar graphs greedy | Statement | G | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 10808 | Set Construction | constructive algorithms dfs and similar graphs greedy | Statement | C | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1250.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 2197 | Make It Connected | constructive algorithms graphs greedy | Statement | E | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1750.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 14836 | Elimination of a Ring | constructive algorithms greedy implementation | Statement | B | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1000.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 17091 | Absolute Maximization | bitmasks constructive algorithms greedy math | Statement | A | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 500.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 7926 | Another Array Problem | brute force constructive algorithms greedy | Statement | C | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 1500.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 10520 | Doremy's City Construction | constructive algorithms greedy math | Statement | C | Codeforces Global Round 24 {1764} | PROGRAMMING | 1500.0 | Codeforces Global Round 24 Editorial | |
| 11294 | Playoff | combinatorics constructive algorithms dp graphs greedy | Statement | D | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 15834 | Elemental Decompress | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 13348 | Ice and Fire | constructive algorithms dp greedy | Statement | C | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1500.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 14111 | Coloring | constructive algorithms greedy | Statement | B | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 20038 | Gardener and the Capybaras (hard version) | constructive algorithms greedy strings | Statement | A2 | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 4213 | Train Splitting | constructive algorithms graphs greedy | Statement | F | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 9138 | Boris and His Amazing Haircut | constructive algorithms data structures dp dsu greedy | Statement | D | Hello 2023 {1779} | PROGRAMMING | 1500.0 | ||
| 2079 | Anya's Simultaneous Exhibition | constructive algorithms data structures graphs greedy interactive sortings | Statement | E | Hello 2023 {1779} | PROGRAMMING | 2250.0 | ||
| 24128 | Hall of Fame | constructive algorithms greedy math strings | Statement | A | Hello 2023 {1779} | PROGRAMMING | 500.0 | ||
| 22762 | Hayato and School | constructive algorithms greedy | Statement | A | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 500.0 | 111841 | |
| 2780 | The Harmonization of XOR | bitmasks constructive algorithms greedy math | Statement | E | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 2250.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 22575 | Sum of Two Numbers | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1000.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 19615 | Matching Numbers | constructive algorithms greedy math | Statement | C | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1500.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 42574 | Not Dividing | constructive algorithms greedy math | Statement | B | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 9037 | Li Hua and Chess | brute force constructive algorithms greedy hashing interactive | Statement | C | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1500.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 19637 | Li Hua and Maze | constructive algorithms greedy | Statement | A | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 500.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 26019 | Li Hua and Pattern | constructive algorithms greedy | Statement | B | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1000.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 14724 | Shocking Arrangement | constructive algorithms greedy math | Statement | D | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round 860 (Div. 2) | 1600 |
| 12911 | Equalize by Divide | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1000.0 | Codeforces Round #854 Editorial | |
| 1425 | City Union | constructive algorithms dp geometry greedy implementation math | Statement | E | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 2250.0 | Codeforces Round #854 Editorial | |
| 7020 | Double Lexicographically Minimum | constructive algorithms greedy implementation strings | Statement | C | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1500.0 | Codeforces Round #854 Editorial | |
| 15535 | Unforgivable Curse (hard version) | brute force constructive algorithms constructive algorithms dsu graphs greedy | Statement | E2 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 15910 | Unforgivable Curse (easy version) | brute force constructive algorithms dsu graphs greedy | Statement | E1 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 19912 | Mex Master | constructive algorithms greedy | Statement | B | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1000.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 15381 | Sum on Subarrays | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 22441 | Restore the Array | constructive algorithms greedy | Statement | C | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 2398 | Between | constructive algorithms dfs and similar graphs greedy shortest paths | Statement | C | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #865 | 2200 |
| 16818 | Grid Reconstruction | constructive algorithms greedy | Statement | B | Codeforces Round 865 (Div. 2) {1816} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #865 | 1000 |
| 4354 | Unique Palindromes | binary search constructive algorithms greedy math strings | Statement | D | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2000.0 | 115465 | |
| 946 | Bus Routes | binary search constructive algorithms dfs and similar greedy trees | Statement | E | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 2500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 3400 |