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: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

if A == 1:
    print(math.floor(H/A))
else:
    if mod == 0:
        print(ans)
    else:
        print(ans+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(math.ceil(h / 4))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
def resolve_A():
    H, A = map(int, input().split())
    if H % A != 0:
        print(math.ceil(H / A))
    else:
        print(H / A)
resolve_A()

Submission status: Wrong Answer

Solution code:
H , A =  [int(x) for x in input().split()]
attack = True
count = 0
while(attack):
    H = H - A
    count = count + 1
    if H < 0:
        attack = False

print(count - 1)

Submission status: Wrong Answer

Solution code:
h,a=map(int, input().split())
count = 0
while True:
  result = h - a
  if (result > 0):
    count += 1
  else:
    break 
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((h // a) + 1)

Submission status: Wrong Answer

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

n = int(h / a) + 1

print(str(n))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
H , A =  [int(x) for x in input().split()]

attack = True
count = 0
while(attack):
    H = H - A
    if H < 0:
        attack = False
    count = count + 1

print(count)

Submission status: Wrong Answer

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

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

print(attack_cnt)

Submission status: Wrong Answer

Solution code:
val = input().split(' ')
h = int(val[0])
a = int(val[1])

for i in range(1, 10000):
    h -= a
    if h <= 0:
        n = i
        break

print(i)

Submission status: Wrong Answer

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

q= h//a

print(q)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def attack(l):
    H = l[0]
    A = l[1]
    cnt = 0
    while H >= 0:
        H = H - A
        cnt += 1
    print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
H,A=input().split()
S=1
if int(H)-S*int(A)>=0:
  S+=1
else:
  print(S)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
x,y = map(int,input().split())

count = x//y

if x%y == 0:
    count += 1

print(count)

Submission status: Wrong Answer

Solution code:
H,A= input().split()
H=int(H)
A=int(A)
ans=0
if (H % A==0):
    ans=int(H/A)
else:
    ans=int(H/A)

Submission status: Wrong Answer

Solution code:
t = []
t = list(map(int, input().split()))

a = t.pop()
h = t.pop()

tt = h // a + 1

print(tt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 1
while A * ans <= H:
    ans += 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count = 0
while HP<0:
    HP = HP - A
    count += 1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

i = 0
while True:
    
    if H < 0:
        break
    H -= A
    i += 1
    
print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
H,A = input().split()
H = int(H)
A = int(A)
for i in range(H):
  if i * A >= H:
    print(i)
    break

Submission status: Wrong Answer

Solution code:
H , A =  [int(x) for x in input().split()]

attack = True
count = 0
while(attack):
    H = H - A
    count = count + 1
    if H < 0:
        attack = False

print(count)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

t=h%a
h-=t
c=int(h/a)
print(c)

Submission status: Wrong Answer

Solution code:
H,A=input().split()
S=1
if int(H)-S*int(A)>0:
  S+=1
else:
  print(S)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = int(0)

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

Submission status: Wrong Answer

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

print(-(-h//a))

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import sys


def main():
    tmp = input().split()
    h = int(tmp[0].replace('\n',''))
    a = int(tmp[1].replace('\n',''))
    n= h/a
    if (h%a >0):
        n+=1
    print(n)

if __name__ == '__main__':
    input = sys.stdin.readline
    main()

Submission status: Wrong Answer

Solution code:
s = input().split()

ans = (int(s[0]) // int(s[1])) + 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

times = h // a
if h % a != 0 :
    times = 1
print(times)

Submission status: Wrong Answer

Solution code:
inp = input().rstrip().split(" ")
HP = int(inp[0])
ATK = int(inp[1])
print(int(HP / ATK) + 1)

Submission status: Wrong Answer

Solution code:
import numpy as np
H, A =map(int, input().split())
print(np.ceil(H / A))

Submission status: Wrong Answer

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


def inputIntList():
  return [int(s) for s in input().split()]


def inputInt():
  return int(input())


def main():
  H, A = inputIntList()
  ans = math.floor(H / A)

  return ans


if __name__ == "__main__":
  print(main())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

q= h//a

print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
h,a = map(int,input().split())
c = 0
while(True):
    h = h - a
    if(h < 0):
        c += 1
        break

    c += 1

print(c)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
def main():
    H, A = map(int, input().split())

    i = 0
    while True:
        i += 1
        H = H - A
        if H < 0:
            print(i)
            break


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#python3
from numpy import ceil
h, a = map(int, input().split())

print(ceil(h/a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import numpy as np


DEBUG = True
dprint = print if DEBUG else lambda *x : x

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

print(round(H / A + 0.5))

Submission status: Wrong Answer

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

print(h//a+1)

Submission status: Wrong Answer

Solution code:
import numpy as np
N, a = list(map(int, input().split()))

print(np.round(np.ceil(N/a)))

Submission status: Wrong Answer

Solution code:
# your code goes here
n,k=map(int,input().split())
ans=n//k
print(ans+1)

Submission status: Wrong Answer

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

for i in range(10**4):
  if a[1]*i > a[0]:
    break
    
print(i)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y = map(int,input().split())

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(a // b + 1)

Submission status: Wrong Answer

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

print(h // a + 1)

Submission status: Wrong Answer

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

print(h // a +1)

Submission status: Wrong Answer

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

ans = int(H/A+1)

print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())
H, A = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
[h,a] = [int(x) for x in input().split()]
ans=int(h/a)+1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split()  ) #split()で分解したものを別々の変数に入れる

result = a // b + 1
print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x, y = map(int,input().split())

ans = x // y + 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(H/A)+1)

Submission status: Wrong Answer

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

ans = t + 1
print(ans)

Submission status: Wrong Answer

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

ans = int(a/b) + 1

print(ans)

Submission status: Wrong Answer

Solution code:
h, a = [int(x) for x in input().split()]

cnt = 0
hp = h
for _ in range(h):
    hp -= a
    cnt += 1
    if hp < 0:
        break

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y = map(int,input().split())

a = int(x/y)

print(a+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

def many_int():
    return list(map(int, input().split()))

N,M = two_int()

temp = N/M

if temp.is_integer():
    print(temp)
else:
    print(int(temp)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(H//A+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

H, A = map(int, input().split())
print(math.ceil(10 / 4))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(H // A + 1)

Submission status: Wrong Answer

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

a = int(data[0] / data[1]) + 1

print(a)

Submission status: Wrong Answer

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

print(a//b+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(h // a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(H//A+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Time Limit Exceeded

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

print(cnt)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

x = 0
while True:
  if H < 0:
    break
  else:
    x += 1
print(x)

Submission status: Time Limit Exceeded

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

while True:
    if H < A:
        cnt += 1
        break
    elif H > A:
        H = H - A
        cnt += 1

print(cnt)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Accepted

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

print(h//a + 1) if h%a else print(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:
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())
if (h%a)!=0:
  print((h//a)+1)
else:
  print(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 = map(int,input().split())
print(-(-H//A))

Submission status: Accepted

Solution code:
#153-A

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

if H % A == 0:
    print(H // A)

else:
    print( H//A +1)

Submission status: Accepted

Solution code:
import sys,math,collections
from collections import defaultdict

#from itertools import permutations,combinations
    
def file():
    sys.stdin = open('input.py', 'r')
    sys.stdout = open('output.py', 'w') 
def get_array():
    l=list(map(int, input().split()))
    return l
def get_ints():   
    return map(int, input().split())
    #return a,b
def get_3_ints():   
    a,b,c=map(int, input().split())
    return a,b,c    
def sod(n):
    n,c=str(n),0
    for i in n: 
        c+=int(i)
    return c    
def isPrime(n):
    if (n <= 1):
        return False
    if (n <= 3):
        return True
    if (n % 2 == 0 or n % 3 == 0):
        return False
    i = 5
    while(i * i <= n):
        if (n % i == 0 or n % (i + 2) == 0):
            return False
        i = i + 6
  
    return True
def getFloor(A, x):

    (left, right) = (0, len(A) - 1)

    floor = -1
    while left <= right:
        mid = (left + right) // 2
        if A[mid] == x:
            return A[mid]
        elif x < A[mid]:
            right = mid - 1
        else:
            floor = A[mid]
            left = mid + 1
            
    return floor
def chk(aa,bb):
	f=0
	for i in aa:
		for j in bb:
			if(j[0]>=i[0] and j[1]<=i[1]):
				f+=1
			elif(j[0]<=i[0] and j[1]>=i[1]):	
				f+=1
			elif(i[0]==j[1] or i[1]==j[0]):
				f+=1
			else:
				continue
	return f	
def maxSumRangeQuery(nums, req):
    l=[0]*(len(nums)+1)
    nums.sort(reverse=True)
    for i in req:
        l[i[0]]+=1
        l[i[1]+1]-=1
    for i in range(1,len(l)):
        l[i]+=l[i-1]
    l=l[:-1]    
    
    d=collections.defaultdict(list)
    for i in range(len(l)):
        d[l[i]].append(i)
    di=collections.OrderedDict(sorted(d.items()))   
        #print(di)
    k=0
    ans=[0]*len(nums)
    for i in di:
        for j in di[i]:
            ans[j]=nums[len(nums)-k-1]
            k+=1
        #return ans        
    c=0
    for i in req:
        st=ans[i[0]:i[1]+1]
        c+=sum(st)
    return c%(10**9+7)
			

#file()
def main():
	c=0
	a,b=get_ints()
	while(a>0):
		a-=b
		c+=1
	print(c)	
		
#[1, 1, 1, 0]
#[1, 2, 2, 1]
#[1, 3, 2, 1]




				





		


	





        
            
        























    

    
    

        











        
        

        























































                

            







            
            
































        








if __name__ == '__main__':
    main()

Submission status: Accepted

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

a=H//N
if H%N!=0:
    a+=1
print(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())

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

print(c)

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 = map(int,input().split())
ans = (h-1)//a + 1
print(ans)

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:
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:
    count=h//a
else:
    count = h//a+1
print(count)

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=map(int,input().split())
print((H-1)//A+1)

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
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:
H, A = map(int, input().split())
ans = H // A
mod = H % A
if mod == 0:
  print(ans)
else:
  print(ans + 1)

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

from  collections import defaultdict
from collections import Counter
import bisect
from functools import reduce

def main():
    H, A = MI()
    print(math.ceil(H / A))


if __name__ == "__main__":
    main()

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 // A))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(cnt)

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:
H,A = map(int,input().split())

cnt = 0
while(True) :
    H = H - A
    cnt += 1
    if H  <= 0 :
        break

print(cnt)

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 = 0
for _ in range(h):
  h -= a
  ans += 1
  if h <= 0:
    break
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
H, A = map(int, input().split())
ans = H // A
if H % A == 0:
  print(ans)
else:
  print(ans + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input()
nums  = str.split()
if nums[0] == "0" or nums[1] == "0":
     print("error")
else:
    turn = float(nums[0]) / float(nums[1]) + 0.9
    if turn < 1:
       turn = 1
    print(int(turn))

Submission status: Accepted

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

Submission status: Accepted

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

if H % N == 0:
    print(H//N)
elif H % N != 0:
    print(H // N + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(str(s))

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())
if h//a==h/a:
    print(h//a)
else:
    print((h//a)+1)

Submission status: Accepted

Solution code:
import math
H, A = map(int, input().split())
 
# H/A の切り上げ
# ceil or (H+A−1)/A の切り捨て
print((H+A-1) // A)

Submission status: Accepted

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

# H/A の切り上げ
# ceil or (H+A−1)/A の切り捨て
print(math.ceil(H/A))

Submission status: Accepted

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


if H % A == 0:
    count_e = H//A 
    print(count_e)

elif H < A:
    count_u =  1
    print(count_u)
    
elif  H % A != 0:
    count_o = H // A + 1
    print(count_o)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h, a = [int(i) for i in input().split()]
ans = h // a if h % a == 0 else h // a + 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 = [int(x) for x in input().split()]
print((h+a-1)//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:
import math

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

print(math.ceil(H/A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

rStr = input()

H = int(rStr.split(' ')[0])
A = int(rStr.split(' ')[1])

count = 0

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

print(count)

Submission status: Accepted

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


def solve(H: int, A: int):
    return (H + A - 1) // A


def main():
    H, A = map(int, input().split())
    answer = solve(H, A)
    print(answer)


if __name__ == "__main__":
    main()

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
h,a = map(int,input().split())
print(str(math.ceil(h/a)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

if __name__ == "__main__":
    main()

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()]
t = 0
if H/A != int(H/A):
    t = 1
print(int(H/A) + t)

Submission status: Accepted

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

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(h//a+1)
else:
    print(h//a)

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:
ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())
 
H, A = rii()
H, r = divmod(H, A)
r = 1 if r else r
print(H + r)

Submission status: Accepted

Solution code:
ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())

H, A = rii()

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

Submission status: Accepted

Solution code:
import math

H, A = map(int, input().split())
ans = math.ceil(H / A)

print(ans)

Submission status: Accepted

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