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 1010 / 1057 800
Minimum maximum 942 / 991 800
Beautiful number 911 / 966 1000
Multiplication table 743 / 767 1000
k-th digit 602 / 653 1000
Maximum mean 545 / 641 1200
Birthday 438 / 472 1200
Sorting the differences 438 / 459 1300
Collecting 401 / 426 1400