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 |
|---|---|---|---|---|---|---|---|---|---|
| 257 | Phoenix and Bits | bitmasks data structures | Statement | H | Codeforces Global Round 14 {1515} | PROGRAMMING | 4250.0 | Editorial | |
| 14615 | Data Structures Fan | bitmasks data structures | Statement | E | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 9018 | Alya and Permutation | bitmasks constructive algorithms data structures | Statement | C | Codeforces Global Round 27 {2035} | PROGRAMMING | 1000.0 | ||
| 208 | Xorderable Array | bitmasks data structures | Statement | J | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 2600 |