Problem:


Score : 100 points

Problem Statement

Serval is fighting with a monster.

The health of the monster is H.

In one attack, Serval can decrease the monster's health by A.
There is no other way to decrease the monster's health.

Serval wins when the monster's health becomes 0 or below.

Find the number of attacks Serval needs to make before winning.

Constraints

1 \leq H \leq 10^4

1 \leq A \leq 10^4

All values in input are integers.

Input

Input is given from Standard Input in the following format:

H A

Output

Print the number of attacks Serval needs to make before winning.

Sample Input 1

10 4

Sample Output 1

3

After one attack, the monster's health will be 6.

After two attacks, the monster's health will be 2.

After three attacks, the monster's health will be -2.

Thus, Serval needs to make three attacks to win.

Sample Input 2

1 10000

Sample Output 2

1

Sample Input 3

10000 1

Sample Output 3

10000



Sample input:
10 4


Sample output:
3

Submission status: Accepted

Solution code:
from math import ceil

H, A = map(int, input() .split())

n = ceil(H/A)
print(n)

Submission status: Accepted

Solution code:
H, A = list(map(int, input().split()))
n = H // A
if H % A == 0:
    print(n)
elif H % A == A:
    print(1)
else:
    print(n + 1)

Submission status: Accepted

Solution code:
H, A = map(int, raw_input().split())
print H / A + (1 if H % A > 0 else 0)

Submission status: Accepted

Solution code:
H,A = map(int, input().split())

