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 |
|---|---|---|---|---|---|---|---|---|---|
| 517 | Cutting a Fence | binary search data structures ds | Statement | D | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2400 | ||
| 8813 | Mike and Feet | binary search data structures dp ds | Statement | B | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2100 | |
| 1069 | Vasya and Maximum Profit | binary search constructive algorithms data structures dp ds | Statement | G | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 2400 | |
| 668 | Alice and the Unfair Game | binary search data structures dp ds | Statement | E | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2600 |