There is a building ofnfloors. If an egg drops from the_k_th floor or above, it will break. If it's dropped from any floor below, it will not break.

You're given two eggs, Find_k_while minimize the number of drops for the worst case. Return the number of drops in the worst case.

Have you met this question in a real interview?

Yes

Clarification

For n = 10, a naive way to find_k_is drop egg from 1st floor, 2nd floor ... kth floor. But in this worst case (k = 10), you have to drop 10 times.

Notice that you have two eggs, so you can drop at 4th, 7th & 9th floor, in the worst case (for example, k = 9) you have to drop 4 times.

Example

Given n =10, return4.
Given n =100, return14.

class Solution {
public:
    /*
     * @param : An integer
     * @return: The sum of a and b
     */
    int dropEggs(int n) {
        // write your code here
        long long sum = 0;
        int i = 0;
        while (sum < n) {
            i += 1;
            sum += i;
        }
        return i;
    }
};