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 696 / 732 800
Minimum maximum 652 / 695 800
Beautiful number 638 / 682 1000
Multiplication table 513 / 531 1000
k-th digit 430 / 467 1000
Maximum mean 365 / 441 1200
Birthday 305 / 330 1200
Sorting the differences 300 / 318 1300
Collecting 278 / 299 1400