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 |
|---|---|---|---|---|---|---|---|---|---|
| 1010 | Comfortably Numb | binary search bitmasks data structures divide and conquer ds strings trees two pointers | Statement | F | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2750.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 1712 | Max to the Right of Min | binary search data structures divide and conquer ds two pointers | Statement | E | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 |