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 |
|---|---|---|---|---|---|---|---|---|---|
| 455 | Appleman and a Game | binary search shortest paths strings | Statement | E | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 3000 |