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 793 / 835 800
Minimum maximum 744 / 792 800
Beautiful number 730 / 781 1000
Multiplication table 596 / 616 1000
k-th digit 496 / 540 1000
Maximum mean 433 / 518 1200
Birthday 350 / 380 1200
Sorting the differences 346 / 367 1300
Collecting 326 / 349 1400