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 406 / 432 800
Minimum maximum 386 / 416 800
Beautiful number 390 / 423 1000
Multiplication table 299 / 311 1000
k-th digit 265 / 297 1000
Maximum mean 205 / 260 1200
Birthday 172 / 188 1200
Sorting the differences 163 / 182 1300
Collecting 157 / 173 1400