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 |
|---|---|---|---|---|---|---|---|---|---|
| 3603 | Mahmoud and a xor trip | bitmasks constructive algorithms data structures dfs and similar dp math trees | Statement | E | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 2200 | |
| 5591 | GameGame | bitmasks constructive algorithms dp games greedy math | Statement | B | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 4497 | 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 | |
| 14479 | Baby Ehab Partitions Again | bitmasks constructive algorithms dp math | Statement | C | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 1500.0 | Codeforces round #717 editorial | |
| 11433 | Divan and bitwise operations | bitmasks combinatorics constructive algorithms dp math | Statement | C | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 1500 |
| 782 | 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 |
| 2808 | 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 | |
| 1132 | Infinite Sequence (Hard Version) | bitmasks constructive algorithms data structures dp implementation math | Statement | D2 | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1250.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 2056 | Interactive RBS (Hard Version) | binary search bitmasks constructive algorithms dp interactive | Statement | C3 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 750.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 6738 | XOR-factorization | bitmasks constructive algorithms dp greedy number theory | Statement | C | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 1500.0 | Codeforces Global Round 31 | |
| 1422 | Product of Closures | bitmasks brute force constructive algorithms dp greedy implementation math | Statement | E | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 |