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

After SpeedForces, MathForces,... now we have BinarySearchForces