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 265 / 289 800
Minimum maximum 252 / 273 800
Beautiful number 235 / 255 1000
Multiplication table 185 / 193 1000
k-th digit 172 / 195 1000
Maximum mean 119 / 153 1200
Birthday 104 / 115 1200
Sorting the differences 98 / 106 1300
Collecting 95 / 108 1400