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 788 / 830 800
Minimum maximum 739 / 787 800
Beautiful number 725 / 776 1000
Multiplication table 593 / 613 1000
k-th digit 495 / 538 1000
Maximum mean 429 / 514 1200
Birthday 349 / 379 1200
Sorting the differences 343 / 363 1300
Collecting 322 / 345 1400