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 |
|---|---|---|---|---|---|---|---|---|---|
| 777 | DZY Loves Planting | binary search ds trees | Statement | E | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2600 | |
| 682 | Campus | binary search data structures ds trees | Statement | D | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 3000 | |
| 1857 | Cheap Robot | binary search ds graphs shortest paths trees | Statement | F | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 2600 |