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 |
|---|---|---|---|---|---|---|---|---|---|
| 585 | Startup Funding | binary search constructive algorithms data structures probabilities two pointers | Statement | E | Manthan, Codefest 16 {633} | PROGRAMMING | 2400 |