- 1887A1 - Танцы (простая версия): binary search
- 1887A2 - Танцы (сложная версия): binary search
- 1887B - Путешествия во времени: binary search
- 1887C - Минимальный массив: binary search
- 1887D - Разрез: binary search
- 1887E - Хорошие раскраски: binary search
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