GoalA building has N floors. One of the floors is the highest floor an egg can be dropped from without breaking.
If an egg is dropped from above that floor, it will break. If it is dropped from that floor or below, it will be completely undamaged and you can drop the egg again.
You are given
An integer N for the number of floors.
The minimal number of drops in the worst case.
2 ≤ N ≤ 1000
A higher resolution is required to access the IDE