Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
h, w = map(int, input().split())
pict = [[0]*(w+2) for _ in range(h+2)]

for y in range(1, h+1):
    pict[y][1:w+1] = list(input())
ans = "Yes"
for y in range(h):
    for x in range(w):
        if pict[x][y] == "#":
            if pict[x-1][y] == "." and pict[x+1][y] == "." and pict[x][y-1] == "." and pict[x][y+1] == ".":
                ans = "No"
print(ans)


Fixed submission:
h, w = map(int, input().split())
pict = [[0]*(w+2) for _ in range(h+2)]

for y in range(1, h+1):
    pict[y][1:w+1] = list(input())
ans = "Yes"
for y in range(h):
    for x in range(w):
        if pict[y][x] == "#":
            if pict[y-1][x] == "." and pict[y+1][x] == "." and pict[y][x-1] == "." and pict[y][x+1] == ".":
                ans = "No"
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
a, b, k = map(int, input().split())

for i in range(a, b+1):
    if i < a+k or b-k < i:
        print(i)

Fixed submission:
a, b, k = map(int, input().split())

for i in range(a, min(b+1, a+k)):
    print(i)
for i in range(max(b-k+1, a+k), b+1):
    print(i)

Buggy python submission (verdict: Time Limit Exceeded):
a, b, k = map(int, input().split())

for i in range(a, b+1):
    if i < a+k or b-k < i:
        print(i)


Fixed submission:
a, b, k = map(int, input().split())

for i in range(a, min(b+1, a+k)):
    print(i)
for i in range(max(b-k+1, a+k), b+1):
    print(i)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in set(a):
    temp = a.count(i)
    if temp > i:
        ans += temp - i
    elif temp < i:
        ans += temp

print(ans)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
dic = {}
for i in a:
    if i not in dic:
        dic[i] = 1
    else:
        dic[i] += 1
ans = 0
for k, v in dic.items():
    if k > v:
        ans += v
    elif k < v:
        ans += v-k

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(1, max(a) + 1):
    temp = a.count(i)
    if temp > i:
        ans += temp - i
    elif temp < i:
        ans += temp

print(ans)


Fixed submission:
n = int(input())
a = list(map(int, input().split()))
dic = {}
for i in a:
    if i not in dic:
        dic[i] = 1
    else:
        dic[i] += 1
ans = 0
for k, v in dic.items():
    if k > v:
        ans += v
    elif k < v:
        ans += v-k

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

counter = 0

for a in A:
    for b in B:
        if a < b:
            for c in C:
                if b < c:
                    counter = counter + 1
                else:
                    pass
        else:
            pass

print(counter)


Fixed submission:
import bisect

N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

A = sorted(A)
C = sorted(C)

counter = 0

for k in range(N):
    i = bisect.bisect_left(A, B[k])
    j = N - bisect.bisect_right(C, B[k])
    counter += i * j

print(counter)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

counter = 0

for a in A:
    for b in B:
        if a < b:
            for c in C:
                if b < c:
                    counter = counter + 1
                else:
                    counter = counter
        else:
            counter = counter

print(counter)

Fixed submission:
import bisect

N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

A = sorted(A)
C = sorted(C)

counter = 0

for k in range(N):
    i = bisect.bisect_left(A, B[k])
    j = N - bisect.bisect_right(C, B[k])
    counter += i * j

print(counter)
Buggy python submission (verdict: Runtime Error):
N = int(input())
K = int(input())
number = 1

for i in N:
    if number * 2 < number + K:
        number = number * 2
    else:
        number = number + K

print(number)

Fixed submission:
N = int(input())
K = int(input())
number = 1

for i in range(N):
    if number * 2 < number + K:
        number = number * 2
    else:
        number = number + K

print(number)
Buggy python submission (verdict: Time Limit Exceeded):
k, s = map(int, input().split())
count = 0

for i in range(k+1):
    for j in range(k+1):
        for m in range(k+1):
            if i+j+m == s:
                count += 1

print(count)

Fixed submission:
k, s = map(int, input().split())
count = 0

for i in range(k+1):
    for j in range(k+1):
        t = s - (i + j)
        if 0 <= t and t <= k:
            count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
n = int(input())

if n%2 == 0:
    print(n/2)
else:
    print(math.floor(n/2)+1)

Fixed submission:
import math

n = int(input())

