2eggs-100floors.py

# No speed up.
def f(n):
    if n == 1:
        print('n==1, directly return 1')
        return 1

    p = [] # Storage for temp results.
    for i in range(1, n): # i in [1, n)
        temp = 1 + max(i-1, f(n-i))
        p.append(temp)

    return min(p)

print('f(100)', f(100))