Submission #994285

---

Source Code Expand

# encoding: utf-8
n, a = map(int, raw_input().split())
if n>10**7 or a >= 10**7:
    exit(1)

memo = [-1]*(n+1)
# 残りx個を貯めるために最小の時間を返す予定
def dfs(x):
    if x == 0:
        return 0
    if memo[x] != -1:
        return memo[x]
    i = 0
    res = x
    for i in xrange(2, x+1):
        # i-sec待つ
        res = min(res, dfs((x+i-1)/i)+a+i)
    memo[x] = res
    return memo[x]
print dfs(n)

Submission Info

Judge Result