Submission #2660928

---

Source Code Expand

# seishin.py
N, A = map(int, input().split())

ans = N
for k in range(1, 41):
    left = 0; right = N+1
    while left+1 < right:
        mid = (left + right) // 2
        if mid**(k+1) < N:
            left = mid
        else:
            right = mid
    m = right
    v = (m-1)**(k+1)
    for i in range(k+1):
        v //= m-1
        v *= m
        if N <= v:
            ans = min(ans, A*k + (m-1)*(k+1) + (i+1))
            break
print(ans)

Submission Info

Judge Result