Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
< 1 2 3 4 5 6 7 8 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 26696 | Permutation Sort | constructive algorithms greedy | Statement | B | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 2806 | Kill Anton | brute force constructive algorithms data structures math strings | Statement | D | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 2250.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 1479 | Oolimry and Suffix Array | combinatorics constructive algorithms math string suffix structures | Statement | E | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 2500.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 393 | Median Queries | constructive algorithms interactive probabilities | Statement | F | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 3500.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 25050 | Mean Inequality | constructive algorithms sortings | Statement | A | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 500.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 2292 | MEX Tree | combinatorics constructive algorithms data structures dfs and similar math trees | Statement | D | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 2250.0 | Tutorial | 2400 |
| 31062 | Eshag Loves Big Arrays | constructive algorithms greedy | Statement | A | Codeforces Round 722 (Div. 2) {1529} | PROGRAMMING | 500.0 | Codeforces Round #722 Editorial | |
| 185 | What a Reversal | constructive algorithms | Statement | G | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 3750.0 | Codeforces Round #733 Editorial (all problems) | |
| 10122 | Secret Santa | constructive algorithms flows graphs math probabilities | Statement | D | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 1500.0 | Codeforces Round #733 Editorial (all problems) | |
| 3280 | 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) | |
| 16296 | Putting Plates | constructive algorithms implementation | Statement | B | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 750.0 | Codeforces Round #733 Editorial (all problems) | |
| 659 | Симметричный амфитеатр | *special constructive algorithms | Statement | C | VK Cup 2021 - Квалификация (Engine) {1531} | PROGRAMMING | Разбор квалификационного раунда VK Cup 2021 | ||
| 61 | Excursions | *special constructive algorithms dfs and similar flows graphs | Statement | I | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 98 | Biome Map | *special constructive algorithms dfs and similar graphs | Statement | G | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 877 | A New Beginning | constructive algorithms dp | Statement | G | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 3250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 2079 | Lost Array | constructive algorithms dp graphs interactive shortest paths | Statement | E | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 2250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 6831 | Lost Tree | constructive algorithms interactive trees | Statement | D | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1500.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 20789 | Omkar and Bad Story | brute force constructive algorithms | Statement | A | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 500.0 | Codeforces Round #724 — Editorial | 800 |
| 2820 | Figure Fixing | constructive algorithms dfs and similar dsu graphs math | Statement | F | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 2000.0 | Codeforces Round #726 (Div.2) Editorial | |
| 42985 | Bad Boy | constructive algorithms greedy math | Statement | B | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 750.0 | Codeforces Round #726 (Div.2) Editorial | |
| 15337 | Another Problem About Dividing Numbers | constructive algorithms number theory | Statement | D | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 1056 | Game with Cards | binary search constructive algorithms data structures dp implementation | Statement | E | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 2000.0 | tutorial | 2500 |
| 15019 | Great Graphs | constructive algorithms graphs greedy shortest paths sortings | Statement | A | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 500.0 | Tutorial | |
| 30762 | Pretty Permutations | constructive algorithms greedy implementation | Statement | A | Codeforces Round 728 (Div. 2) {1541} | PROGRAMMING | 500.0 | Tutorial | |
| 26656 | Plus and Multiply | constructive algorithms math number theory | Statement | B | Codeforces Round 729 (Div. 2) {1542} | PROGRAMMING | 1250.0 | ||
| 8025 | RPD and Rap Sheet (Easy Version) | bitmasks constructive algorithms interactive math | Statement | D1 | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 1000.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 2174 | RPD and Rap Sheet (Hard Version) | constructive algorithms dp interactive math | Statement | D2 | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 1250.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 452 | The Final Pursuit | constructive algorithms graphs greedy | Statement | E | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 3000.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 769 | AquaMoon and Permutations | combinatorics constructive algorithms graph matchings graphs | Statement | C | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 1500.0 | Codeforces Round #732 Editorial | 2800 |
| 609 | AquaMoon and Wrong Coordinate | constructive algorithms interactive math | Statement | D | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 2250.0 | Codeforces Round #732 Editorial | 3000 |
| 7017 | Array Stabilization (GCD version) | binary search constructive algorithms data structures number theory two pointers | Statement | F | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 2063 | Excellent Arrays | brute force combinatorics constructive algorithms implementation math | Statement | D | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 16709 | 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) | ||
| 2992 | Domino (hard version) | constructive algorithms implementation math | Statement | D2 | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 7587 | Domino (easy version) | constructive algorithms math | Statement | D1 | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 6297 | Maximize the Intersections | combinatorics constructive algorithms geometry greedy | Statement | C | Codeforces Global Round 15 {1552} | PROGRAMMING | 1000.0 | Editorial of Global Round 15 | |
| 2130 | Colors and Intervals | constructive algorithms data structures greedy sortings | Statement | E | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 3788 | Permutation Shift | brute force combinatorics constructive algorithms dfs and similar graphs math | Statement | E | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 1750.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 10601 | Diane | constructive algorithms greedy strings | Statement | D | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #735 (Div. 2) | 1800 |
| 24215 | Coin Rows | brute force constructive algorithms dp implementation | Statement | C | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 1300 | |
| 8779 | Take a Guess | bitmasks constructive algorithms interactive math | Statement | D | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 1500.0 | 94384 | 1800 |
| 3742 | 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 |
| 22961 | Mocha and Hiking | constructive algorithms graphs | Statement | C | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1000.0 | Tutorial (en) | 1200 |
| 16161 | 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 |
| 3081 | 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 |
| 46432 | Mocha and Math | bitmasks constructive algorithms math | Statement | A | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 500.0 | Tutorial (en) | 900 |
| 6772 | 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 | |
| 4990 | 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 | |
| 2250 | Two Hundred Twenty One (hard version) | binary search constructive algorithms data structures dp math | Statement | D2 | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 6659 | Two Hundred Twenty One (easy version) | constructive algorithms dp math | Statement | D1 | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 14330 | Rings | constructive algorithms math | Statement | C | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 21279 | MIN-MEX Cut | bitmasks constructive algorithms dp | Statement | B | Codeforces Global Round 16 {1566} | PROGRAMMING | 750.0 | Codeforces Global Round 16 Editorial | |
| 19091 | MAX-MEX Cut | bitmasks constructive algorithms dp greedy | Statement | C | Codeforces Global Round 16 {1566} | PROGRAMMING | 1000.0 | Codeforces Global Round 16 Editorial | |
| 385 | 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 | |
| 153 | Xor-quiz | constructive algorithms dp interactive math number theory | Statement | H | Codeforces Global Round 16 {1566} | PROGRAMMING | 3750.0 | Codeforces Global Round 16 Editorial | |
| 882 | One-Four Overload | 2-sat constructive algorithms dfs and similar geometry graphs implementation | Statement | F | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 2750.0 | Codeforces Round #742 Editorial | |
| 4863 | Expression Evaluation Error | constructive algorithms greedy implementation math | Statement | D | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 1750.0 | Codeforces Round #742 Editorial | |
| 19880 | Chess Tournament | constructive algorithms | Statement | B | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
| 369 | Sweepstake | *special brute force constructive algorithms implementation math | Statement | D | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 226 | Kotlinforces | *special constructive algorithms dp | Statement | F | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 2014 | Xor of 3 | brute force constructive algorithms greedy | Statement | B | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 1250.0 | Tutorial | 2500 |
| 1040 | Coloring | combinatorics constructive algorithms implementation | Statement | E | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 23099 | Regular Bracket Sequences | constructive algorithms | Statement | A | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 425 | Anti-Tetris | constructive algorithms graphs shortest paths | Statement | A | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 521 | The Mind | constructive algorithms interactive probabilities | Statement | M | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 25318 | Permutation Minimization by Deque | constructive algorithms greedy math | Statement | E1 | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 124 | Railway Construction | brute force constructive algorithms data structures graphs shortest paths | Statement | E | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 3500.0 | Codeforces Round #745 Editorial | 3400 |
| 12538 | Diameter of Graph | constructive algorithms graphs greedy math | Statement | B | Codeforces Round 745 (Div. 2) {1581} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 1200 |
| 11616 | Vupsen, Pupsen and 0 | constructive algorithms math | Statement | D | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1750.0 | Codeforces Round #750 (Div.2) Editorial | |
| 1540 | Defender of Childhood Dreams | bitmasks constructive algorithms divide and conquer | Statement | F | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 2750.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 2493 | 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) | |
| 5944 | Omkar and the Meaning of Life | constructive algorithms interactive | Statement | D | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 1750.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 13300 | Omkar and Heavenly Tree | constructive algorithms trees | Statement | B | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 1000.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 299 | Omkar and Mosaic | combinatorics constructive algorithms math | Statement | I | Codeforces Round 749 (Div. 1 + Div. 2, based on Technocup 2022 Elimination Round 1) {1586} | PROGRAMMING | 4000.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 9183 | Bakry and Partitioning | bitmasks constructive algorithms dfs and similar dp graphs trees | Statement | C | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1500.0 | 95583 | |
| 9507 | The Number of Imposters | constructive algorithms dfs and similar dp dsu graphs | Statement | D | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1750.0 | 95525 | 1700 |
| 1541 | Ideal Farm | constructive algorithms math | Statement | F | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 2750.0 | 95525 | 2400 |
| 882 | Weights | constructive algorithms greedy two pointers | Statement | A | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | Tutorial | ||
| 14768 | Divine Array | constructive algorithms implementation | Statement | B | Codeforces Round 751 (Div. 2) {1602} | PROGRAMMING | 1000.0 | 95865 | 1100 |
| 17865 | Di-visible Confusion | constructive algorithms math number theory | Statement | A | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #752 | 1300 |
| 15120 | Moderate Modular Mode | constructive algorithms math number theory | Statement | B | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #752 | 1600 |
| 16352 | XOR Specia-LIS-t | constructive algorithms | Statement | B | Codeforces Round 752 (Div. 2) {1604} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #752 | 1100 |
| 3261 | Treelabeling | bitmasks constructive algorithms dfs and similar games graphs greedy trees | Statement | D | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2000.0 | tutorial | 2100 |
| 1579 | Red-Blue Matrix | constructive algorithms data structures hashing implementation sortings two pointers | Statement | D | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 15236 | Banknotes | constructive algorithms greedy | Statement | C | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 38166 | AB Balance | constructive algorithms strings | Statement | A | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 12520 | 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) | |
| 20293 | Find Array | constructive algorithms math | Statement | A | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 250.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 710 | Mashtali: a Space Oddysey | constructive algorithms dfs and similar graphs implementation | Statement | F | Codeforces Global Round 17 {1610} | PROGRAMMING | 2750.0 | Codeforces Global Round 17 Editorial | |
| 17117 | Anti Light's Cell Guessing | constructive algorithms implementation math | Statement | A | Codeforces Global Round 17 {1610} | PROGRAMMING | 500.0 | Codeforces Global Round 17 Editorial | |
| 19402 | Polycarp Recovers the Permutation | constructive algorithms | Statement | C | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1000 | |
| 11633 | Weights Assignment For Tree Edges | constructive algorithms trees | Statement | D | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1500 | |
| 31979 | Team Composition: Programmers and Mathematicians | binary search constructive algorithms math | Statement | B | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 800 | |
| 33472 | Make Even | constructive algorithms math | Statement | A | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 800 | |
| 18220 | Distance | brute force constructive algorithms | Statement | A | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 1001 | Max Sum Array | combinatorics constructive algorithms greedy sortings | Statement | G | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 18466 | Special Permutation | constructive algorithms | Statement | B | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 5913 | Crazy Robot | constructive algorithms dfs and similar graphs | Statement | E | Educational Codeforces Round 118 (Rated for Div. 2) {1613} | PROGRAMMING | 97467 | ||
| 29584 | Divan and a New Project | constructive algorithms sortings | Statement | B | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 750.0 | Tutorial | 1000 |
| 11340 | Divan and bitwise operations | bitmasks combinatorics constructive algorithms dp math | Statement | C | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 1500 |
| 24628 | Divan and a Store | brute force constructive algorithms greedy | Statement | A | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 388 | Reindeer Games | constructive algorithms flows graphs shortest paths | Statement | H | Codeforces Global Round 18 {1615} | PROGRAMMING | 4000.0 | Global Round 18 Editorial | |
| 172 | Maximum Adjacent Pairs | constructive algorithms graph matchings | Statement | G | Codeforces Global Round 18 {1615} | PROGRAMMING | 3750.0 | Global Round 18 Editorial | |
| 26940 | GCD Problem | brute force constructive algorithms math | Statement | B | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 5192 | Too Many Impostors (easy version) | constructive algorithms interactive | Statement | D1 | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 2000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 2044 | Too Many Impostors (hard version) | constructive algorithms interactive | Statement | D2 | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 17016 | Forbidden Subsequence | constructive algorithms sortings strings | Statement | A | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 750.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 7800 | Singers' Tour | constructive algorithms math | Statement | E | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 10244 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 2346 | Let's Play the Hat? | constructive algorithms math | Statement | F | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 4825 | Exact Change | binary search brute force constructive algorithms greedy | Statement | D | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 23211 | Equal or Not Equal | constructive algorithms implementation | Statement | A | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 24797 | Stable Arrangement of Rooks | constructive algorithms | Statement | A | Hello 2022 {1621} | PROGRAMMING | 500.0 | ||
| 4403 | The Winter Hike | constructive algorithms greedy math | Statement | D | Hello 2022 {1621} | PROGRAMMING | 1750.0 | ||
| 868 | Quadratic Set | constructive algorithms hashing number theory | Statement | F | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 3819 | Interacdive Problem | binary search constructive algorithms interactive | Statement | F | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 4613 | Masha-forgetful | brute force constructive algorithms dp hashing implementation strings | Statement | E | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 26939 | 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 | ||
| 30947 | Equidistant Letters | constructive algorithms | Statement | A | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 16313 | Not Assigning | constructive algorithms dfs and similar number theory trees | Statement | C | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1250.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 24918 | Not Shading | constructive algorithms implementation | Statement | A | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 500.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 17064 | Meximum Array | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 500.0 | 99276 | |
| 3583 | Grid Xor | constructive algorithms greedy implementation interactive math | Statement | C | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 1250.0 | 99276 | |
| 16210 | And Matching | bitmasks constructive algorithms | Statement | A | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #768 | |
| 32037 | Roof Construction | bitmasks constructive algorithms | Statement | B | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #769 | |
| 2213 | Fair Share | constructive algorithms data structures dfs and similar graph matchings graphs | Statement | E | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 4773 | Finding Zero | constructive algorithms greedy interactive | Statement | D | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2000.0 | Codeforces Round #770 (Div. 2) editorial | |
| 19104 | OKEA | constructive algorithms math | Statement | C | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 1500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 2736 | 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 | |
| 25564 | Differential Sorting | constructive algorithms greedy | Statement | C | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 1500.0 | Codeforces Round #772 Editorial | |
| 2172 | Towers | constructive algorithms dfs and similar dp greedy trees | Statement | F | Codeforces Global Round 19 {1637} | PROGRAMMING | 3250.0 | Tutorial | |
| 18764 | Andrew and Stones | constructive algorithms greedy | Statement | C | Codeforces Global Round 19 {1637} | PROGRAMMING | 1500.0 | Tutorial | |
| 621 | Birthday | constructive algorithms math | Statement | G | Codeforces Global Round 19 {1637} | PROGRAMMING | 4000.0 | Tutorial | |
| 4077 | Repetitions Decoding | constructive algorithms implementation sortings | Statement | B | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1250.0 | Codeforces Round #773 editorial | |
| 21331 | Anti-Fibonacci Permutation | brute force constructive algorithms implementation | Statement | B | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 19818 | Factorials and Powers of Two | bitmasks brute force constructive algorithms math | Statement | C | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 1250.0 | Codeforces Round #774 (Div. 2) Editorial | 1500 |
| 4461 | Weight the Tree | constructive algorithms dfs and similar dp implementation trees | Statement | D | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 2000.0 | Codeforces Round #774 (Div. 2) Editorial | 2000 |
| 683 | 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 |
| 22716 | 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 |
| 13359 | Madoka and Childish Pranks | constructive algorithms greedy | Statement | C | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 1500.0 | Codeforces Round #777 Editorial | |
| 7314 | Integral Array | brute force constructive algorithms data structures math | Statement | B | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 1000.0 | Codeforces Round #775 Editorial | |
| 15273 | Twist the Permutation | brute force constructive algorithms math | Statement | D | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 20491 | Prove Him Wrong | constructive algorithms greedy | Statement | B | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 14574 | 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 |
| 27248 | Subtract Operation | constructive algorithms data structures math two pointers | Statement | B | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 1000.0 | Tutorial | |
| 3881 | Equal Tree Sums | constructive algorithms dfs and similar trees | Statement | E | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 2500.0 | Tutorial | |
| 7587 | K-good | constructive algorithms games math number theory | Statement | D | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 2000.0 | Tutorial | |
| 154 | Neighbour Ordering | constructive algorithms graphs | Statement | I | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 4500.0 | Tutorial | |
| 467 | Cycle Palindrome | constructive algorithms math | Statement | G | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3250.0 | Tutorial | |
| 20469 | Good Pairs | constructive algorithms math sortings | Statement | A | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 500.0 | Tutorial | |
| 946 | Juju and Binary String | brute force constructive algorithms math | Statement | F | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 3000.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 20921 | Marin and Photoshoot | constructive algorithms math | Statement | A | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 500.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 9966 | Shinju and the Lost Permutation | constructive algorithms math | Statement | C | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 1750.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 12045 | Bit Flipping | bitmasks constructive algorithms greedy strings | Statement | B | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 750.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 4457 | 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 | |
| 31633 | 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 | |
| 8101 | Matrix and Shifts | constructive algorithms greedy implementation | Statement | E | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 3879 | Bottle Arrangements | constructive algorithms | Statement | M | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 1354 | Cross-Language Program | constructive algorithms | Statement | H | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
| 4692 | GCD Guess | bitmasks chinese remainder theorem constructive algorithms interactive math number theory | Statement | D | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 1500.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 33600 | Array Cloning Technique | constructive algorithms greedy sortings | Statement | B | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 750.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 26284 | GCD vs LCM | constructive algorithms math | Statement | A | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 500.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 884 | 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) | ||
| 3711 | Connect the Points | brute force constructive algorithms geometry | Statement | C | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 1585 | Job Lookup | constructive algorithms dp | Statement | J | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 1979 | Half Queen Cover | constructive algorithms math | Statement | C | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 1500.0 | Codeforces Round #783 Editorial | 2400 |
| 812 | Edge Elimination | constructive algorithms dfs and similar dp trees | Statement | D | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 2000.0 | Codeforces Round #783 Editorial | 2900 |
| 1942 | Hemose on the Tree | bitmasks constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2750.0 | Tutorial | 2200 |
| 8481 | Insert a Progression | brute force constructive algorithms greedy | Statement | D | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 14053 | Unequal Array | constructive algorithms greedy implementation | Statement | C | Codeforces Global Round 20 {1672} | PROGRAMMING | 750.0 | Global Round 20 Editorial | 1100 |
| 6967 | Cyclic Rotation | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Global Round 20 {1672} | PROGRAMMING | 1000.0 | Global Round 20 Editorial | 1700 |
| 3564 | Array Shuffling | constructive algorithms graphs greedy | Statement | F1 | Codeforces Global Round 20 {1672} | PROGRAMMING | 1250.0 | Global Round 20 Editorial | 2000 |
| 2526 | notepad.exe | binary search constructive algorithms greedy interactive | Statement | E | Codeforces Global Round 20 {1672} | PROGRAMMING | 1500.0 | Global Round 20 Editorial | 2200 |
| 1133 | Zigu Zagu | constructive algorithms greedy | Statement | H | Codeforces Global Round 20 {1672} | PROGRAMMING | 3000.0 | Global Round 20 Editorial | 2700 |
| 939 | Checker for Array Shuffling | constructive algorithms dfs and similar graphs | Statement | F2 | Codeforces Global Round 20 {1672} | PROGRAMMING | 1250.0 | Global Round 20 Editorial | 2800 |
| 16835 | Log Chopping | constructive algorithms games implementation math | Statement | A | Codeforces Global Round 20 {1672} | PROGRAMMING | 250.0 | Global Round 20 Editorial | 800 |
| 16486 | I love AAAB | constructive algorithms implementation | Statement | B | Codeforces Global Round 20 {1672} | PROGRAMMING | 500.0 | Global Round 20 Editorial | 800 |
| 964 | 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 | |
| 7328 | Breaking the Wall | binary search brute force constructive algorithms greedy math | Statement | E | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 17830 | A-B-C Sort | constructive algorithms implementation sortings | Statement | D | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 28013 | Number Transformation | constructive algorithms math | Statement | A | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 4098 | 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 | |
| 26884 | AND Sorting | bitmasks constructive algorithms sortings | Statement | B | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 1000.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 752 | 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 | |
| 16517 | 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 | |
| 3732 | Circular Spanning Tree | constructive algorithms trees | Statement | D | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2000.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 13303 | Column Swapping | constructive algorithms implementation sortings | Statement | C | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 1250.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 1400 |
| 10793 | 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 |
| 3644 | 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 |
| 790 | Euclid Guess | constructive algorithms flows graph matchings math number theory | Statement | G | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 2500.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 2800 |
| 289 | Hard Cut | constructive algorithms divide and conquer math | Statement | H | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 3250.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 3400 |
| 24967 | Digit Minimization | constructive algorithms games math | Statement | A | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 500.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 800 |
| 21867 | Z mod X = C | constructive algorithms math | Statement | B | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 750.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 800 |
| 18630 | Circular Local MiniMax | constructive algorithms greedy sortings | Statement | A | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 500.0 | 103198 | 1100 |
| 1351 | Bring Balance | constructive algorithms greedy | Statement | C | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 1500.0 | 103198 | 2600 |
| 518 | Permutation Weight (Easy Version) | constructive algorithms dfs and similar dsu | Statement | D1 | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 1500.0 | 103198 | 2800 |
| 132 | Permutation Weight (Hard Version) | constructive algorithms greedy | Statement | D2 | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 1500.0 | 103198 | 3500 |
| 1693 | Sanae and Giant Robot | brute force constructive algorithms data structures dfs and similar dsu | Statement | C | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 796 | |
| 313 | Become Big For Me | combinatorics constructive algorithms math number theory | Statement | E | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 796 | |
| 4154 | 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 | |
| 11456 | The Enchanted Forest | constructive algorithms greedy math | Statement | A | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 796 | |
| 23585 | Cirno's Perfect Bitmasks Classroom | bitmasks brute force constructive algorithms | Statement | A | Codeforces Round 796 (Div. 2) {1688} | PROGRAMMING | 500.0 | Tutorial | |
| 19069 | Patchouli's Magical Talisman | bitmasks constructive algorithms greedy sortings | Statement | B | Codeforces Round 796 (Div. 2) {1688} | PROGRAMMING | 750.0 | Tutorial | |
| 1367 | ANDfinity | bitmasks brute force constructive algorithms dfs and similar dsu graphs | Statement | E | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 13598 | 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) | |
| 35698 | Print a Pedestal (Codeforces logo?) | constructive algorithms greedy | Statement | A | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 800 | |
| 7547 | Max GEQ Sum | binary search constructive algorithms data structures divide and conquer implementation sortings two pointers | Statement | D | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 1750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 17289 | 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) | |
| 35975 | 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) | |
| 32243 | 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) | |
| 20699 | Paranoid String | constructive algorithms greedy | Statement | B | Codeforces Round 800 (Div. 2) {1694} | PROGRAMMING | 1000.0 | Codeforces Round #800 Editorial | 1200 |
| 2465 | 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 | |
| 2301 | 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 | |
| 514 | Ambiguous Dominoes | constructive algorithms dfs and similar graphs | Statement | E | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 6030 | 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 | |
| 1144 | Tree Recovery | bitmasks brute force constructive algorithms dfs and similar dsu graphs trees | Statement | F | Codeforces Global Round 21 {1696} | PROGRAMMING | 2500.0 | Editorial of Codeforces Global Round 21 | |
| 12596 | Fishingprince Plays With Array | constructive algorithms greedy implementation | Statement | C | Codeforces Global Round 21 {1696} | PROGRAMMING | 1500.0 | Editorial of Codeforces Global Round 21 | |
| 5013 | Guess The String | binary search brute force constructive algorithms dsu interactive | Statement | D | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 1452 | Coloring | brute force combinatorics constructive algorithms dfs and similar dp dsu graphs implementation | Statement | E | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 15839 | 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 | ||
| 1794 | 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 | |
| 12212 | Fixed Point Guessing | binary search constructive algorithms interactive | Statement | D | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 1500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 760 | Equal Reversal | constructive algorithms graphs math | Statement | F | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 2500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 21483 | Rising Sand | constructive algorithms greedy implementation | Statement | B | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 21786 | Almost Ternary Matrix | 2-sat bitmasks constructive algorithms matrices | Statement | B | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 1000.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 24846 | The Third Three Number Problem | constructive algorithms math | Statement | A | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 500.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 19927 | Palindromic Numbers | constructive algorithms implementation math | Statement | B | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1000.0 | 103978 | 1100 |
| 12219 | Helping the Nature | constructive algorithms greedy | Statement | C | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1500.0 | 103978 | 1700 |
| 961 | Serega the Pirate | brute force constructive algorithms | Statement | E | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 2500.0 | 103978 | 2600 |
| 38324 | Round Down the Price | constructive algorithms | Statement | A | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 9517 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 2695 | Count Seconds | brute force constructive algorithms dp graphs | Statement | E | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 2000.0 | CodeTON Round 2 Editorial | |
| 134 | Mio and Lucky Array | constructive algorithms fft math strings | Statement | G | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 3500.0 | CodeTON Round 2 Editorial | |
| 1310 | Colouring Game | constructive algorithms games | Statement | F | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 2750.0 | CodeTON Round 2 Editorial | |
| 16671 | 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 | |
| 5388 | Magical Array | constructive algorithms hashing math | Statement | D | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 1750.0 | CodeTON Round 2 Editorial | |
| 698 | Mark and the Online Exam | bitmasks constructive algorithms interactive math probabilities | Statement | F | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 3000.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 7184 | Mark and Lightbulbs | combinatorics constructive algorithms math sortings | Statement | D | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 1750.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 7738 | 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 | |
| 1943 | Chopping Carrots (Hard Version) | constructive algorithms dp number theory two pointers | Statement | D2 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1250.0 | Codeforces Round #809 Editorial | |
| 176 | Bugaboo | bitmasks constructive algorithms dp number theory | Statement | F | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 3250.0 | 104930 | |
| 28860 | Difference of GCDs | constructive algorithms math | Statement | B | Codeforces Round 808 (Div. 2) {1708} | PROGRAMMING | 1000.0 | 104930 | |
| 11942 | Color the Picture | constructive algorithms greedy | Statement | A | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 500.0 | Codeforces Round #810 Editorial | |
| 560 | Recover the Tree | constructive algorithms trees | Statement | D | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 2000.0 | Codeforces Round #810 Editorial | |
| 26534 | Perfect Permutation | constructive algorithms | Statement | A | Codeforces Round 810 (Div. 2) {1711} | PROGRAMMING | 500.0 | Codeforces Round #810 Editorial | |
| 22412 | Woeful Permutation | constructive algorithms greedy number theory | Statement | B | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 1000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 22741 | Optimal Reduction | constructive algorithms sortings | Statement | B | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 1000.0 | Codeforces Round #812 (Div. 2) Editorial | 1000 |
| 18919 | Build Permutation | constructive algorithms dp math | Statement | C | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 1750.0 | Codeforces Round #812 (Div. 2) Editorial | 1200 |
| 6257 | 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 |
| 690 | Lost Array | bitmasks combinatorics constructive algorithms dp math | Statement | F | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 3000.0 | Codeforces Round #812 (Div. 2) Editorial | 2900 |