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 389 / 414 800
Minimum maximum 363 / 391 800
Beautiful number 360 / 392 1000
Multiplication table 280 / 292 1000
k-th digit 239 / 270 1000
Maximum mean 177 / 230 1200
Birthday 153 / 169 1200
Sorting the differences 151 / 165 1300
Collecting 138 / 154 1400