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 536 / 570 800
Minimum maximum 502 / 539 800
Beautiful number 500 / 543 1000
Multiplication table 395 / 413 1000
k-th digit 340 / 377 1000
Maximum mean 280 / 347 1200
Birthday 233 / 256 1200
Sorting the differences 226 / 244 1300
Collecting 215 / 235 1400