Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 135 | Wheels | *special binary search greedy | Statement | F | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 216 | Double Permutation Inc. | *special binary search greedy | Statement | E | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2200 | |
| 252 | Teams | *special binary search greedy math | Statement | D | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2200 | |
| 274 | Bonus Distribution | *special binary search greedy sortings | Statement | D | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 161 | Neural Network Problem | *special binary search greedy | Statement | F | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 360 | Problemsolving Marathon | *special binary search greedy | Statement | D | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 285 | Chess Team Forming | *special binary search data structures greedy | Statement | E | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 224 | Binary String Partition | *special binary search greedy | Statement | F | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 179 | Supersequence | *special binary search greedy | Statement | E | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 |