- 1887A1 - Dances (Easy version): binary search
- 1887A2 - Dances (Hard Version): binary search
- 1887B - Time Travel: binary search
- 1887C - Minimum Array: binary search
- 1887D - Split: binary search
- 1887E - Good Colorings: binary search
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
| Name |
|---|



I don't know if this is complaining but binary search is an important technique in cp and might be seen in many problems. Also A1A2B don't need a complicated binary search, only finding a lower bound in an array so you can't consider the problem binary search
Still Binary Search ¯\_(ツ)_/¯
Well yeah, but it's so simple use of it. It's even doable with sets
No, I'm not complaining (the contest was really good!), it's just a fun fact.
After SpeedForces, MathForces,... now we have BinarySearchForces