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 |
---|---|---|---|---|---|---|---|---|---|
1862 | Selling Souvenirs | binary search dp greedy ternary search | Statement | E | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 2300 |