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 1030 / 1077 800
Minimum maximum 954 / 1004 800
Beautiful number 918 / 973 1000
Multiplication table 753 / 778 1000
k-th digit 607 / 657 1000
Maximum mean 553 / 652 1200
Birthday 446 / 481 1200
Sorting the differences 447 / 469 1300
Collecting 411 / 436 1400