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 |
---|---|---|---|---|---|---|---|---|---|
5684 | XOR-gun | bitmasks brute force constructive algorithms | Statement | D | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
4314 | Powerful Ksenia | bitmasks constructive algorithms | Statement | D | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 1750.0 | Codeforces Round #682 (Div. 2) Editorial | |
1371 | Continuous City | bitmasks constructive algorithms | Statement | C | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #700 | |
16095 | AND Sequences | bitmasks combinatorics constructive algorithms | Statement | B | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 1250.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
15215 | And Matching | bitmasks constructive algorithms | Statement | A | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #768 | |
24492 | Roof Construction | bitmasks constructive algorithms | Statement | B | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #769 | |
22250 | Cirno's Perfect Bitmasks Classroom | bitmasks brute force constructive algorithms | Statement | A | Codeforces Round 796 (Div. 2) {1688} | PROGRAMMING | 500.0 | Tutorial | |
353 | Circular Xor Reversal | bitmasks constructive algorithms | Statement | F | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 2750.0 | Codeforces Round #833 (Div. 2) Editorial | 3000 |
15762 | Gardener and the Array | bitmasks constructive algorithms | Statement | B | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 1000.0 | Codeforces Round #843 (Div. 2) Editorial | |
16051 | Vlad and a Pair of Numbers | bitmasks constructive algorithms | Statement | E | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
9122 | The Very Beautiful Blanket | bitmasks constructive algorithms | Statement | A | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 500.0 | Codeforces Round #857 Editorial | |
17016 | Equal XOR | bitmasks constructive algorithms | Statement | B | Codeforces Round 934 (Div. 2) {1944} | PROGRAMMING | 1000.0 | Codeforces Round #934 (Div1, Div2) Editorial |