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 693 / 729 800
Minimum maximum 650 / 693 800
Beautiful number 637 / 681 1000
Multiplication table 512 / 530 1000
k-th digit 429 / 466 1000
Maximum mean 363 / 437 1200
Birthday 304 / 329 1200
Sorting the differences 299 / 317 1300
Collecting 278 / 299 1400