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:
h, a = map(int, input().split())
count = 0
while h> 0:
    h = h - a
    count += 1
print(count)

Submission status: Accepted

Solution code:
import math

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

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:
import math
H, A = map(int, input().split())
c = math.ceil(H/A)
print(c)

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())

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

print(ans)

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())

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

print(i)

Submission status: Accepted

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

if H % A == 0:
    ans = H // A
    print(ans)
elif H % A > 0:
    ans = H // A + 1
    print(ans)

Submission status: Accepted

Solution code:
h,a=(int(x) for x in input().split())
count=0
while True:
	count+=1
	h-=a
	if h<=0:
		break
print(count)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import math
O = list(map(int, input().split()))
print(math.ceil((O[0] / O[1])))

Submission status: Accepted

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

Submission status: Accepted

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

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = input().rstrip().split(' ')

h = int(line[0])
a = int(line[1])

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 26 20:57:25 2020

@author: H_Hoshigi
"""

import math

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

answer = math.ceil(H/A)

print(answer)

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:
import math

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

print(math.ceil(a / b))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

hp, attack = map(int, input().split())
print(math.ceil(hp / attack))

Submission status: Accepted

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

print(-(-h//a))

Submission status: Accepted

Solution code:
import math as mt

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

print(mt.ceil(H/A))

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]

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

Submission status: Accepted

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

#整数値入力 1文字の入力
def input_one_number():
    return int(input())

#整数値龍力　複数の入力
def input_multiple_number():
    return map(int, input().split())

#整数値龍力　複数の入力(配列)
def input_multiple_number_as_list():
    return list(map(int, input().split()))

#整数値龍力　複数の入力(配列で1つずつ渡される)
def input_multiple_number_as_list_sep(N):
    ins = []
    for i in range(N):
        ins.append(input())
    return ins

#2次元配列入力
def input_map():
    return [list(map(int,list(input()))) for i in range(h)]

#リスト出力
def print_list(list):
    print(*list)
    return

#2次元配列出力
def print_map(maplist):
    for i in maplist:print(*i, sep='')
    return

#素数生成
def generate_primenums():
    n = 100
    primes = set(range(2, n+1))
    for i in range(2, int(n**0.5+1)):
        primes.difference_update(range(i*2, n+1, i))
    primes=list(primes)
    return primes

def memo():
    a=[0]*5
    b=a  #良くない配列のコピー
    b2=a[:]  #1次元のときはコピーはこれで良い
    a[1]=3
    print('b:{}, b2:{}'.format(b,b2))  #b:[0, 3, 0, 0, 0], b2:[0, 0, 0, 0, 0]
    
    import copy
    a= [[0]*3 for i in range(5)] #2次元配列はこう準備、[[0]*3]*5だとだめ
    b=copy.deepcopy(a)  #2次元配列はこうコピーする
    
    #内包表記奇数のみ
    odd=[i for i in range(100) if i%2==1] #[1, 3, 5, 7, 9, 11, 13, 15, 17, 19]

    #二部探索
    import bisect
    a = [1, 2, 3, 5, 6, 7, 8, 9]
    b=bisect.bisect_left(a, 8)

    #combinations、組み合わせ、順列
    from itertools import permutations, combinations,combinations_with_replacement,product
    a=['a','b','C']
    print(list(permutations(a)))
    print(list(combinations(a,2)))
    print(list(combinations_with_replacement(a,3)))


#階乗
def kaijo(n):
    import math
    return math.factorial(n)

#選び方（コンビネーション nCr）
def num_combination(n,r):
    import math
    return math.factorial(n) // math.factorial(n - r)


#最大公約数、最小公倍数
def calc_gcd(a,b):
    import fractions
    GCD=fractions.gcd(a,b)
    lcm=a*b//gcd
    return gcd,lcm

#複数の最大公約数
def calc_gcd_list(l):
    gcd = l[0]
    for i in range(1, N):
        gcd = fractions.gcd(gcd, l[i])
    return gcd

#各桁の和
def sum_digit(n):
    sum = 0
    while n > 0:
        sum += n%10
        n //= 10
    return sum

H,A = input_multiple_number()

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

Submission status: Accepted

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

print(ceil(h / a))

Submission status: Accepted

Solution code:
import math
N, M = map(int, input().split())

print(math.ceil(N/M))

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
ha = list(map(int, input().split()))
h = ha[0]
a = ha[1]

r = 0
if int(h / a) * a == h:
    r = int(h / a)
else:
    r = int(h / a) + 1

print(r)

Submission status: Accepted

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

count = 0

while H > 0 :
    H = H - A
    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:
import math

n,k = map(int,input().split())

ans = math.ceil(n/k)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

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

Submission status: Accepted

Solution code:
import math

H, A = [int(n) for n in input().split()]
print(math.ceil(H/A))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A - Serval vs Monster
H,A = map(int,input().split())

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

Submission status: Accepted

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

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:
H, A = [int(x) for x in input().split()]

ans = H // A
if ans * A < H:
    ans += 1
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
import math
H,X = map(int,(input().split()))
print(math.ceil(H/X))

Submission status: Accepted

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

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

print(a//b+(a%b!=0))

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

Submission status: Accepted

Solution code:
H, A = [int(i) for i in input().rstrip().split(' ')]
print(-(-H//A))

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
n = input()    
m = n.split()
p = [int(i) for i in m] 
import math

print(math.ceil(p[0]/p[1]))

Submission status: Accepted

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

b = H // A

if b * A == H:
    print(b)
else:
    print(b+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)

else:
    print(h//a+1)

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

Submission status: Accepted

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

ans=-(-h//a)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(r)

Submission status: Accepted

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

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

print(count)

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 = (int(x) for x in input().split())

print(math.ceil(H / A))

Submission status: Accepted

Solution code:
h_a = list(map(lambda x: int(x), input().split(" ")))
H = h_a[0]
A = h_a[1]

result = 0
while True:
    if H <= 0:
        break
    result += 1
    H -= A

print(result)

Submission status: Accepted

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

Submission status: Accepted

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


def solve(H: int, A: int):
    ans = 0
    if H % A == 0:
        ans = H // A
    else:
        ans = H // A + 1
    print(ans)
    return


# 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:
a = list(map(int,input().split()))
H = a[0]
A = a[1]
count = 0
while(1):
    count += 1
    H -= A
    if H <= 0:
        break
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
count=0
flag=True
while flag:
    N-=M
    count+=1
    if N<=0:
        flag=False
print(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 = map(int, input().split())

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

    print(H // A + 1)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read

#n,*w = [int(i) for i in read().split()]
#n,*t = map(int,read().split())

#n = int(input())
#s = input()
h,a = [int(i) for i in readline().split()]


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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

print(ans)

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

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

Submission status: Accepted

Solution code:
from __future__ import print_function

import sys
input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return


# import re
# import array
# import copy
# import functools
# import operator

# import math
# import string
import fractions
# from fractions import Fraction
from fractions import gcd

# import collections
# import itertools
# import bisect

# import heapq
# from heapq import heappush
# from heapq import heappop
# from heapq import heappushpop
# from heapq import heapify
# from heapq import heapreplace
# from queue import PriorityQueue as pq
from queue import Queue

# from itertools import accumulate

# from collections import deque
# from collections import Counter

from operator import mul
from functools import reduce


# def lcm(n,m):
#     return int(n*m/gcd(n,m))


def coprimize(p, q):
    common = fractions.gcd(p, q)
    return (p // common, q // common)


def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom

# import random
# import time

h,a = map(int, input().strip().split())
print(-(-h//a))

Submission status: Accepted

Solution code:
import math


hp, attack = map(int, input().split())

print(math.ceil(hp / attack))

Submission status: Accepted

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

ans = 0

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = math.ceil(H/A)
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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())
i = 0

while(a*i<h):
    i=i+1


print(i)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
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 + (h%a!=0))

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

ha=input().split(" ")
H=int(ha[0])
A=int(ha[1])
ans=math.ceil(H/A)
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
hp, attack = map(int,input().split())
attack_count = 0

while(hp>0):
    hp -= attack
    attack_count += 1
print(attack_count)

Submission status: Accepted

Solution code:
import math

# print('input >>')
H, A = map(int,(input().split()))

# print('-----output-----')
print(math.ceil(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:
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())
count = 0
for i in range(10**5):
    if h > 0:
        h -= a
        count += 1
    else:
        print(count)
        exit()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
h, a = map(int, input().split())
cnt = h // a
cnt += 1 if h % a > 0 else 0
print(cnt)

Submission status: Accepted

Solution code:
H, A = [int(item) for item in 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())

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

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())
cnt = 0
while(h > 0):
  h -= a
  cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H,A=[int(i) for i in input().split()]
print(H//A) if H%A==0 else print(H//A+1)

Submission status: Accepted

Solution code:
s=list(map(int,input().split()))
a=s[0]//s[1]
if s[0]%s[1]==0:
  print(int(a))
else:
  print(int(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:
h,a = map(int,input().split())
ans = 0
while h>0:
  h-=a
  ans+=1
print(ans)

Submission status: Accepted

Solution code:
from math import ceil

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

print(ceil(h/a))

Submission status: Accepted

Solution code:
from sys import stdin


def fetch_one_line():
    return stdin.readline().rstrip()


def fetch_int_input():
    return [int(s) for s in fetch_one_line().split()]


def fetch_inputs(times):
    return [fetch_one_line() for _ in range(times)]


def fetch_int_inputs(times):
    return [[int(s) for s in fetch_one_line()] for _ in range(times)]


def fetch_ints_inputs(times):
    return [fetch_int_input() for _ in range(times)]


H, A = fetch_int_input()
import math
print(math.ceil(H / A))

Submission status: Accepted

Solution code:
H,A = list(map(int, 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:
hp, attack = input().split(' ')
print(int((int(hp) + int(attack) - 1) / int(attack)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(H, A):
  if H % A == 0:
    print(H // A)
  else:
    print(H // A + 1)

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

H, A = iln()
solve(H, A)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

a,b = mi()
if a % b == 0:
    print(a//b)
else:
    print(a//b + 1)

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
import sys
from pprint import pprint
import math

def solve(h, a):
    print(int(math.ceil(h / a)))

if __name__ == '__main__':
    h, a = map(int, sys.stdin.readline().strip().split(" "))
    solve(h, a)

Submission status: Accepted

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

Submission status: Accepted

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

while t < h:
  t += a
  c += 1
  
print(c)

Submission status: Accepted

Solution code:
# coding: utf-8
h, a = [int(x) for x in input().split(" ")]
c = h / a
if c == int(c):
    c = int(c)
else:
    c = int(c) + 1
print(c)

Submission status: Accepted

Solution code:
h = list(map(int, input().split()))
count = 0
while 1:
    h[0] -= h[1]
    count += 1
    if h[0] <= 0:
        break


print(count)

Submission status: Accepted

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

print(answer)

Submission status: Accepted

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

kaisuu=H//A

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

Submission status: Accepted

Solution code:
from math import ceil

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

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



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input().rstrip().split(' ')
h = int(s[0])
a= int(s[1])
mod = h % a
div = h // a

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

Submission status: Accepted

Solution code:
# 2020/01/26
# AtCoder Beginner Contest 153 - A

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

# Calc
ans = int(h / a)
if h % a > 0:
    ans = ans + 1

# Output
print(ans)

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

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

Submission status: Accepted

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

tmp = h // a

if tmp == h/a:
    print(tmp)

else:
    print(tmp+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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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


def main():
    N, a = map(int, input().split())
    if N % a == 0:
        print(N // a)
    else:
        print(N // a + 1)


main()

Submission status: Accepted

Solution code:

h, a = list(map(int, input().split()))
n = h//a
if h%a !=0:
    n += 1

print(n)

Submission status: Accepted

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

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

Submission status: Accepted

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: 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())
cnt = 0
while a > 0:
    a = a - b
    cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

temp = H // A
if H%A != 0:
    temp += 1

print(temp)

Submission status: Accepted

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

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

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())
ans=0
while H>0:
    H-=A
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin

if __name__ == '__main__':
    h, a = [int(x) for x in stdin.readline().rstrip().split()]
    if h % a != 0:
        print(h//a + 1)
    else:
        print(h//a)

Submission status: Accepted

Solution code:
import math

h,a = map(lambda x:int(x),input().split())


print(math.ceil(h/a))

Submission status: Accepted

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

print(math.ceil(h / a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
def main():
    h,a=map(int,input().split())
    print(math.ceil(h/a))
if __name__=='__main__':
    main()

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:
N,M = map(int,input().split())
if N % M == 0:
  print(N//M)
else:
  print(N//M+1)

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())

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

Submission status: Accepted

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

times = 0
while True:
  if h <= 0:
    break
  h -= a
  times +=1

print(times)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

ans = h / a

print(math.ceil(ans))

Submission status: Accepted

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