Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 5147 | GameGame | bitmasks constructive algorithms dp games greedy math | Statement | B | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 3591 | Omkar and Duck | bitmasks constructive algorithms interactive math | Statement | E | Codeforces Global Round 10 {1392} | PROGRAMMING | 2000.0 | Codeforces Global Round 10 — Editorial | |
| 521 | Omkar and Pies | bitmasks dfs and similar dp math | Statement | G | Codeforces Global Round 10 {1392} | PROGRAMMING | 3000.0 | Codeforces Global Round 10 — Editorial | |
| 27036 | Rock and Lever | bitmasks math | Statement | B | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1000.0 | Editorial | |
| 30242 | XORwice | bitmasks greedy math | Statement | A | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 500.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 734 | Yet Another DAG Problem | bitmasks dp flows math | Statement | G | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 4480 | Bitwise Queries (Easy Version) | bitmasks constructive algorithms interactive math | Statement | E1 | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1500.0 | Editorial — Codeforces Round #685 | |
| 3046 | Bitwise Queries (Hard Version) | bitmasks constructive algorithms interactive math | Statement | E2 | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1000.0 | Editorial — Codeforces Round #685 | |
| 7440 | Apollo versus Pan | bitmasks math | Statement | E | Good Bye 2020 {1466} | PROGRAMMING | 1500.0 | Good Bye 2020 Editorial | |
| 7303 | Zookeeper and The Infinite Zoo | bitmasks constructive algorithms math | Statement | D | Codeforces Global Round 13 {1491} | PROGRAMMING | 1250.0 | Codeforces Global Round 13 Editorial | |
| 6201 | Genius's Gambit | bitmasks constructive algorithms math | Statement | D | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 2250.0 | Codeforces Round #704 Editorial | |
| 26320 | AND 0, Sum Big | bitmasks combinatorics math | Statement | B | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 1000.0 | Codeforces round #716 editorial | |
| 12156 | Baby Ehab Partitions Again | bitmasks constructive algorithms dp math | Statement | C | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 1500.0 | Codeforces round #717 editorial | |
| 7682 | 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 | |
| 7169 | Array Differentiation | bitmasks dp graphs math | Statement | D | Codeforces Global Round 15 {1552} | PROGRAMMING | 1000.0 | Editorial of Global Round 15 | |
| 12974 | Cobb | bitmasks brute force greedy math | Statement | B | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #735 (Div. 2) | 1700 |
| 7197 | 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 |
| 8764 | Moamen and XOR | bitmasks combinatorics dp math | Statement | C | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 1750.0 | Codeforces Round #737 Editorial | |
| 32930 | Mocha and Math | bitmasks constructive algorithms math | Statement | A | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 500.0 | Tutorial (en) | 900 |
| 20285 | Special Numbers | bitmasks math | Statement | B | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1000.0 | 95525 | 1100 |
| 10420 | Divan and bitwise operations | bitmasks combinatorics constructive algorithms dp math | Statement | C | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 1500 |
| 16349 | And It's Non-Zero | bitmasks greedy math | Statement | B | Codeforces Global Round 18 {1615} | PROGRAMMING | 1000.0 | Global Round 18 Editorial | |
| 1001 | Keep XOR Low | bitmasks combinatorics divide and conquer dp math | Statement | H | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 4000.0 | Good Bye 2021 -- Editorial | 3000 |
| 945 | Subsequences Galore | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 17413 | Ancient Civilization | bitmasks greedy math | Statement | A | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 17342 | Fortune Telling | bitmasks math | Statement | B | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 1250.0 | Codeforces Round #770 (Div. 2) editorial | |
| 14751 | 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 |
| 2618 | 388535 (Hard Version) | bitmasks brute force data structures math | Statement | D2 | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 750.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 9261 | 388535 (Easy Version) | bitmasks data structures math | Statement | D1 | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 1250.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 20148 | Maximal AND | bitmasks greedy math | Statement | H | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1300 | |
| 864 | 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 | |
| 582 | Formalism for Formalism | bitmasks dp math | Statement | F | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 3000.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 11115 | Good Key, Bad Key | bitmasks brute force dp greedy math | Statement | G | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 557 | 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 |
| 15556 | 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 | |
| 839 | Zeros and Ones | bitmasks divide and conquer dp math | Statement | F | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 3250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 11259 | Orray | bitmasks brute force greedy math | Statement | G | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 263 | Antifibonacci Cut | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 3000 | |
| 2505 | Carry Bit | bitmasks brute force combinatorics dp math | Statement | D | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1750.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 15934 | 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 | |
| 727 | Koxia and Sequence | bitmasks combinatorics math | Statement | F | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 2500.0 | Good Bye 2022 -- Editorial | |
| 2412 | 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 | |
| 1219 | XOR Counting | bitmasks combinatorics dp math | Statement | D | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #865 | 2600 |
| 8104 | Don't Blame Me | bitmasks combinatorics dp math | Statement | H | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1700 | |
| 22878 | Binary Cafe | bitmasks combinatorics math | Statement | B | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 17955 | Tenzing and Books | bitmasks greedy math | Statement | B | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 500.0 | CodeTON Round 5 Editorial | |
| 2473 | 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 | |
| 7225 | 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 | |
| 14531 | Friendly Arrays | bitmasks greedy math | Statement | B | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 750.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 1840 | Yet Another Inversions Problem | bitmasks combinatorics data structures math | Statement | D | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 14557 | XOR-distance | bitmasks dp greedy implementation math | Statement | C | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 1250.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 7965 | Increasing Subsequences | bitmasks constructive algorithms math | Statement | E | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 1003 | Turtle Magic: Royal Turtle Shell Pattern | bitmasks brute force combinatorics math | Statement | G | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 7719 | Bitwise Operation Wizard | bitmasks constructive algorithms greedy interactive math | Statement | A | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 500.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 4664 | A BIT of an Inequality | bitmasks brute force dp math | Statement | D | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1750.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 1900 |
| 869 | Set | bitmasks brute force combinatorics dfs and similar divide and conquer dp math | Statement | F | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 2500.0 | editorial_zh.pdf | 2600 |
| 18094 | Binary Colouring | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1250.0 | 129858 | 1100 |
| 5520 | Turtle and an Incomplete Sequence | bitmasks constructive algorithms greedy implementation math | Statement | C | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 1500.0 | Simplified Chinese Tutorial | |
| 14219 | Turtle and an Infinite Sequence | bitmasks math | Statement | B | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 1000.0 | Simplified Chinese Tutorial | |
| 1304 | Minecraft | bitmasks brute force dp math | Statement | G | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2750.0 | Video Tutorial | |
| 17160 | Fun Game | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 22684 | Find Minimum Operations | bitmasks greedy math | Statement | A | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 500.0 | ||
| 15155 | Bitwise Balancing | bitmasks implementation math | Statement | C | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 1250.0 | ||
| 162 | Bit Game (Easy Version) | bitmasks brute force games math | Statement | E1 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 2000.0 | ||
| 66 | Bit Game (Hard Version) | bitmasks dp math | Statement | E2 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1000.0 | ||
| 16 | Kevin and Puzzle (Hard Version) | bitmasks fft math | Statement | I2 | Codeforces Global Round 28 {2048} | PROGRAMMING | 3000.0 | ||
| 9139 | Bewitching Stargazer | bitmasks divide and conquer dp math | Statement | C | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1250.0 | ||
| 81 | Xor of Median (Easy Version) | bitmasks combinatorics dp math | Statement | F1 | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 2750.0 | ||
| 9987 | Trip to the Olympiad | bitmasks constructive algorithms greedy math | Statement | C | Hello 2025 {2057} | PROGRAMMING | 1500.0 |