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 951 / 996 800
Minimum maximum 887 / 936 800
Beautiful number 873 / 925 1000
Multiplication table 711 / 734 1000
k-th digit 574 / 624 1000
Maximum mean 520 / 614 1200
Birthday 416 / 448 1200
Sorting the differences 414 / 434 1300
Collecting 381 / 407 1400