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 |
|---|---|---|---|---|---|---|---|---|---|
| 245 | Maximum GCD Sum Queries | bitmasks brute force dp implementation number theory | Statement | F | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #945 (Div. 2) | 3100 |