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 |
|---|---|---|---|---|---|---|---|---|---|
| 3656 | 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 | ||
| 588 | Crop Squares | constructive algorithms geometry interactive math | Statement | F | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 3000.0 | Codeforces Round #816 (Div. 2) editorial | |
| 24361 | Crossmarket | constructive algorithms greedy math | Statement | A | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 500.0 | Codeforces Round #816 (Div. 2) editorial | |
| 33344 | Beautiful Array | constructive algorithms greedy math | Statement | B | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 1000.0 | Codeforces Round #816 (Div. 2) editorial | |
| 21946 | Permutation Chain | constructive algorithms math | Statement | B | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 15625 | 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 |
| 632 | Madoka and The First Session | constructive algorithms dfs and similar flows graph matchings graphs | Statement | F | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 3000.0 | Codeforces Round #818 (Div. 2) Editorial. | 2500 |
| 154 | Impressionism | constructive algorithms graphs implementation math | Statement | E | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 2250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 19160 | Mathematical Circus | constructive algorithms math | Statement | B | Codeforces Round 814 (Div. 2) {1719} | PROGRAMMING | 1000.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 949 | Misha and Paintings | constructive algorithms math | Statement | E | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 2750.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 14113 | Even-Odd XOR | bitmasks constructive algorithms greedy | Statement | G | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1500 | |
| 3005 | Hot Black Hot White | constructive algorithms math | Statement | H | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 16824 | Mainak and Interesting Sequence | bitmasks constructive algorithms math | Statement | B | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 1000.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 4145 | Edge Split | brute force constructive algorithms dfs and similar graphs probabilities trees | Statement | D | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 2000.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 8226 | Letter Picking | constructive algorithms dp games | Statement | D | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 20666 | Best Permutation | constructive algorithms greedy | Statement | B | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 21607 | Jumping on Tiles | constructive algorithms strings | Statement | C | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 3019 | Prefixes and Suffixes | constructive algorithms dsu strings | Statement | D | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 2250.0 | Codeforces Round #823 — editorial | 2200 |
| 17493 | Bestie | brute force constructive algorithms implementation math number theory | Statement | A | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 750.0 | 108327 | 1000 |
| 21059 | Rule of League | constructive algorithms math | Statement | B | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1000.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 17039 | Parity Shuffle Sorting | constructive algorithms sortings | Statement | C | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 16391 | Bright, Nice, Brilliant | constructive algorithms | Statement | B | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 750.0 | Codeforces Round #822 (Div.2) Editorial | |
| 3236 | Rectangular Congruence | constructive algorithms math number theory | Statement | E | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 2250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 1238 | 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 | |
| 21046 | Working Week | constructive algorithms greedy math | Statement | A | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 500.0 | Codeforces Round #824 — editorial | |
| 2763 | Equal Binary Subsequences | constructive algorithms greedy strings | Statement | D | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 157 | Ela and Prime GCD | constructive algorithms math number theory | Statement | F | Dytechlab Cup 2022 {1737} | PROGRAMMING | 3500.0 | Editorial of Dytechlab Cup 2022 | |
| 549 | 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> | |
| 3740 | Permutation Addicts | constructive algorithms dfs and similar dsu graphs trees | Statement | D | Codeforces Global Round 22 {1738} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 1373 | 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> | |
| 18718 | Prefix Sum Addicts | constructive algorithms math sortings | Statement | B | Codeforces Global Round 22 {1738} | PROGRAMMING | 1000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 10070 | Card Game | combinatorics constructive algorithms dp games | Statement | C | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 24405 | Array Recovery | constructive algorithms greedy math | Statement | B | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 12302 | Bricks and Bags | constructive algorithms games greedy sortings | Statement | C | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1500.0 | Tutorial | 1400 |
| 9047 | Knowledge Cards | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1750.0 | Tutorial | 1500 |
| 5029 | 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 |
| 346 | Dangerous Laser Power | constructive algorithms dsu sortings | Statement | G | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2750.0 | Tutorial | 3100 |
| 26739 | Funny Permutation | constructive algorithms math | Statement | B | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 13978 | Smaller | constructive algorithms greedy strings | Statement | F | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 20603 | 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 | |
| 1688 | Joking (Easy Version) | binary search bitmasks constructive algorithms interactive ternary search | Statement | E1 | Codeforces Global Round 23 {1746} | PROGRAMMING | 2000.0 | Codeforces Global Round 23 Editorial | |
| 21059 | Maxmina | constructive algorithms greedy | Statement | A | Codeforces Global Round 23 {1746} | PROGRAMMING | 500.0 | Codeforces Global Round 23 Editorial | |
| 18629 | Rebellion | constructive algorithms greedy | Statement | B | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial | |
| 14019 | Permutation Operations | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial | |
| 5541 | Yet Another Problem | binary search bitmasks constructive algorithms data structures | Statement | D | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 1750.0 | Codeforces Round #832 (Div. 2) Editorial | |
| 25893 | BAN BAN | constructive algorithms | Statement | B | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 1000.0 | Codeforces Round #832 (Div. 2) Editorial | |
| 26464 | Two Groups | constructive algorithms greedy | Statement | A | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 500.0 | Codeforces Round #832 (Div. 2) Editorial | |
| 3242 | ConstructOR | bitmasks chinese remainder theorem combinatorics constructive algorithms number theory | Statement | D | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 2000.0 | Codeforces Round #833 (Div. 2) Editorial | 2100 |
| 394 | Circular Xor Reversal | bitmasks constructive algorithms | Statement | F | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 2750.0 | Codeforces Round #833 (Div. 2) Editorial | 3000 |
| 10471 | Complementary XOR | constructive algorithms data structures | Statement | C | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 1250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 121 | BinaryStringForces | constructive algorithms data structures | Statement | H | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 3500.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 17799 | Indirect Sort | constructive algorithms math | Statement | A | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 500.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 16428 | Make Nonzero Sum (easy version) | constructive algorithms dp greedy | Statement | A1 | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 500.0 | Tutorial | 1300 |
| 11589 | Make Nonzero Sum (hard version) | constructive algorithms dp greedy | Statement | A2 | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 500.0 | Tutorial | 1500 |
| 19703 | Kevin and Permutation | constructive algorithms constructive algorithms math | Statement | B | Codeforces Round 829 (Div. 2) {1754} | PROGRAMMING | 1000.0 | Tutorial | 800 |
| 8457 | Range = √Sum | binary search brute force constructive algorithms math two pointers | Statement | D | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 1750.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 23847 | XOR = Average | constructive algorithms | Statement | B | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 1000.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 27019 | SSeeeeiinngg DDoouubbllee | constructive algorithms strings | Statement | A | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 500.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 10240 | 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 | ||
| 36233 | Two Permutations | brute force constructive algorithms | Statement | A | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 500.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 10709 | 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 | |
| 2142 | 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 | |
| 14683 | 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 | |
| 18595 | Make Array Good | constructive algorithms implementation number theory sortings | Statement | B | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 1000.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 136 | Unequal Adjacent Elements | constructive algorithms sortings | Statement | G | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 3500.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 16982 | 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 | |
| 7773 | 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 | |
| 1194 | Doremy's Experimental Tree | brute force constructive algorithms dfs and similar dsu sortings trees | Statement | F | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 10435 | Doremy's City Construction | constructive algorithms greedy math | Statement | C | Codeforces Global Round 24 {1764} | PROGRAMMING | 1500.0 | Codeforces Global Round 24 Editorial | |
| 4859 | Watch the Videos | binary search constructive algorithms two pointers | Statement | D | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1700 | |
| 11188 | Playoff | combinatorics constructive algorithms dp graphs greedy | Statement | D | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 1217 | Wonderful Jump | constructive algorithms dp | Statement | F | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 3250.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 15681 | Elemental Decompress | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 20833 | Koxia and Permutation | constructive algorithms | Statement | B | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 750.0 | Good Bye 2022 -- Editorial | |
| 164 | Koxia, Mahiru and Winter Festival | constructive algorithms | Statement | H | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 4000.0 | Good Bye 2022 -- Editorial | |
| 21207 | Hossam and Friends | binary search constructive algorithms dp two pointers | Statement | B | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 1000.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 2793 | Copy of a Copy of a Copy | constructive algorithms sortings | Statement | F | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 1674 | King's Puzzle | constructive algorithms | Statement | K | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 1900 | ||
| 1899 | Amazing Trick | constructive algorithms probabilities | Statement | A | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 1900 | ||
| 4770 | Football | constructive algorithms | Statement | F | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 800 | ||
| 603 | Segment Covering | brute force combinatorics constructive algorithms data structures trees | Statement | G | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 3250.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 9188 | Same Count One | brute force constructive algorithms implementation two pointers | Statement | D | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1500.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 155 | Maximum Permutation | constructive algorithms | Statement | H | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 4000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 13256 | 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 | |
| 13964 | 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 | |
| 23501 | Add Plus Minus Sign | constructive algorithms math | Statement | A | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 500.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 20577 | Gardener and the Array | bitmasks constructive algorithms | Statement | B | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 1000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 19923 | 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 | |
| 2370 | Another Wine Tasting Event | combinatorics constructive algorithms strings | Statement | G | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 4151 | Train Splitting | constructive algorithms graphs greedy | Statement | F | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 9021 | Boris and His Amazing Haircut | constructive algorithms data structures dp dsu greedy | Statement | D | Hello 2023 {1779} | PROGRAMMING | 1500.0 | ||
| 2025 | Anya's Simultaneous Exhibition | constructive algorithms data structures graphs greedy interactive sortings | Statement | E | Hello 2023 {1779} | PROGRAMMING | 2250.0 | ||
| 1401 | Xorcerer's Stones | constructive algorithms dp trees | Statement | F | Hello 2023 {1779} | PROGRAMMING | 2250.0 | ||
| 386 | The Game of the Century | constructive algorithms graphs shortest paths | Statement | G | Hello 2023 {1779} | PROGRAMMING | 2750.0 | ||
| 24037 | Hall of Fame | constructive algorithms greedy math strings | Statement | A | Hello 2023 {1779} | PROGRAMMING | 500.0 | ||
| 25038 | MKnez's ConstructiveForces Task | constructive algorithms math | Statement | B | Hello 2023 {1779} | PROGRAMMING | 750.0 | ||
| 22682 | Hayato and School | constructive algorithms greedy | Statement | A | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 500.0 | 111841 | |
| 1312 | Bracket Insertion | brute force combinatorics constructive algorithms dp math trees | Statement | F | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 3250.0 | Tutorial | |
| 19262 | Matrix of Differences | constructive algorithms | Statement | B | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 48259 | Make it Beautiful | constructive algorithms sortings | Statement | A | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 3656 | Letter Exchange | constructive algorithms constructive algorithms | Statement | B | VK Cup 2022 - Финальный раунд (Engine) {1784} | PROGRAMMING | 1250.0 | Codeforces Round #850 Editorial | |
| 2714 | 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 | |
| 799 | Inverse Transformation | constructive algorithms implementation math | Statement | F | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 2500.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 20370 | Exponential Equation | constructive algorithms math | Statement | A | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 500.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 1146 | XOR, Tree, and Queries | constructive algorithms dfs and similar dsu graphs trees | Statement | F | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 3000.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 22292 | 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 | |
| 19425 | Matching Numbers | constructive algorithms greedy math | Statement | C | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1500.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 1928 | Serval and Shift-Shift-Shift | bitmasks brute force constructive algorithms implementation | Statement | D | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 1750.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 17283 | Vlad and a Pair of Numbers | bitmasks constructive algorithms | Statement | E | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 1311 | Tokens on Graph | constructive algorithms dfs and similar graphs shortest paths | Statement | G | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 32775 | Dora and Search | constructive algorithms data structures two pointers | Statement | C | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 1250.0 | Codeforces Round #852 Editorial | |
| 17076 | Fedya and Array | constructive algorithms math | Statement | B | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 1000.0 | Codeforces Round #852 Editorial | |
| 39498 | Not Dividing | constructive algorithms greedy math | Statement | B | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 18796 | Prefix and Suffix Array | constructive algorithms strings | Statement | A | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 750.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 8903 | 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 | |
| 19447 | Li Hua and Maze | constructive algorithms greedy | Statement | A | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 500.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 24423 | Li Hua and Pattern | constructive algorithms greedy | Statement | B | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1000.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 13994 | 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 |
| 12711 | 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 | |
| 1399 | 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 | |
| 6910 | 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 | |
| 15223 | 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 | ||
| 15542 | 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 | ||
| 9719 | The Very Beautiful Blanket | bitmasks constructive algorithms | Statement | A | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 500.0 | Codeforces Round #857 Editorial | |
| 8634 | Sequence Master | brute force constructive algorithms math | Statement | C | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1750.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 19679 | Mex Master | constructive algorithms greedy | Statement | B | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1000.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 15129 | Sum on Subarrays | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 18919 | Candies | constructive algorithms math number theory | Statement | B | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 750.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 22194 | Restore the Array | constructive algorithms greedy | Statement | C | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 8623 | Umka and a Long Flight | constructive algorithms implementation math | Statement | D | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 4895 | Trivial Conjecture | *special constructive algorithms math number theory | Statement | D | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 3593 | Sum Graph | constructive algorithms graphs implementation interactive math shortest paths trees | Statement | B | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #865 | 2000 |
| 2349 | 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 |
| 315 | OH NO1 (-2-3-4) | constructive algorithms graphs math shortest paths | Statement | F | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #865 | 3500 |
| 16667 | Grid Reconstruction | constructive algorithms greedy | Statement | B | Codeforces Round 865 (Div. 2) {1816} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #865 | 1000 |
| 18838 | Ian Visits Mary | constructive algorithms geometry | Statement | A | Codeforces Round 865 (Div. 2) {1816} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #865 | 800 |
| 5074 | Fish Graph | brute force constructive algorithms dfs and similar graphs trees | Statement | B | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 1000.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 1030 | Toy Machine | constructive algorithms games implementation | Statement | D | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 2000.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 17016 | Indivisible | constructive algorithms | Statement | B | Codeforces Round 869 (Div. 2) {1818} | PROGRAMMING | 1000.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 1733 | The Fox and the Complete Tree Traversal | constructive algorithms dp games implementation math trees | Statement | C | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 1500.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 18980 | Super-Permutation | constructive algorithms math | Statement | D | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 4300 | Unique Palindromes | binary search constructive algorithms greedy math strings | Statement | D | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2000.0 | 115465 | |
| 17155 | A-characteristic | combinatorics constructive algorithms math | Statement | A | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 500.0 | 115465 | |
| 556 | 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 |
| 134 | Copium Permutation | constructive algorithms data structures greedy | Statement | F | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 3500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 3500 |
| 25313 | Divisible Array | constructive algorithms math | Statement | A | Codeforces Round 873 (Div. 2) {1828} | PROGRAMMING | 500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 800 |
| 45801 | Twin Permutations | constructive algorithms | Statement | A | Codeforces Round 875 (Div. 2) {1831} | PROGRAMMING | 500.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 34750 | Array merging | constructive algorithms greedy | Statement | B | Codeforces Round 875 (Div. 2) {1831} | PROGRAMMING | 750.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 2332 | Red-Blue Operations (Hard Version) | binary search constructive algorithms greedy implementation math | Statement | D2 | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2400 | |
| 15061 | Flipper | brute force constructive algorithms | Statement | D | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 5535 | Survey in Class | constructive algorithms data structures greedy implementation sortings | Statement | D | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 1750.0 | Codeforces Round #879 Editorial | |
| 21820 | Bracket Coloring | constructive algorithms data structures greedy | Statement | D | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 24539 | Best Binary String | constructive algorithms greedy | Statement | C | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 54259 | Grasshopper on a Line | constructive algorithms math | Statement | A | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 3691 | Bracket Walk | constructive algorithms data structures implementation sortings strings | Statement | D | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1750.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 17787 | Minimize Permutation Subarrays | constructive algorithms greedy math | Statement | B | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1000.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 17241 | No Prime Differences | constructive algorithms math number theory | Statement | C | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1250.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 1533 | Decreasing Game | constructive algorithms dp greedy interactive | Statement | E | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 2750.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 13421 | Insert Zero and Invert Prefix | constructive algorithms greedy | Statement | C | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 1500.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 2781 | In Search of Truth (Easy Version) | brute force constructive algorithms interactive math probabilities | Statement | G1 | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 1180 | In Search of Truth (Hard Version) | constructive algorithms interactive math probabilities | Statement | G2 | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 25970 | Game with Board | constructive algorithms games | Statement | A | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 4715 | Tenzing and His Animal Friends | brute force constructive algorithms graphs greedy shortest paths | Statement | D | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 1500.0 | CodeTON Round 5 Editorial | |
| 1174 | Tree Weights | bitmasks constructive algorithms data structures dfs and similar math matrices number theory trees | Statement | G | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 3500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 2151 | Great Grids | constructive algorithms dfs and similar dsu graphs math | Statement | E | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 2000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 25932 | Subtraction Game | constructive algorithms games math | Statement | A | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 17822 | Particles | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1250.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 20225 | Permutations & Primes | constructive algorithms greedy math | Statement | B | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 13810 | Row Major | constructive algorithms math number theory strings | Statement | D | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 22392 | Rudolph and Christmas Tree | constructive algorithms geometry math | Statement | D | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 3709 | Rudolph and Mimic | constructive algorithms greedy implementation interactive | Statement | F | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 21439 | Rudolf and the Another Competition | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 18379 | Vika and Her Friends | constructive algorithms games math | Statement | A | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 500.0 | Codeforces Round #885 (Div.2) Editorial | |
| 10281 | Array Painting | brute force constructive algorithms dp greedy | Statement | D | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 31471 | Escalator Conversations | brute force constructive algorithms implementation math | Statement | A | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 225 | Rivalries | constructive algorithms data structures | Statement | E | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 2250.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 600 | Miriany and Matchstick | constructive algorithms dp greedy | Statement | D | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 2000.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 5445 | Imbalanced Arrays | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 750.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 523 | Game Bundles | constructive algorithms | Statement | E | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 15857 | Dual (Easy Version) | constructive algorithms math | Statement | A1 | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 7839 | Dual (Hard Version) | constructive algorithms math | Statement | A2 | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 27370 | Good Arrays | constructive algorithms implementation math | Statement | B | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 750.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 25486 | Yet Another Permutation Problem | constructive algorithms math number theory | Statement | C | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1500.0 | Codeforces Round #893 (Div. 2) Editorial | 1000 |
| 3185 | Trees and Segments | binary search brute force constructive algorithms data structures dp greedy two pointers | Statement | D | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 2000.0 | Codeforces Round #893 (Div. 2) Editorial | 2200 |
| 53915 | United We Stand | constructive algorithms graphs math | Statement | A | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 500.0 | Video solutions from Geothermal. | |
| 43578 | Olya and Game with Arrays | constructive algorithms greedy math sortings | Statement | B | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1000.0 | Video solutions from Geothermal. | |
| 3588 | Balanced String | bitmasks constructive algorithms dp | Statement | D | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 23528 | Not a Substring | constructive algorithms dp strings | Statement | A | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 23970 | Two Binary Strings | constructive algorithms dfs and similar greedy | Statement | B | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 25897 | Prime Deletion | constructive algorithms implementation | Statement | A | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 19775 | Ice Cream Balls | binary search combinatorics constructive algorithms math | Statement | D | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 54477 | Sequence Game | constructive algorithms | Statement | B | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 12750 | Kolya and Movie Theatre | constructive algorithms data structures greedy | Statement | E | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 127 | Redundant Routes | constructive algorithms dp trees | Statement | I | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 4000.0 | ||
| 10750 | Two-Colored Dominoes | constructive algorithms greedy | Statement | D | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 1250.0 | ||
| 3035 | Guess Game | bitmasks combinatorics constructive algorithms data structures games math probabilities strings trees | Statement | E | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 2000.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 15261 | Divisor Chain | bitmasks constructive algorithms math number theory | Statement | C | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1250.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 7614 | Matrix Cascade | brute force constructive algorithms dp greedy | Statement | D | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 315 | Magic Square | combinatorics constructive algorithms | Statement | G | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 3000.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 21401 | Increasing and Decreasing | constructive algorithms implementation math | Statement | A | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 18611 | XOR Palindromes | bitmasks constructive algorithms strings | Statement | B | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1000.0 | ||
| 508 | Most Different Tree | brute force constructive algorithms dfs and similar greedy hashing | Statement | F | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 4000.0 | ||
| 12654 | Salyg1n and the MEX Game | constructive algorithms data structures games greedy interactive | Statement | C | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1250.0 | ||
| 6863 | Cyclic Operations | constructive algorithms dfs and similar graphs greedy implementation | Statement | D | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.0 | ||
| 4323 | Salyg1n and Array (simple version) | constructive algorithms interactive math | Statement | E1 | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.0 | ||
| 3747 | Salyg1n and Array (hard version) | constructive algorithms interactive math | Statement | E2 | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1000.0 | ||
| 21135 | green_gold_dog, array and permutation | constructive algorithms sortings | Statement | A | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 500.0 | ||
| 2739 | Candy Party (Hard Version) | bitmasks constructive algorithms dp graphs greedy implementation math | Statement | B2 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 8299 | Candy Party (Easy Version) | bitmasks constructive algorithms graphs greedy implementation math | Statement | B1 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 373 | Flower-like Pseudotree | constructive algorithms graphs implementation trees | Statement | D | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 1750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 13594 | Fill in the Matrix | constructive algorithms implementation | Statement | A | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 39714 | Make It Zero | constructive algorithms | Statement | A | Codeforces Round 896 (Div. 2) {1869} | PROGRAMMING | 500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 20190 | MEXanized Array | constructive algorithms greedy math | Statement | A | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 500.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 2712 | Autosynthesis | 2-sat constructive algorithms dfs and similar dp flows graphs trees | Statement | C | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 1250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 344 | Ball-Stackable | constructive algorithms data structures dp trees | Statement | E | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 2250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 34164 | Aleksa and Stack | constructive algorithms math | Statement | B | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 1565 | Interactive Game with Coloring | brute force constructive algorithms graphs implementation interactive math trees | Statement | E | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 2400 | |
| 25033 | Chips on the Board | constructive algorithms greedy | Statement | B | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 900 | |
| 17390 | Sets and Union | bitmasks brute force constructive algorithms greedy | Statement | B | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 1000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 1209 | Two Permutations (Easy Version) | brute force constructive algorithms greedy number theory | Statement | E1 | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 353 | Two Permutations (Hard Version) | constructive algorithms | Statement | E2 | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 19131 | Simple Design | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 500.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 27682 | Sum of Three | brute force constructive algorithms math | Statement | A | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 16463 | Decreasing String | constructive algorithms strings | Statement | C | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 492 | Good Colorings | binary search constructive algorithms graphs interactive | Statement | E | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 2000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 243 | Minimum Segments | constructive algorithms | Statement | F | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 2750.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 2272 | Minimum Array | constructive algorithms data structures two pointers | Statement | C | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 1000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 15269 | Qingshan Loves Strings 2 | constructive algorithms greedy | Statement | A | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 750.0 | Codeforces Round 906 Editorial | |
| 56379 | Doremy's Paint 3 | constructive algorithms | Statement | A | Codeforces Round 906 (Div. 2) {1890} | PROGRAMMING | 500.0 | Codeforces Round 906 Editorial | |
| 20201 | Smilo and Monsters | constructive algorithms greedy sortings two pointers | Statement | C | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 1000.0 | ||
| 20514 | Sorting with Twos | constructive algorithms sortings | Statement | A | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 500.0 | ||
| 1086 | Colorful Constructive | constructive algorithms greedy math | Statement | D | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 2250.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 11409 | Neutral Tonality | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 1000.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 18077 | Two Out of Three | constructive algorithms | Statement | B | Codeforces Round 908 (Div. 2) {1894} | PROGRAMMING | 750.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 7109 | XOR Construction | bitmasks constructive algorithms data structures math trees | Statement | D | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 11571 | Matching Arrays | binary search constructive algorithms greedy sortings | Statement | C | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 1500.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 955 | Bracket Xoring | constructive algorithms implementation | Statement | F | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 2750.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 409 | Pepe Racing | constructive algorithms interactive sortings | Statement | G | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 3250.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 6493 | Colorful Grid | constructive algorithms implementation | Statement | C | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 1750.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 9487 | Alex's whims | constructive algorithms graphs shortest paths trees | Statement | F | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 2626 | Transitive Graph | constructive algorithms dfs and similar dp graphs implementation | Statement | E | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 2250.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 63269 | Cover in Water | constructive algorithms implementation | Statement | A | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 500.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 14198 | Add, Divide and Floor | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 16915 | Insert and Equalize | brute force constructive algorithms greedy math number theory | Statement | C | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 23233 | Binary Imbalance | constructive algorithms | Statement | A | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 14805 | StORage room | bitmasks brute force constructive algorithms greedy | Statement | B | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1000.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 2503 | Geo Game | constructive algorithms dp games greedy interactive math | Statement | E | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 2250.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 14426 | Theofanis' Nightmare | constructive algorithms dp greedy | Statement | C | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 5666 | Set To Max (Hard Version) | binary search constructive algorithms data structures dsu greedy implementation sortings two pointers | Statement | D2 | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 8586 | Set To Max (Easy Version) | brute force constructive algorithms greedy | Statement | D1 | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 1250.0 | Codeforces Round 914 (Div. 2) Editorial |