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 593 / 629 800
Minimum maximum 559 / 598 800
Beautiful number 552 / 596 1000
Multiplication table 431 / 449 1000
k-th digit 367 / 405 1000
Maximum mean 301 / 372 1200
Birthday 248 / 274 1200
Sorting the differences 248 / 265 1300
Collecting 229 / 249 1400