print(-(-H//A))

Submission status: Accepted

Solution code:
H,A = map(int, input().split())
count = 0

for i in range(10000):
    if i*A >= H:
        break
    else:
        i += 1
        count += 1
print(count)

Submission status: Accepted

Solution code:
h, a = map(int, input().split())

if h % a == 0:
    print(h//a)
else:
    print(h//a+1)

Submission status: Accepted

Solution code:
H, A = map(int,input().split())

Attack_num = 0
while H > 0:
    H -= A
    Attack_num += 1
    
print(Attack_num)

Submission status: Accepted

Solution code:
h,a = map(int,input().split())
count = 0
while h - a*count > 0:
    count += 1
print(count)

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
ans = 1

while h > a * ans:
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
import sys
import math

h, a = [int(i) for i in sys.stdin.readline().rstrip().split(" ")]
print(math.ceil(h / a))

Submission status: Accepted

Solution code:
h, a = map(int,input().split())
if h%a==0:
    print(h//a)
else:
    print(h//a+1)

Submission status: Accepted

Solution code:
h,a = list(map(int,input().split()))
print(-(-h//a))

Submission status: Accepted

Solution code:
h,a = map(int,input().split())
count = 0
k = h
while k >= 1:
    hp =k-a
    count +=1
    k = hp
print(count)

Submission status: Accepted

Solution code:
H,A = map(int,input().split())
if H % A == 0:
    print(H//A)
else:
    print(H//A+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# abc 153
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

H, A = map(int, readline().split())

answer = H // A
if (H % A != 0):
  answer += 1
  
print(answer)

Submission status: Accepted

Solution code:
num = input().split()
nums = list(map(int, num))
a,b = nums[0], nums[1]
x = a//b
y = a%b
if y == 0:
  print(x)
else:
  print(x+1)

Submission status: Accepted

Solution code:
H,A=(int(x) for x in input().split())
if H%A == 0:
 print(int(H/A))
elif H%A !=0:
 print(int(H/A)+1)

Submission status: Accepted

Solution code:
import math
a = list(map(int,input().split()))
print(math.ceil(a[0]/a[1]))

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines

#mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np


def main():
	h,a=map(int,input().split())
	print((h-1)//a+1)
	
	

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
h,a = map(int,input().split())

print(-(-h//a))

Submission status: Accepted

Solution code:
def main():
    H, A = map(int, input().split())
    ans = -(-H//A)
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
H, A = map(int, input().split())

div, mod = divmod(H, A)

if mod == 0:
    print(div)
else:
    print(div + 1)

Submission status: Accepted

Solution code:
h,a = map(int,input().split())
if h % a == 0:
    ans = h // a
else:
    ans = h // a + 1
print(ans)

Submission status: Accepted

Solution code:
H,A=map(int,input().split())
count=0
while H>0:
    H -= A
    count+=1

print(count)

Submission status: Accepted

Solution code:

h, a = input().split()
h = int(h)
a = int(a)
x = a
attack = 1

while h > x :
    h -= x
    attack += 1

print(attack)

Submission status: Accepted

Solution code:
H_str, A_str = input().split(' ')
H = int(H_str)
A = int(A_str)

if H % A == 0:
  print(H // A)
else:
  print(H // A + 1)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding:utf-8 -*-

from math import ceil
def main():
  h, a = map(int, input().strip().split())
  print('%d' % (ceil(h/a)))

if __name__=='__main__':
  main()

Submission status: Accepted

Solution code:
nam = input().split()
ans = int(nam[0]) / int(nam[1])

if int(nam[0]) % int(nam[1]) != 0:
  ans += 1

print(str(int(ans)))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import math


def main():
    h, a = map(int, input().split())
    print(math.ceil(h / a))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
import math

def main():
    # sys.stdin = open('input153a.txt')
     
    h, a = map(int, input().split())

    print(math.ceil(h / a))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    h, a = list(map(int, input().rstrip('\n').split()))
    print((h + a - 1) // a)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
h,a=map(int,input().split())
ans=h//a
if h%a!=0:
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
import math
H, A = list(map(int, input().split()))
print(math.ceil(H/A))

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
s = 0
while h > 0:
    h -= a
    s += 1
print(s)

Submission status: Accepted

Solution code:
h, a = input().split()
H = int(h)
A = int(a)
ans = 0
for i in range(H):
  if H > 0:
    ans = ans + 1
    H = H - A
  else:
    break
print(ans)

Submission status: Accepted

Solution code:
H, A = map(int, input().split())
 
counter = 0
 
while H > 0:
  H = H - A
  counter += 1
  
print(counter)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.buffer.readline

def main():
    N,K = map(int,input().split())
    print(-(-N//K))
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import numpy as np

H, A = [int(i) for i in input().split()]

#print(H)
#print(A)

q, mod = divmod(H, A)

if not mod == 0:
    q += 1
print(q)

Submission status: Accepted

Solution code:
H, A = map(int, input().split())

print(H // A + min(H % A, 1))

Submission status: Accepted

Solution code:
D = list(map(int, input().split()))
H,A = D[0], D[1]

if( H%A == 0):
    print(H//A)
else:
    print(H//A + 1)

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
if a==1:
	print(h)
else:
	print((h-1)//a+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

H, A = map(int, input().split())

print (math.ceil(H / A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
#l=list(map(int,input().split()))
print(n//m +((n%m)!=0))

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
ans = h // a
tmp = h % a
if tmp == 0:
    print(ans)
else:
    print(ans + 1)

Submission status: Accepted

Solution code:
H, A = map(int, input().split())
res = -(-H // A)
print(res)

Submission status: Accepted

Solution code:
import math

h,a = map(int,input().split())
print(math.ceil(h/a))

Submission status: Accepted

Solution code:
import math
h,a=map(int,input().split())
print (math.ceil(h/a))

Submission status: Accepted

Solution code:
import math
h,a=map(int,input().split())
print (math.ceil(h/a))

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
print((h-1)//a+1)

Submission status: Accepted

Solution code:
H, M = map(int, input().split())

ans, c = divmod(H, M)
if c > 0: ans += 1
print(ans)

Submission status: Accepted

Solution code:
from math import ceil

h, a = [int(i) for i in input().split()]
print(ceil(h / a))

Submission status: Accepted

Solution code:
n,b=map(int,input().split())

print(int(-1*((-1*n)//b)))

Submission status: Accepted

Solution code:
H,A = map(int,input().split())
if H%A==0:
    print(H//A)
else:
    print(H//A+1)

Submission status: Accepted

Solution code:
get = list(map(int, input().split()))
H = get[0]
A = get[1]

if H % A == 0:
    print(H // A)
else:
    print((H // A) + 1)

Submission status: Accepted

Solution code:
import math
hp, ap = map(int, input().split())
cnt = math.ceil(hp / ap)
print(cnt)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

if __name__ == '__main__':
    H, A = map(int, input().rstrip().split())
    print(H//A+int(H%A!=0))

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

H, A = MAP()

print(ceil(H/A))

Submission status: Accepted

Solution code:
import math

def func():
    l = list(map(int, input().split()))
    try:
        for n in l:
            1<= n <= 10**4
            print( math.ceil(l[0] / l[1]) )
            break
    except:
            print("Error")

func()

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
print((h + a - 1) // a)

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
hoge=n/m
if(hoge%1==0):
  print(int(hoge))
else:
  print(int(hoge)+1)

Submission status: Accepted

Solution code:
import math
score, hitpoint = map(int, input().split())
print(math.ceil(score/hitpoint))

Submission status: Accepted

Solution code:
hp,atk = [int(x) for x in input().split()]
ans = hp // atk if hp % atk == 0 else hp // atk + 1
print(ans)

Submission status: Accepted

Solution code:
h,a = map(int,input().split())
count = 0

while h > 0:
  h -= a
  count+=1
print(count)

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
count = 0

while h > 0:
  count += 1
  h = h - a
 
print(count)

Submission status: Accepted

Solution code:
N, A = map(int, input().split())

ans = N // A

if ans * A == N:
  print(ans)
else:
  print(ans+1)

Submission status: Accepted

Solution code:
h,a = map(int,input().split())

if h % a == 0:
    print(h//a)
else:
    print(h//a+1)

Submission status: Accepted

Solution code:
H, A = map(int, input().split())
if H % A != 0:
	print(H//A+1)
else:
	print(H//A)

Submission status: Accepted

Solution code:
import math


h, a = map(int, input().split())
print(math.ceil(h / a))

Submission status: Accepted

Solution code:
H,A = map(int,input().split())


count = 0

while H > 0:
    H -= A
    count +=1

print(count)

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
print(1 + h//a) if h%a else print(h//a)

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()]

print(-(-a[0] // a[1]))

Submission status: Accepted

Solution code:
from math import ceil
(lambda H,A : print( ceil(H/A) ))(*map(int,input().split()))

Submission status: Accepted

Solution code:
import math
h, a = list(map(int, input().split()))
 
print(math.ceil(h/a))

Submission status: Accepted

Solution code:
H, A = map(int, input().split())
print(int(H/A) if H % A == 0 else int(H/A)+1)

Submission status: Accepted

Solution code:
h,a = (int(i) for i in input().split())
print((h+a-1)//a)

Submission status: Accepted

Solution code:
hp,atk = map(int, input().split())

count = 0
while hp > 0:
    hp -= atk
    count += 1

print("{}".format(count))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H, A = list(map(int, input().split()))
print((H + A - 1) // A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

h,a = map(int,input().split())

s = 0

while h > 0:
    h -= a
    s += 1

print(s)

Submission status: Accepted

Solution code:
n=list(map(int,input().split()))
t = 0

if n[0] % n[1] != 0:
  t = 1

print(n[0] // n[1] + t)

Submission status: Accepted

Solution code:
H, A=map(int, input().split())
print((H-1)//A+1)

Submission status: Accepted

Solution code:
H,A = list(map(int, input().split()))
ans = H//A
if(H%A > 0):
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
h,a = map(int, input().split())
            
ans = 0
while h > 0:
    h= h - a
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
H, A = map(int, input().split())

if H % A == 0:
  print(H // A)
else:
  print(H // A + 1)

Submission status: Accepted

Solution code:
h,a = map(int,input().split())
print(h//a if h%a == 0 else h//a + 1)

Submission status: Accepted

Solution code:
H, A = map(int, input().split())

print((H + A - 1) // A)

Submission status: Accepted

Solution code:
import math
 
H,A = list(map(int, input().split()))
 
print(math.ceil(H/A))

Submission status: Accepted

Solution code:
import math

h,a = list(map(int, input().split()))

print(math.ceil(h/a))

Submission status: Accepted

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

res =data[0]//data[1]
if data[0]%data[1]!=0:
   res=res+1

print(res)

Submission status: Accepted

Solution code:
# coding utf-8
import math
H, A = map(int, input().rstrip().split())

print(math.ceil(H/A))

Submission status: Accepted

Solution code:
a=input().rstrip().split(" ")
b=int(a[0])
n=0

while b>0:
  b-=int(a[1])
  n+=1

print(n)

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
print((h+a-1)//a)

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

h, a = map(int, input().strip().split())
if (h % a > 0):
  print(h // a + 1)
else:
  print(h // a)

Submission status: Accepted

Solution code:
import math
H,a = map(int, input().split())
print(math.ceil(H/a))

Submission status: Accepted

Solution code:
import math
h, a = map(int, input().split())

print(math.ceil(h / a))

Submission status: Accepted

Solution code:
#coding:utf-8
H, A = map(int, input().split())
print ((H+A-1)//A)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

H, A = map(int, input().split())

if H % A == 0:
    print(H//A)
else:
    print(H//A+1)

Submission status: Accepted

Solution code:
#coding:utf-8
H, A = map(int, input().split())
print ((H-1)//A + 1)

Submission status: Accepted

Solution code:
H, A = map(int, input().split())

ans = -(-H // A)
print(ans)

Submission status: Accepted

Solution code:
import math
H,A = map(int,input().split())
X = math.ceil(H/A)
print(X)

Submission status: Accepted

Solution code:
from math import ceil
H,A = map(int,input().split())
print(ceil(H/A))

Submission status: Accepted

Solution code:
H, A = map(int,input().split())
print( H//A if H%A == 0 else H//A+1)

Submission status: Accepted

Solution code:
h,a = map(int,input().split())

import math
ans = math.ceil(h/a)
print(ans)

Submission status: Accepted

Solution code:
h,a=map(int,input().split())

i=0
while h>0:
  h=h-a
  i+=1
  
print(i)

Submission status: Accepted

Solution code:
h, a = map(int,input().split())

if h%a == 0:
    print(int(h/a))
else:
    print(int(h/a)+1)

Submission status: Accepted

Solution code:
import math
IN = map(int,input().split())
ans = 0; mod = pow(10,9)+7
h,a=IN
print(math.ceil(h/a))

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    H, A = map(int, input().split())
    print(((H+A-1)//A))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
from math import ceil
print(ceil(x/y))

Submission status: Accepted

Solution code:
H, A = map(int,input().split())
times = H//A
fat = H%A
if H%A != 0:
  times += 1
print(times)

Submission status: Accepted

Solution code:
h, a = map(int, input().split())

ans = 0
while h > 0:
    h -= a
    ans+=1

print(ans)

Submission status: Accepted

Solution code:
import math
from sys import stdin
H, A = [int(_) for _ in stdin.readline().rstrip().split()]
print(math.ceil(H/A))

Submission status: Accepted

Solution code:
H,A = list(map(int,input().split()))

if H%A == 0:
	print(H//A)
	exit()
else:
	print(H//A+1)
	exit()

Submission status: Accepted

Solution code:
h, a = map(int,input().split())
ans = h//a
if h%a!=0:
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
H, A = map(int,input().split())
i = 1

while 0 < (H-A):
    H = H - A
    i = i+1

print(i)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from itertools import product, permutations, combinations
from bisect import bisect_right,bisect_left
INF = float('inf')

H, A=map(int, input().split())
if H % A == 0:
    print(H//A)
else:
    print(H//A + 1)

Submission status: Accepted

Solution code:
h,a=map(int,input().split())
print(h//a+(1 if h%a!=0 else 0))

Submission status: Accepted

Solution code:
H, A = map(int, input().split())

q, mod = divmod(H, A)

if mod > 0:
    ans = q + 1
else:
    ans = q

print(ans)

Submission status: Accepted

Solution code:
hp,at=map(int,input().split())
if(hp%at==0):
    print(int(hp/at))
else:
    print(int((hp/at)+1))

Submission status: Accepted

Solution code:
import math
h,a = map(int,input().split())
print(math.ceil(h/a))

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
ans = h//a if h%a==0 else h//a+1  
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

print((a + b - 1) // b)

Submission status: Accepted

Solution code:
H, A = input().split()
H = int(H)
A = int(A)
 
if ( 1 <= H ) & ( H <= 10000 ):
  if( 1 <= A ) & ( A <= 10000 ):
    if( H%A == 0 ):
      n = int(H/A)
    else:
      n = int(H/A) + 1
  else:
    n = 0
else:
  n = 0
 
print(n)

Submission status: Accepted

Solution code:
s = input().split(' ')
X = int(s[0])
A = int(s[1])
if X % A == 0:
  print(X // A)
else:
  print((X // A) + 1)

Submission status: Accepted

Solution code:
H, A = map(int, input().split())
print(H // A + bool(H % A))

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    H,A =MI()
    print(ceil(H/A))
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
count = 0
if i[0] <= i[1]:
    print("1")
else:
    while i[0] > 0:
        i[0] -= i[1]
        count += 1
    print(count)

Submission status: Accepted

Solution code:
# coding: utf-8
from math import ceil
h, a = map(int, input().split())
print(ceil(h / a))

Submission status: Accepted

Solution code:
H,A=input().split()
H=int(H)
A=int(A)

count=0
while H>0:
  H=H-A
  count+=1
print(count)

Submission status: Accepted

Solution code:
def solve(string):
    h, a = map(int, string.split())
    return str((h - 1) // a + 1)


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
ans = int(h/a)
if h%a == 0:
    print(ans)
else:
    print(ans+1)

Submission status: Accepted

Solution code:
H,A=input().split()
num=int(H)//int(A)
if int(H)%int(A)!=0:
    num+=1
print(num)

Submission status: Accepted

Solution code:
h,a = map(int,input().split())
print(-(-h//a))

Submission status: Accepted

Solution code:
h,a = map(int,input().split())
if(h%a == 0):
  print(int(h/a))
else:
  print(int(h/a)+1)

Submission status: Accepted

Solution code:
import math


hp, ap = input().split(' ')

print(math.ceil(int(hp) / int(ap)))

Submission status: Accepted

Solution code:
H, A = map(int, input().split())
count = 0
while H>0:
    H-= A
    count += 1
print(count)

Submission status: Accepted

Solution code:
h, a = (int(i) for i in input().split())

if h%a == 0:
  count = int(h/a)
else:
  count = int(h/a)+1
  
print(count)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
ct=0
while a>0:
  a-=b
  ct+=1
print(ct)

Submission status: Accepted

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

H = l1[0]
A = l1[1]

T = H%A
if T == 0:
  print(H//A)
else:
  print(H//A+1)

Submission status: Accepted

Solution code:
H,A=map(int,raw_input().split())
ans=0
for i in range(1,100000):
  H = H-A
  ans += 1
  if H<=0:
    break
print ans

Submission status: Accepted

Solution code:
#!/user/bin/env python
#pythonプログラムであることを示している

# -*- coding: utf-8 -*-
"""
このプログラムはPythonを書く際のテンプレとなっています。これをコピペしてコーディングを行なってください。
なお字下げしないこと！！
"""

__author_ = 'Maruta Yuzuha'
__version_ = '1.0.0'
__date__ = '2019/12/25'

def main():
    """
    ここでプログラムの解説を行う
     >>main()
    Hello world.
    0
    """
    s = input().split()
    a = 0
    b = int(s[0])
    c = int(s[1])
    while b > 0:
        b = b - c
        a += 1
    print(a)
    return 0

if __name__ == '__main__':
    #上記のifの記述によってこのスクリプトファイルが起動された時だけ実行する部分になる。
    #ちなみにスクリプトが "モジュールとして"インポートされた時には実行されない、

    #単体テスト:モジュールのdocstring(ドキュメンテーション文字列)に記載された全ての対話実行例が書かれている通りに動作するかを確認
    #python ファイル名 -v
    import doctest
    doctest.testmod()

    #実際にmain()を呼び出して、結果を得て、その結果でPythonシステムを終える
    import sys
    sys.exit(main())

Submission status: Accepted

Solution code:
H, A = map(int, input().split())

print((H -1) // A + 1)

Submission status: Accepted

Solution code:
S,K=map(int,input().split())

if S%K!=0:
  print((S//K)+1)
else:
  print(S//K)

Submission status: Accepted

Solution code:
import math 
a,b = map(int,input().split())
print(math.ceil(a/b))

Submission status: Accepted

Solution code:
HA=input()
HA=HA.split()
n=int(HA[0])/int(HA[1])
if int(HA[0])%int(HA[1])==0:
  print(int(n))
else:
  print(int(n+1))

Submission status: Accepted

Solution code:
# -*- utf-8 -*-

H,A = map(int,input().split(" "))
mod = H%A
ans = H//A

if ans==0:
    print(1)

elif mod==0 and ans >=0:
    print(ans)

else:
    print(ans+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H,A=map(int,input().split())
count=0
while H>0:
    H=H-A
    count=count+1
print(count)

Submission status: Accepted

Solution code:
input_num=input()
n=input_num.split()
num=[int(n[0]),int(n[1])]

N=num[0]
m=0
while 1:
  N=N-num[1]
  m=m+1
  if N<=0:
    break

print(m)

Submission status: Accepted

Solution code:
H, A = map(int, input().split())

print(((H-1)//A)+1)

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
import math
print(math.ceil(n/m))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
h, a = map(int, input().split())

ans = 0
print(math.ceil(h/a))

Submission status: Accepted

Solution code:

h, a = list(map(int, input().split()))

import math
print(math.ceil(h/a))

Submission status: Accepted

Solution code:
import math

hp, atk = input().split()

hp = int(hp)

atk = int(atk)

print(math.ceil(hp / atk))

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,pprint,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

h,a = inpl()
print(math.ceil(h/a))

Submission status: Accepted

Solution code:
h, n = map(int,input().split())
ans = int(h // n)
if h % n:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
ans = (h - 1) // a + 1
print(ans)

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
r = h // a
if h % a:
  r += 1
print(r)

Submission status: Accepted

Solution code:
h, a = map(int, input().split())

ans = 0

if h % a ==0:
    ans = h // a
else:
    ans = h // a + 1

print(ans)

Submission status: Accepted

Solution code:
#abc153a
h,a=map(int,raw_input().split())
cnt=1
while h>a:
 cnt+=1
 h-=a
print cnt

Submission status: Accepted

Solution code:
H, A = map(int, input().split(" "))
c = 0
while H > 0:
  H -= A
  c += 1
print(c)

Submission status: Accepted

Solution code:
H, A = [int(x) for x in input().split()]
print( (H // A ) + (H % A > 0))

Submission status: Accepted

Solution code:
h,a = map(int, input().split())

i = 0
while True:
    i += 1
    h -= a
    if h <= 0:
        break
print(i)

Submission status: Accepted

Solution code:
h,a = map(int, input().split())
print(-(-h//a))

Submission status: Accepted

Solution code:
h,a=map(int,raw_input().split())
print(h+a-1)/a

Submission status: Accepted

Solution code:
H,A = map(int, input().split())
HA = H//A
if HA*A == H:
    print(HA)
else:
    print(HA+1)

Submission status: Accepted

Solution code:
x = input().split()
H, A = [int(i) for i in x]
s = 0
while H  > 0:
  H -= A
  s += 1
print(s)

Submission status: Accepted

Solution code:
# = int(input())
# = map(int, input().split())
# = list(map(int, input().split()))
# = list(input())
# = [tuple(map(int, input().split())) for _ in range(n)]

h, a = map(int, input().split())

ans = h // a
if h % a > 0:
    ans += 1
    
print(ans)

Submission status: Accepted

Solution code:
def solve(h, a):
    return (h + a - 1) // a

h, a = map(int, input().split())
print(solve(h, a))

Submission status: Accepted

Solution code:
h,a = map(int,input().split())
ans=0
while h>0:
    h = h-a
    ans +=1 
print(ans)

Submission status: Accepted

Solution code:

a,b=map(int, input().split())

count=0
while a >0:
	a -= b
	count+=1
print(count)

Submission status: Accepted

Solution code:
h,a= map(int,input().split())
ans = int((h+a-1)/a)
print(ans)

Submission status: Accepted

Solution code:
#input
H, A = map(int, input().split())

#output
answer = 0
while H > 0:
    H -= A
    answer += 1

print(answer)

Submission status: Accepted

Solution code:
H, A = map(int, input().split())

count = 0

while H > 0:
  count += 1
  H -= A
  
print(count)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

"""
name: 153A.py
プログラムの説明
"""

def main():
    a,b = map(int, input().split())

    times = (a // b)
    if (a%b)==0:
        pass
    else:
        times += 1



    print(times)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
ans, m = h // a, h % a
if m:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
# A - Serval vs Monster
def main():
    H, A = map(int, input().split())
    print((H + A - 1) // A)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
h,a = map(int, input().split())
if h%a == 0:
    print(h//a)
else:
    print(h//a+1)

Submission status: Accepted

Solution code:
H, A = map(int, input().split())
n = 0
while H > 0:
    n += 1
    H -= A
print(n)

Submission status: Accepted

Solution code:
H, A= map(int, input().split())
count=0
while H>0:
    H=H-A
    count=count+1


print(count)

Submission status: Accepted

Solution code:
H,A = map(int,input().split())

print(H//A if H%A == 0 else H//A+1)

Submission status: Accepted

Solution code:
from math import ceil
H, A = map(int, input().split())
print(ceil(H/A))

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
count=1
ll=l[0]
while ll-l[1]>0:
    count+=1
    ll=ll-l[1]
print(count)

Submission status: Accepted

Solution code:
def c(i):
    return i

H,A = map(int, input().split())
a,b = map(c,divmod(H,A))
if b==0:
    print(a)
else:
    print(a+1)

Submission status: Accepted

Solution code:
from sys import stdin

H, A = (int(v) for v in stdin.readline().split())
n = H // A
print(n + 1 if H % A > 0 else n)

Submission status: Accepted

Solution code:
s = list(map(int,input().split())) 
H = s[0]
A = s[1]
u = (H + A - 1)//A
print(u)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import math

def solve(H: int, A: int):
    print(math.ceil(H / A))
    return 0


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    solve(H, A)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import math

h,a = map(int, input().split())
print(math.ceil(h/a))

Submission status: Accepted

Solution code:
h,a = map(int,input().split())
cnt = 0
while h>0:
    h -= a
    cnt+=1
print(cnt)