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 |
|---|---|---|---|---|---|---|---|---|---|
| 364 | GCD Master (easy version) | greedy math number theory sortings | Statement | F1 | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2500.0 | Codeforces Round #858 (Div. 2) Editorial |