Problem:


  MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

カエルはまっすぐ帰る

一匹のカエルが巣穴に帰ろうとしています。巣穴はカエルの D センチメートル前方にあって、カエルは巣穴に向かってまっすぐ進みます。カエルができる行動は、以下の２つだけです。

 大ジャンプ（L センチメートル前方に進む）

 小ジャンプ（１センチメートル前方に進む）

カエルは巣穴を跳び越すことなく、ちょうど巣穴に着地することをねらっています。

カエルが巣穴に帰るために、最低何回跳ぶ必要があるかを求めるプログラムを作成せよ。

Input

入力は以下の形式で与えられる。

D L

入力は１行であり、巣穴までの距離 D (1 ≤ D ≤ 10000) と大ジャンプでカエルが進む距離 L (2 ≤ L ≤ 10000) が与えられる。

Output

カエルが最低何回跳ぶ必要があるかを、１行に出力する。

Sample Input 1

10 5

Sample Output 1

2

Sample Input 2

7 4

Sample Output 2

4



Sample input:
10 5


Sample output:
2

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
c,d=a//b,a%b
e=c+b
print(e)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
c=a//b
d=a%b
e=c+b
print(e)

Submission status: Accepted

Solution code:
d, l = map(int, input().split())
print(d // l + d % l)

Submission status: Accepted

Solution code:
d, l = map(int, raw_input().split())
print d/l+d%l

Submission status: Accepted

Solution code:
D,L=map(int,input().split())
print(D//L+(D-(D//L)*L))

Submission status: Accepted

Solution code:
D, L = map(int, input().split())
cm = count = 0
while True:
    if D < cm + L:
        count += D - cm
        break
    else:
        cm += L
        count += 1
print(count)

Submission status: Accepted

Solution code:
D,L=map(int,input().split())
s = b = 0
while True:
    if D < s + L:
        b += D - s
        break
    else:
        s += L
        b += 1
print(b)

Submission status: Accepted

Solution code:
[d, l] = [int(num) for num in input().split()]
print(d // l + d % l)

Submission status: Accepted

Solution code:
D,L = map(int,input().split())
print(D//L + D%L)

Submission status: Accepted

Solution code:
D, L = map(int, input().split())
print(sum(divmod(D, L)))

Submission status: Accepted

Solution code:
D, L = map(int, input().split())
print(D//L + D%L)

Submission status: Accepted

Solution code:
ins = [int(x) for x in input().split()]

if ins[0] < ins[1]:
    print(ins[0])
else:
    print(int(ins[0]/ins[1])+int(ins[0]%ins[1]))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
c=a//b
d=a%b
e=c+d
print(e)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print(a // b + a % b)

Submission status: Accepted

Solution code:
D, L = map(int, input().split())
print(D//L + (D - D//L*L))

Submission status: Accepted

Solution code:
# coding=utf-8

D, L = map(int, input().split())

print(D//L + D % L)

Submission status: Accepted

Solution code:
D,L=map(int,input().split())
x=D//L
y=D%L
print(x+y)

Submission status: Accepted

Solution code:
D,L=map(int,input().split())
i=0
while D>=L:
   D=D-L
   i+=1
i+=D
print(i)

Submission status: Accepted

Solution code:
D,L=map(int,input().split())
jump=0
while True:
    if D<L:
        break
    D-=L
    jump+=1
while True:
    if D==0:
        break
    D-=1
    jump+=1
print(jump)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
D, L= map(int,input().split())
x = D // L
y = D % L
sum = x + y
print(sum)

Submission status: Accepted

Solution code:
d,l=map(int, input().split())
print(d//l+d%l)

Submission status: Accepted

Solution code:
import math
D,L = map(int, input().split())
c = D / L + D % L
print(math.floor(c))

Submission status: Accepted

Solution code:
D,L = map(int,input().split())
print(D//L + D%L)

Submission status: Accepted

Solution code:
D,L=map(int,input().split())
if D%L==0:
    print(D//L)
else:
    print((D//L)+(D%L))

Submission status: Accepted

Solution code:
d,l=map(int,input().split())
A=d//l
B=d%l
print(A+B)

Submission status: Accepted

Solution code:
D, L= map(int,input().split())
count1 = D // L
count2 = D % L
sum = count1 + count2
print(sum)

Submission status: Accepted

Solution code:
D,L=map(int,input().split())
print(D//L+D%L)

Submission status: Accepted

Solution code:
import math
D, L = map(int,input().split())

print(math.floor(D/L + D%L))

Submission status: Accepted

Solution code:
D,L=map(int,input().split())

A=D//L
B=D-(L*A)

print(A+B)

Submission status: Accepted

Solution code:
d,l = map(int,input().split())
if d % l == 0:
    ans = d // l
    print(ans)
else:
    a1 = d // l
    a2 = d % l
    print(a1+a2)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print((a//b)+(a%b))

Submission status: Accepted

Solution code:
D,L=map(int,input().split())
a=D//L
b=D%L
s=a+b
print(s)

Submission status: Accepted

Solution code:
import math

d,l = map(int,input().split())

n = d//l
k = d%l

print(n+k)

Submission status: Accepted

Solution code:
D, L = map(int, input().split())
print((D//L)+D%L)

Submission status: Accepted

Solution code:
d,l = map(int,input().split())

a = d//l
b = d%l

print(a+b)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print(int(a/b+a%b))

Submission status: Accepted

Solution code:
D, L = map(int, input().split())

if L<=D:
    if D%L==0:
        print(D//L)
    else:
        print( D//L + D%L)
else:
    print(D)

Submission status: Accepted

Solution code:
D, L = list(map(int, input().split()))

bigJump = D // L
smallJump = D % L
print(bigJump + smallJump)

Submission status: Accepted

Solution code:
d, l = map(int, input().split())

q, r = divmod(d, l)

print(q + r)

Submission status: Accepted

Solution code:
a,b = map(int,input().split()) #標準入力
kei = a // b #大ジャンプ回数
kei += a - b * kei #小ジャンプ回数
print(kei) #大ジャンプと小ジャンプの合計

Submission status: Accepted

Solution code:
d, l = map(int, input().split())
s = int(d / l + d % l)
print(s)

Submission status: Accepted

Solution code:
d,l = list(map(int, input().split()))

a = l*(d//l)
print(d//l + (d - a))

Submission status: Accepted

Solution code:
import sys
import math
d,l=map(int,input().split())
ans=d//l
amr=d%l
if(amr != 0):
    ans=ans+amr
print(ans)

Submission status: Accepted

Solution code:
i = input()
D,L = map(int,i.split())
a = D//L
b = D % L
print(a+b)

Submission status: Accepted

Solution code:
d,l=map(int,input().split())
if d/l==0:
    print(d//l)
else:
    x,y=divmod(d,l)
    print(x+abs(y))

Submission status: Accepted

Solution code:
print(sum(divmod(*map(int,input().split()))))

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
print(a//b+a%b)

Submission status: Accepted

Solution code:
d,l=map(int,input().split())
print(d//l+d%l)

Submission status: Accepted

Solution code:
i = list(map(int,input().split()))
a = i[0] // i[1]
b = i[0] % i[1]
print(a+b)

Submission status: Accepted

Solution code:
len,jum = map(int,input().split())
lar = len // jum
sma = len % jum
print(lar+sma)

Submission status: Accepted

Solution code:
d,l = [ int(s) for s in input().split()]
print(d//l+d%l)

Submission status: Accepted

Solution code:
D,L=map(int,input().split())
A=int(D/L)
B=D-(A*L)
print(A+B)

Submission status: Accepted

Solution code:
D, L =map(int,input().split())

a, b = D % L, D // L

print(a + b)

Submission status: Accepted

Solution code:
d,l = map(int,input().split(" "))
print((d//l)+(d-(d//l)*l))

Submission status: Accepted

Solution code:
D, L = map(int,input().split())
ans = int(D/L) + (D-L*int(D/L))
print(ans)

Submission status: Accepted

Solution code:
D, L = map(int, input().split())
ans = D // L + D % L
print(ans)

Submission status: Accepted

Solution code:
D, L = [int(x) for x in input().split()]
print((D // L) + (D % L))

Submission status: Accepted

Solution code:
D,L=map(int,input().split())
x=D//L
if D%L==0:
  print(x)
else:
  print(x+(D-L*x))

Submission status: Accepted

Solution code:
l=input().split()
D=int(l[0])
L=int(l[1])
kaisuu1=D//L
kaisuu2=D%L
print(kaisuu1+kaisuu2)

Submission status: Accepted

Solution code:
D,L=map(int,input().split())
bj=D//L
sj=D%L
print(bj+sj)

Submission status: Accepted

Solution code:
s = input().split()
a = int(s[0])// int(s[1])

b = int(s[0]) - (a*int(s[1]))


print(a+b,sep="")

Submission status: Accepted

Solution code:
d, l = map(int, input().split())

cnt = d // l + d % l
print(cnt)

Submission status: Accepted

Solution code:
D, L = map(int, input().split())
print(D//L+D%L)

Submission status: Runtime Error

Solution code:
print(sum(divmod(map(int, input().split())))