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 817 / 858 800
Minimum maximum 767 / 815 800
Beautiful number 751 / 802 1000
Multiplication table 617 / 637 1000
k-th digit 510 / 556 1000
Maximum mean 447 / 533 1200
Birthday 359 / 389 1200
Sorting the differences 359 / 381 1300
Collecting 335 / 359 1400