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 |
|---|---|---|---|---|---|---|---|---|---|
| 273 | Bitonix' Patrol | bitmasks brute force combinatorics dfs and similar math | Statement | D | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 2800 | |
| 1651 | Table | bitmasks combinatorics dp math | Statement | B | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2200 | |
| 4555 | 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 | |
| 2871 | Random Task | binary search bitmasks combinatorics dp math | Statement | D | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2200 | |
| 36817 | Dreamoon and WiFi | bitmasks brute force combinatorics dp math probabilities | Statement | B | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | 1300 | ||
| 3383 | Mike and Foam | bitmasks combinatorics dp math number theory | Statement | C | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2700 | |
| 7300 | Square Subsets | bitmasks combinatorics dp math | Statement | C | Codeforces Round 448 (Div. 2) {895} | PROGRAMMING | Codeforces Round #448(Div.2) Editorial | 2000 | |
| 3771 | Unusual Sequences | bitmasks combinatorics dp math number theory | Statement | D | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 2100 | |
| 836 | New Year and Entity Enumeration | bitmasks combinatorics dp math | Statement | E | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 2400 | |
| 1980 | List Of Integers | binary search bitmasks brute force combinatorics math number theory | Statement | G | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2300 | |
| 1037 | Pave the Parallelepiped | bitmasks brute force combinatorics math number theory | Statement | B | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 2400 | |
| 2981 | 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 | |
| 3540 | Segment Sum | bitmasks combinatorics dp math | Statement | E | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2300 | |
| 528 | 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 |
| 7049 | 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 |
| 826 | Chiori and Doll Picking (easy version) | bitmasks brute force combinatorics math | Statement | E1 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1750.0 | Codeforces Round #635 Editorial | 2600 |
| 480 | Chiori and Doll Picking (hard version) | bitmasks brute force combinatorics math | Statement | E2 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1500.0 | Codeforces Round #635 Editorial | 3400 |
| 1413 | Secure Password | bitmasks combinatorics constructive algorithms interactive math | Statement | G | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 3000.0 | Editorial — Codeforces Round #648 | 2800 |
| 1152 | Mercenaries | bitmasks combinatorics data structures math two pointers | Statement | G | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 4414 | 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 | |
| 34691 | AND 0, Sum Big | bitmasks combinatorics math | Statement | B | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 1000.0 | Codeforces round #716 editorial | |
| 1415 | 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 |
| 10459 | Moamen and XOR | bitmasks combinatorics dp math | Statement | C | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 1750.0 | Codeforces Round #737 Editorial | |
| 11282 | Divan and bitwise operations | bitmasks combinatorics constructive algorithms dp math | Statement | C | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 1500 |
| 1228 | 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 |
| 1153 | Subsequences Galore | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 681 | 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 |
| 304 | Antifibonacci Cut | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 3000 | |
| 7334 | 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 | |
| 2760 | 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 | |
| 941 | Koxia and Sequence | bitmasks combinatorics math | Statement | F | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 2500.0 | Good Bye 2022 -- Editorial | |
| 1488 | XOR Counting | bitmasks combinatorics dp math | Statement | D | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #865 | 2600 |
| 10723 | Don't Blame Me | bitmasks combinatorics dp math | Statement | H | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1700 | |
| 24668 | Binary Cafe | bitmasks combinatorics math | Statement | B | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 2028 | Vika and Wiki | binary search bitmasks combinatorics math | Statement | F | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 2750.0 | Codeforces Round #885 (Div.2) Editorial | |
| 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 | |
| 4169 | 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 | |
| 2065 | 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) | |
| 1177 | 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 | ||
| 2227 | Fenwick Tree | bitmasks brute force combinatorics data structures dp math trees | Statement | C | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1250.0 | Tutorial | 2300 |
| 1035 | 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 |
| 1895 | 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 | |
| 12165 | D-Function | bitmasks combinatorics math number theory | Statement | G | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 435 | 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 | |
| 2444 | Bitwise Slides | bitmasks combinatorics dp math | Statement | C | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 1250.0 | 139415 | |
| 8401 | Goodbye, Banker Life | bitmasks combinatorics constructive algorithms math number theory | Statement | F | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 222 | 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 | |
| 2292 | Sakura Adachi and Optimal Sequences | bitmasks combinatorics greedy math | Statement | G | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 2734 | AND-array | bitmasks combinatorics math | Statement | D | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 2000.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 589 | Interval Game | bitmasks combinatorics dp games greedy math probabilities | Statement | F | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2750.0 |