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 |
|---|---|---|---|---|---|---|---|---|---|
| 6128 | Devu and his Brother | binary search sortings ternary search two pointers | Statement | D | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 1900 | |
| 6145 | Match Points | binary search greedy sortings ternary search two pointers | Statement | C | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 2000 | |
| 5242 | Minimizing Difference | binary search constructive algorithms greedy sortings ternary search two pointers | Statement | E | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 2000 |