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 1018 / 1065 800
Minimum maximum 945 / 994 800
Beautiful number 915 / 969 1000
Multiplication table 747 / 771 1000
k-th digit 605 / 655 1000
Maximum mean 547 / 644 1200
Birthday 441 / 475 1200
Sorting the differences 439 / 460 1300
Collecting 402 / 427 1400