if n%2 == 0:
    print(n//2)
else:
    print(math.floor(n//2)+1)

Buggy python submission (verdict: Runtime Error):
n = int(input())

if n%2 == 0:
    print(n/2)
else:
    print(math.floor(n/2)+1)

Fixed submission:
import math

n = int(input())

if n%2 == 0:
    print(n//2)
else:
    print(math.floor(n//2)+1)
Buggy python submission (verdict: Runtime Error):
n,k = map(int, input().split())

if n%k == 0:
    sabun == 0
else:
    min_mai = n//k
    max_mai = min_mai + n%k
    sabun = max_mai- min_mai
print(sabun)


Fixed submission:
n,k = map(int, input().split())
 
if n%k == 0:
    sabun = 0
else:
    sabun = 1
print(sabun)

Buggy python submission (verdict: Runtime Error):
n,k = map(int, input().split())

if n%k == 0:
    sabun == 0
else:
    min_mai = n//k
    max_mai = min_mai + n%k
    sabun = max_mai- min_mai
print(sabun)


Fixed submission:
n,k = map(int, input().split())
 
if n%k == 0:
    sabun = 0
else:
    sabun = 1
print(sabun)
Buggy python submission (verdict: Runtime Error):
x,a,b = map(int, input().split())

if abs(x-a) > abs(x-b):
    print(B)
else:
    print(A)

Fixed submission:
x,a,b = map(int, input().split())

if abs(x-a) > abs(x-b):
    print('B')
else:
    print('A')
Buggy python submission (verdict: Runtime Error):


ab = input().split(' ')
a = ''
if ord(ab[0]) > ord(ab[1]):
  for i in range(int(ab[0])):
    a += ab[1]
else:
  for i in range(int(ab[1])):
    a += ab[0]
    
print(a)

Fixed submission:
mn = input().split(' ')
print('Yes') if int(mn[0]) == int(mn[1]) else print('No')
Buggy python submission (verdict: Runtime Error):
'''
n = int(input())
seq = [int(e) for e in input().split(' ')]

count = 0
for i in seq:
  number_loop = len(seq[0:seq.index(i)+1])
  for idx, j in enumerate(seq[0:seq.index(i)+1]):
    if i > j:
      break
    if idx+1 == number_loop:
      count += 1
      
print(count)
'''

n = int(input())
seq = [int(e) for e in input().split(' ')]

count = 1

for idx, i in enumerate(seq[1:]):
  if i > seq[idx+2]:
   continue
  else:
    count += 1
print(count)


Fixed submission:
n = int(input())
seq = [int(e) for e in input().split(' ')]

count = 1

current_min = seq[0]

for idx, i in enumerate(seq[1:]):
  if i < current_min:
    current_min = i
    count += 1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
seq = [int(e) for e in input().split(' ')]

count = 0
for i in seq:
  number_loop = len(seq[0:seq.index(i)+1])
  for idx, j in enumerate(seq[0:seq.index(i)+1]):
    if i > j:
      break
    if idx+1 == number_loop:
      count += 1
      
print(count)
      

Fixed submission:
n = int(input())
seq = [int(e) for e in input().split(' ')]

count = 1

current_min = seq[0]

for idx, i in enumerate(seq[1:]):
  if i < current_min:
    current_min = i
    count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
import sys

N, M = input().split(' ')
p_acwa_dict = {}
cnt_ac = 0
cnt_wa = 0
pre_p = 0
for line in sys.stdin:
  p, s = line.rstrip().split()
  p = int(p)
  
  if pre_p > 0 and pre_p != p:
    pre_acwa_cnt_dict = p_acwa_dict[pre_p]
    if pre_acwa_cnt_dict['AC'] > 0:
      cnt_ac += pre_acwa_cnt_dict['AC']
      cnt_wa += pre_acwa_cnt_dict['WA']
      
  pre_p = p
  acwa_cnt_dict = p_acwa_dict.setdefault(p, {'AC': 0, 'WA': 0})
  if acwa_cnt_dict['AC'] > 0:
    continue
  acwa_cnt_dict[s] += 1

pre_acwa_cnt_dict = p_acwa_dict[pre_p]
if pre_acwa_cnt_dict['AC'] > 0:
  cnt_ac += pre_acwa_cnt_dict['AC']
  cnt_wa += pre_acwa_cnt_dict['WA']
print("{} {}".format(cnt_ac, cnt_wa))

Fixed submission:
import sys

N, M = input().split(' ')
p_acwa_dict = {}
cnt_ac = 0
cnt_wa = 0
pre_p = 0
for line in sys.stdin:
  p, s = line.rstrip().split()
  p = int(p)
      
  pre_p = p
  acwa_cnt_dict = p_acwa_dict.setdefault(p, {'AC': 0, 'WA': 0})
  
  if acwa_cnt_dict['AC'] > 0:
    continue
    
  if s == 'AC':
    acwa_cnt_dict['AC'] += 1
    cnt_ac += 1
    cnt_wa += acwa_cnt_dict['WA']
  elif s == 'WA':
    acwa_cnt_dict['WA'] += 1

print("{} {}".format(cnt_ac, cnt_wa))
Buggy python submission (verdict: Runtime Error):
n = input()
x = n%10
if x == 3 :
  print("bon")
else x == 0 || x == 1 || x == 6 || x == 8 :
  print("pon")
else :
  print("hon")

Fixed submission:
n = int(input())
d = int(str(n)[-1])
t = {'bon':[3], 'pon':[0,1,6,8], 'hon':[2,4,5,7,9]}
for s in t:
  if d in t[s]:
    print(s)
Buggy python submission (verdict: Runtime Error):
n=input()
if n%2==0:
    print(n//2)
else:
    print(n//2+1)
    

Fixed submission:
n=int(input())
if n%2==0:
    print(n//2)
else:
    print(n//2+1)

Buggy python submission (verdict: Runtime Error):
s=input()
if s%2==0:
    print(s//2)
else:
    print(s//2+1)
    

Fixed submission:
n=int(input())
if n%2==0:
    print(n//2)
else:
    print(n//2+1)

Buggy python submission (verdict: Runtime Error):
s=input()
if s%2==0:
    print(s//2)
else:
    print(s//2+1)
    

Fixed submission:
n=int(input())
if n%2==0:
    print(n//2)
else:
    print(n//2+1)

Buggy python submission (verdict: Runtime Error):
s=input()
if s%2==0:
    print(s//2)
else:
    print(s//2+1)

Fixed submission:
n=int(input())
if n%2==0:
    print(n//2)
else:
    print(n//2+1)
Buggy python submission (verdict: Runtime Error):
s = input
t = input
if s[-1] = ["t"]:
    print("yes")
else:
    print("no")

Fixed submission:
s = input()
t = input()
if s == t[:-1]:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
s = print()
if s == "ABC":
    print("ARC")
else s == "ARC":
    print("ABC")


Fixed submission:
s = input()
if s == "ABC":
    print("ARC")
else:
    print("ABC")
Buggy python submission (verdict: Runtime Error):
import numpy as np
import math 
A, B, H, M = map(int, input().split())

pai = math.pi
angle = 2*pai*((H+M/60)/12 - M/60)

distance = np.sqrt(A**2+B**2-2*A*B*np.cos(angle))
print(distance)


Fixed submission:
i = int(input())
s = i % 10
if s in [2, 4, 5, 7, 9]:
  print("hon")
elif s in [0, 1, 6, 8]:
  print("pon")
else:
  print("bon")

Buggy python submission (verdict: Runtime Error):
K = int(input())
S = input()

if (len(S) <= K):
  print(S)
else:
  S = S[0:K] + "..."
  print(S)


Fixed submission:
i = int(input())
s = i % 10
if s in [2, 4, 5, 7, 9]:
  print("hon")
elif s in [0, 1, 6, 8]:
  print("pon")
else:
  print("bon")
Buggy python submission (verdict: Runtime Error):
import numpy as np
A = int(input())
B = int(input())
H = int(input())
M = int(input())

pai = 3.14
angle = 2*pai*(H/12- M/60)

distance = np.sqrt(A**2+B**2-2*A*B*np.cos(angle))
print(distance)


Fixed submission:
import numpy as np
import math 
A, B, H, M = map(int, input().split())

pai = math.pi
angle = 2*pai*((H+M/60)/12 - M/60)

distance = np.sqrt(A**2+B**2-2*A*B*np.cos(angle))
print(distance)
Buggy python submission (verdict: Runtime Error):
import  re

ss = input()
ps = r"A|C|G|T"

seq = []
counter = 0
for s in ss:
    if re.match(ps, s):
        counter += 1
        seq.append(counter)
    else:
        counter = 0
    
print(max(seq))

Fixed submission:
import  re

ss = input()
ps = r"A|C|G|T"

seq = []
counter = 0
for s in ss:
    if re.match(ps, s):
        counter += 1
        seq.append(counter)
    else:
        counter = 0
seq.append(counter)
print(max(seq))

Buggy python submission (verdict: Runtime Error):
ss = input()
ps = "ACGT"

seq = []
counter = 0
for s in ss:
    if s in ps:
        counter += 1
        seq.append(counter)
    else:
        counter = 0
    
print(max(seq))

Fixed submission:
import  re

ss = input()
ps = r"A|C|G|T"

seq = []
counter = 0
for s in ss:
    if re.match(ps, s):
        counter += 1
        seq.append(counter)
    else:
        counter = 0
seq.append(counter)
print(max(seq))

Buggy python submission (verdict: Runtime Error):
ss = input()
ps = "ACGT"

seq = []
counter = 0
for s in ss:
    if s in ps:
        counter += 1
        seq.append(counter)
    else:
        counter = 0
    
print(max(seq))

Fixed submission:
import  re

ss = input()
ps = r"A|C|G|T"

seq = []
counter = 0
for s in ss:
    if re.match(ps, s):
        counter += 1
        seq.append(counter)
    else:
        counter = 0
seq.append(counter)
print(max(seq))
Buggy python submission (verdict: Runtime Error):
s = input()
print(S)

Fixed submission:
s = input()
bonlist = ["3"]
ponlist = ["0","1","6","8"]
if str(s)[-1] in bonlist:
  	print("bon")
elif str(s)[-1] in ponlist:
  	print("pon")
else:
  	print("hon")
Buggy python submission (verdict: Runtime Error):
A,B = map(int, input().split())
count = 0
socketnumber = A
while socketnumber < B:
    socketnumber += (A-1)
    count += 1
count += 1
print (count)
    

Fixed submission:
S = input()
T = input()
count = 0
forecastlist = []
realweatherlist = []
for forecast in S:
  forecastlist.append(forecast)
for weather in T:
  realweatherlist.append(weather)
  
for i in range(3):
  if forecastlist[i] == realweatherlist[i]:
    count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
a,b,c,k = (int(x) for x in input().split())
answer = 0
answer += min(a,k)
k = k - min(a,k)
k = k - min(b-k)
answer -= min(c,k)
print(answer)

Fixed submission:
a,b,c,k = (int(x) for x in input().split())
answer = 0
answer += min(a,k)
k = k - min(a,k)
k = k - min(b,k)
answer -= min(c,k)
print(answer)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,c,k = (int(x) for x in input().split())
answer = 0
for i in range(k):
    if a>0:
        answer += 1
        a -= 1
    elif b > 0:
        b -= 1
    else:
        answer -= 1
        c -= 1
        pass
    pass
print(answer)

Fixed submission:
a,b,c,k = (int(x) for x in input().split())
answer = 0
answer += min(a,k)
k = k - min(a,k)
k = k - min(b,k)
answer -= min(c,k)
print(answer)
Buggy python submission (verdict: Runtime Error):
n = int(input())
line = input().split(" ")

s = line[0]
t = line[1]

for i in range(0, len(s)) 
	print(s[i], end="")
  	print(t[i], end="")


Fixed submission:
n = int(input())
line = input().split(" ")
 
s = line[0]
t = line[1]
 
for i in range(0, len(s)): 
  print(s[i], end="")
  print(t[i], end="")

Buggy python submission (verdict: Runtime Error):
s = input()
t = input()

for i in range(0, len(s)) 
	print(s[i], end="")
  	print(s[i], end="")


Fixed submission:
n = int(input())
line = input().split(" ")
 
s = line[0]
t = line[1]
 
for i in range(0, len(s)): 
  print(s[i], end="")
  print(t[i], end="")
Buggy python submission (verdict: Runtime Error):
import sys
 
def main():
  N = int(input())
  L = [0,1,6,8]
  n_last = int(N[-1])
  if n_last == 3:
    print("bon")
  elif (n_last in L):
    print("pon")
  else:
    print("hon")
 
    
main()

Fixed submission:
import sys
 
def main():
  N = str(input())
  L = [0,1,6,8]
  n_last = int(N[-1])
  if n_last == 3:
    print("bon")
  elif (n_last in L):
    print("pon")
  else:
    print("hon")
 
    
main()

Buggy python submission (verdict: Runtime Error):
import sys

def main():
  N = int(input())
  L = [0,1,6,8]
  
  if N[-1] == 3:
    print("bon")
  elif N[-1] in L:
    print("pon")
  else:
    print("hon")
 
    
main()

Fixed submission:
import sys
 
def main():
  N = str(input())
  L = [0,1,6,8]
  n_last = int(N[-1])
  if n_last == 3:
    print("bon")
  elif (n_last in L):
    print("pon")
  else:
    print("hon")
 
    
main()

Buggy python submission (verdict: Runtime Error):
import sys
 
L = [0,1,6,8]
 
def main():
  N = int(input())
  
  if N[-1] == 3:
    print("bon")
  elif N[-1] in L:
    print("pon")
  else:
    print("hon")
 
    
main()

Fixed submission:
import sys
 
def main():
  N = str(input())
  L = [0,1,6,8]
  n_last = int(N[-1])
  if n_last == 3:
    print("bon")
  elif (n_last in L):
    print("pon")
  else:
    print("hon")
 
    
main()

Buggy python submission (verdict: Runtime Error):
import sys
 
 
def main():
  N = int(input())
  
  if N[-1] == 3:
    print("bon")
  elif N[-1] in (0,1,6,8):
    print("pon")
  else:
    print("hon")
 
    
main()

Fixed submission:
import sys
 
def main():
  N = str(input())
  L = [0,1,6,8]
  n_last = int(N[-1])
  if n_last == 3:
    print("bon")
  elif (n_last in L):
    print("pon")
  else:
    print("hon")
 
    
main()

Buggy python submission (verdict: Runtime Error):
import sys

L = [0,1,6,8]

def main():
  N = int(input())
  
  if N[-1] == 3:
    print("bon")
  elif N[-1] in [0,1,6,8]:
    print("pon")
  else:
    print("hon")

    
main()

Fixed submission:
import sys
 
def main():
  N = str(input())
  L = [0,1,6,8]
  n_last = int(N[-1])
  if n_last == 3:
    print("bon")
  elif (n_last in L):
    print("pon")
  else:
    print("hon")
 
    
main()
Buggy python submission (verdict: Time Limit Exceeded):
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('f1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def g(r, s):
  res = 1
  f = 1
  for i in range(1, r+s+3):
    f *= i
    f %= M

  fs = 1
  for i in range(1, s+2):
    fs *= i
    fs %= M

  fr = 1
  for i in range(1, r+2):
    fr *= i
    fr %= M

  res *= pow(fr, M-2, M)
  res *= pow(fs, M-2, M)

  res *= f
  res %= M
  return res


M = 10 ** 9 + 7
def main():
    r1, c1, r2, c2 = read_int_list()
    res = 0
    res += g(r2, c2) - g(r2, c1-1) - g(r1-1, c2) + g(r1-1, c1-1)
    res %= M
    print(res)


main()


Fixed submission:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('f1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


M = 10 ** 9 + 7
f = [1] * (2*10**6+4)
for i in range(1, 2*10**6+3):
  f[i] = f[i-1] * i
  f[i] %= M


def g(r, s):
  res = 1
  frs = f[r+s+2]
  fs = f[s+1]
  fr = f[r+1]

  res *= pow(fr, M-2, M)
  res *= pow(fs, M-2, M)

  res *= frs
  res %= M
  return res


def main():
    r1, c1, r2, c2 = read_int_list()
    res = 0
    res += g(r2, c2) - g(r2, c1-1) - g(r1-1, c2) + g(r1-1, c1-1)
    res %= M
    print(res)


main()
Buggy python submission (verdict: Runtime Error):
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    H, A = read_int_list()
    res = 0
    for i in range(n):
      H = H - A
      res += 1
      if H <= 0:
        break
    print(res)


main()


Fixed submission:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    H, A = read_int_list()
    res = 0
    for i in range(10001):
      H = H - A
      res += 1
      if H <= 0:
        break
    print(res)


main()

Buggy python submission (verdict: Runtime Error):
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    H, A = read_int_list()
    res = 0
    for i in range(n):
      H = H - A
      res += 1
    if H <= 0:
      break
    print(res)


main()


Fixed submission:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    H, A = read_int_list()
    res = 0
    for i in range(10001):
      H = H - A
      res += 1
      if H <= 0:
        break
    print(res)


main()

Buggy python submission (verdict: Runtime Error):
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    H, A = read_int_list
    res = 0
    for i in range(n):
      H = H - A
      res += 1
    if H <= 0:
      break
    print(res)


main()


Fixed submission:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    H, A = read_int_list()
    res = 0
    for i in range(10001):
      H = H - A
      res += 1
      if H <= 0:
        break
    print(res)


main()
Buggy python submission (verdict: Runtime Error):
N = input(int)
M = input(int)
if N == M:
    print('Yes')
else:
    print('No')

Fixed submission:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n, m = read_int_list()
    if n > m:
      res = 'No'
    else:
      res = 'Yes'
    print(res)


main()

Buggy python submission (verdict: Runtime Error):
def P(N, M):
  if N = M:
    print('Yes')
  else:
    print('No')

Fixed submission:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n, m = read_int_list()
    if n > m:
      res = 'No'
    else:
      res = 'Yes'
    print(res)


main()

Buggy python submission (verdict: Runtime Error):
def P(N, M):
  if N > M;
  	return No
  return Yes

Fixed submission:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n, m = read_int_list()
    if n > m:
      res = 'No'
    else:
      res = 'Yes'
    print(res)


main()