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 |
|---|---|---|---|---|---|---|---|---|---|
| 179 | Dogecoin | *special *special binary search data structures | Statement | F | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 61 | Physical Examination | *special binary search data structures | Statement | I | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 95 | Sum of Digits of Sums | *special binary search data structures | Statement | H | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 |