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 1229 / 1280 800
Minimum maximum 1130 / 1184 800
Beautiful number 1067 / 1125 1000
Multiplication table 895 / 921 1000
k-th digit 693 / 750 1000
Maximum mean 623 / 723 1200
Birthday 504 / 538 1200
Sorting the differences 510 / 533 1300
Collecting 456 / 481 1400