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 433 / 463 800
Minimum maximum 414 / 444 800
Beautiful number 417 / 452 1000
Multiplication table 328 / 339 1000
k-th digit 282 / 315 1000
Maximum mean 224 / 285 1200
Birthday 184 / 203 1200
Sorting the differences 178 / 196 1300
Collecting 166 / 183 1400