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 485 / 516 800
Minimum maximum 464 / 497 800
Beautiful number 461 / 502 1000
Multiplication table 361 / 377 1000
k-th digit 310 / 345 1000
Maximum mean 251 / 317 1200
Birthday 208 / 229 1200
Sorting the differences 198 / 216 1300
Collecting 183 / 202 1400