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 |
|---|---|---|---|---|---|---|---|---|---|
| 157 | Verifying Kingdom | binary search divide and conquer interactive trees | Statement | E | VK Cup 2017 - Round 2 {772} | PROGRAMMING | 3200 | ||
| 453 | Legendary Tree | binary search interactive trees | Statement | E | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 3000 | |
| 154 | Strange device | binary search interactive math trees | Statement | E | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 3300 |