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
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1685 | Table | bitmasks combinatorics dp math | Statement | B | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2200 | |
| 1694 | Permutation Sum | bitmasks combinatorics dp implementation meet-in-the-middle | Statement | D | Codeforces Round 175 (Div. 2) {285} | PROGRAMMING | Codeforces Round #175 (Div. 2) Tutorial | 1900 | |
| 1597 | Axis Walking | bitmasks combinatorics constructive algorithms dp meet-in-the-middle | Statement | E | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | Codeforces Round #191 — Tutorial | 2500 | |
| 153 | Vasily the Bear and Painting Square | bitmasks combinatorics dp implementation | Statement | E | Codeforces Round 195 (Div. 2) {336} | PROGRAMMING | Tutorial Codeforces Round #195 (Div. 2) | 2600 | |
| 4609 | Roman and Numbers | bitmasks brute force combinatorics dp number theory | Statement | D | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 2000 | |
| 2900 | Random Task | binary search bitmasks combinatorics dp math | Statement | D | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2200 | |
| 6228 | Jzzhu and Numbers | bitmasks combinatorics dp | Statement | D | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2400 | |
| 37422 | Dreamoon and WiFi | bitmasks brute force combinatorics dp math probabilities | Statement | B | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | 1300 | ||
| 26819 | Tavas and SaDDas | bitmasks brute force combinatorics implementation | Statement | B | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 1100 | |
| 3446 | Mike and Foam | bitmasks combinatorics dp math number theory | Statement | C | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2700 | |
| 527 | New Year and Binary Tree Paths | bitmasks brute force combinatorics dp | Statement | G | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 3100 | |
| 368 | Sherlock and the Encrypted Data | bitmasks combinatorics dp | Statement | G | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 2800 | |
| 7460 | Square Subsets | bitmasks combinatorics dp math | Statement | C | Codeforces Round 448 (Div. 2) {895} | PROGRAMMING | Codeforces Round #448(Div.2) Editorial | 2000 | |
| 3830 | Unusual Sequences | bitmasks combinatorics dp math number theory | Statement | D | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 2100 | |
| 839 | New Year and Entity Enumeration | bitmasks combinatorics dp math | Statement | E | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 2400 | |
| 3032 | Make It One | bitmasks combinatorics dp math number theory shortest paths | Statement | F | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 2500 | |
| 3651 | Segment Sum | bitmasks combinatorics dp math | Statement | E | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2300 | |
| 3213 | Playlist for Polycarp (easy version) | bitmasks combinatorics dp | Statement | G1 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2100 | |
| 883 | Graph And Numbers | bitmasks brute force combinatorics dp meet-in-the-middle | Statement | G | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 2900 | |
| 2275 | Daniel and Spring Cleaning | bitmasks brute force combinatorics dp | Statement | F | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 2300 | |
| 372 | Nora's Toy Boxes | bitmasks combinatorics dp | Statement | F | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 2750.0 | Codeforces Round #614 Editorial | 3400 |
| 530 | Around the World | bitmasks combinatorics dfs and similar dp graphs graphs math trees | Statement | D | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1750.0 | Codeforces Round #618 Editorial | 2900 |
| 2063 | AND Segments | bitmasks combinatorics data structures dp two pointers | Statement | F | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2500 | |
| 7165 | Dreamoon Likes Sequences | bitmasks combinatorics dp math | Statement | B | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 750.0 | Codeforces Round #631 Editorial | 1900 |
| 4470 | Almost Sorted | binary search bitmasks combinatorics constructive algorithms dp implementation math | Statement | B | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1000.0 | Codeforces Round #715 Editorial | |
| 1429 | Sports Betting | bitmasks combinatorics dp graphs math probabilities | Statement | F | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 2500.0 | 94384 | 2500 |
| 10715 | Moamen and XOR | bitmasks combinatorics dp math | Statement | C | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 1750.0 | Codeforces Round #737 Editorial | |
| 13202 | Carrying Conundrum | bitmasks combinatorics dp | Statement | C | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 1500.0 | Codeforces Round #742 Editorial | |
| 11353 | Divan and bitwise operations | bitmasks combinatorics constructive algorithms dp math | Statement | C | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 1500 |
| 1249 | 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 |
| 1166 | Subsequences Galore | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1281 | Jee, You See? | bitmasks combinatorics dp | Statement | F | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 3000.0 | Tutorial | 2400 |
| 1426 | Typical Party in Dorm | bitmasks brute force combinatorics dp strings two pointers | Statement | E | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 2250.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 691 | 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 |
| 305 | Antifibonacci Cut | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 3000 | |
| 7478 | Count GCD | bitmasks combinatorics dp math number theory | Statement | D | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 1750.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 2797 | 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 | |
| 4769 | Score of a Tree | bitmasks combinatorics dfs and similar dp probabilities trees | Statement | D | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2000.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 1509 | XOR Counting | bitmasks combinatorics dp math | Statement | D | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #865 | 2600 |
| 11019 | Don't Blame Me | bitmasks combinatorics dp math | Statement | H | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1700 | |
| 10804 | Sum of XOR Functions | bitmasks combinatorics dp | Statement | D | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 1700 | |
| 4321 | Kim's Quest | bitmasks combinatorics dp | Statement | K | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 1800 | |
| 2263 | Fenwick Tree | bitmasks brute force combinatorics data structures dp math trees | Statement | C | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1250.0 | Tutorial | 2300 |
| 1051 | 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 |
| 1914 | Number of k-good subarrays | bitmasks combinatorics divide and conquer dp math meet-in-the-middle | Statement | E | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 2500.0 | 130839 | |
| 2912 | Cases | bitmasks brute force combinatorics dfs and similar dp graphs greedy strings | Statement | D | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 2250.0 | Video Tutorial | |
| 111 | Message Spread | bitmasks combinatorics dp | Statement | H | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 5000.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 450 | Xor of Median (Easy Version) | bitmasks combinatorics dp math | Statement | F1 | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 2750.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 180 | Galaxy Generator | bitmasks combinatorics dp | Statement | H | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 4500.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 2543 | Bitwise Slides | bitmasks combinatorics dp math | Statement | C | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 1250.0 | 139415 | |
| 229 | Wonderful XOR Problem | bitmasks combinatorics dp fft math | Statement | H | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) {2096} | PROGRAMMING | 3500.0 | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial | |
| 2158 | Prime Gaming (Easy Version) | bitmasks combinatorics dp | Statement | E1 | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 1750.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 1258 | Prime Gaming (Hard Version) | bitmasks combinatorics dp probabilities | Statement | E2 | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 1000.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 1295 | Christmas Reindeer (easy version) | bitmasks combinatorics dp | Statement | F1 | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 1112 | Christmas Reindeer (hard version) | bitmasks combinatorics dp | Statement | F2 | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 835 | Interval Game | bitmasks combinatorics dp games greedy math probabilities | Statement | F | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2750.0 | Tutorial |