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 |
|---|---|---|---|---|---|---|---|---|---|
| 12974 | Cobb | bitmasks brute force greedy math | Statement | B | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #735 (Div. 2) | 1700 |
| 11115 | Good Key, Bad Key | bitmasks brute force dp greedy math | Statement | G | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 11259 | Orray | bitmasks brute force greedy math | Statement | G | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 |