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 |
|---|---|---|---|---|---|---|---|---|---|
| 4804 | Planets | binary search data structures graphs shortest paths | Statement | B | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | 1900 |