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 |
|---|---|---|---|---|---|---|---|---|---|
| 19235 | Divisible Pairs | combinatorics data structures hashing math | Statement | D | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 |