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 579 / 615 800
Minimum maximum 548 / 587 800
Beautiful number 542 / 584 1000
Multiplication table 423 / 441 1000
k-th digit 361 / 397 1000
Maximum mean 297 / 368 1200
Birthday 244 / 269 1200
Sorting the differences 244 / 261 1300
Collecting 225 / 245 1400