Submission #3448379

---

Source Code Expand

a,b=map(int,input().split())
dp=[0]*(b+11)
for i in range(a+1,b+11):
  dp[i]=dp[i-1]+1
  for j in[5,10]:
    if i-j<a:continue
    dp[i]=min(dp[i],dp[i-j]+1)
for _ in range(100):
  for i in range(a+1,b+1):
    for j in[1,5,10]:
      dp[i]=min(dp[i],dp[i+j]+1)
  for i in range(a+1,b+11):
    dp[i]=min(dp[i],dp[i-1]+1)
    for j in[5,10]:
      if i-j<a:continue
      dp[i]=min(dp[i],dp[i-j]+1)
print(dp[b])

Submission Info

Judge Result