Module Binary search on answer

Binary search on answer

**Frequency: 6/10** Optimization problems are always hard (.i.e finding the best solution best solution from all feasible solutions) but checking if a value is a solution for a problem is way easier. Therefore, we use binary search to determine the answer.

Resources

- [USACO Guide: Binary search](https://usaco.guide/silver/binary-search?lang=cpp)

Problems

Reading 379 / 404 800
Minimum maximum 354 / 382 800
Beautiful number 352 / 382 1000
Multiplication table 270 / 281 1000
k-th digit 228 / 258 1000
Maximum mean 171 / 224 1200
Birthday 151 / 166 1200
Sorting the differences 146 / 159 1300
Collecting 134 / 149 1400