The Egg Drop

Difficulty: 2100 5000 ms 128 MB

dp

You have E identical eggs and an F-floor building. An egg breaks if dropped from at or above some unknown critical floor. Print the minimum number of drops that GUARANTEES finding the critical floor in the worst case.

Input: one line with two integers E and F.

Output: the minimum worst-case number of drops.

Constraints:

• 1 ≤ E ≤ 100
• 1 ≤ F ≤ 10⁹

Sample Tests

2 10

4

1 5

5

Read the Editorial