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 |
---|---|---|---|---|---|---|---|---|---|
2431 | Two Different | bitmasks constructive algorithms divide and conquer greedy | Statement | F | Grakn Forces 2020 {1408} | PROGRAMMING | 2500.0 | Grakn Forces -- Editorial | |
4493 | Nearest Beautiful Number (hard version) | bitmasks brute force constructive algorithms dfs and similar dp greedy | Statement | F2 | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 2100 | |
17854 | MAX-MEX Cut | bitmasks constructive algorithms dp greedy | Statement | C | Codeforces Global Round 16 {1566} | PROGRAMMING | 1000.0 | Codeforces Global Round 16 Editorial | |
11903 | Even-Odd XOR | bitmasks constructive algorithms greedy | Statement | G | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1500 | |
7628 | SlavicG's Favorite Problem | bitmasks brute force constructive algorithms data structures dfs and similar graphs greedy | Statement | G | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
15869 | Sets and Union | bitmasks brute force constructive algorithms greedy | Statement | B | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 1000.0 | Codeforces Round 899 (Div. 2) Editorial | |
13243 | StORage room | bitmasks brute force constructive algorithms greedy | Statement | B | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1000.0 | Codeforces Round #912 (Div. 2) Editorial | |
3624 | XOR Break --- Solo Version | bitmasks constructive algorithms greedy | Statement | D1 | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1500.0 | Tutorial | |
17397 | Increasing Sequence with Fixed OR | bitmasks constructive algorithms greedy | Statement | C | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 958 (Div. 2) | |
16880 | AND Reconstruction | bitmasks constructive algorithms greedy | Statement | B | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 500.0 | Video Tutorial |