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 949 / 994 800
Minimum maximum 884 / 933 800
Beautiful number 868 / 920 1000
Multiplication table 706 / 729 1000
k-th digit 566 / 616 1000
Maximum mean 514 / 607 1200
Birthday 408 / 440 1200
Sorting the differences 406 / 426 1300
Collecting 377 / 403 1400