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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 |
| 32930 | Mocha and Math | bitmasks constructive algorithms math | Statement | A | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 500.0 | Tutorial (en) | 900 |
| 10420 | Divan and bitwise operations | bitmasks combinatorics constructive algorithms dp math | Statement | C | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 1500 |
| 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 |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 7965 | Increasing Subsequences | bitmasks constructive algorithms math | Statement | E | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 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 | |
| 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 | |
| 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 | |
| 9987 | Trip to the Olympiad | bitmasks constructive algorithms greedy math | Statement | C | Hello 2025 {2057} | PROGRAMMING | 1500.0 |