This is for solving the egg drop problem. The setting is very simple: you have e eggs, and a building with n floors. You want to find out what is the highest floor to drop an egg without breaking it. In addition, you want to obtain the answer with as little attempts as possible, even for the worst-case scenario. Then, what is the minimal number of drops one needs?