Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a,b,c,d,e=int(input(),split())
if(a==0):
  print(1)
elif(b==0):
  print(2)
elif(c==0):
  print(3)
elif(d==0):
  print(4)
else:
  print(5)

Fixed submission:
a,b,c,d,e=list(map(int,input().split()))
if(a==0):
  print(1)
elif(b==0):
  print(2)
elif(c==0):
  print(3)
elif(d==0):
  print(4)
else:
  print(5)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=input().split()
a=list(map(int,a))
i=0
ans=1
for calc in a:
    if(0 in a==True):
        print(0)
        exit()
    ans=ans*calc
    if(ans>1000000000000000000):
        print(-1)
        exit()
    i+=1
    if(i==n):
        break
if(ans>1000000000000000000):
    print(-1)
else:
    print(ans)


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

print(a*b)

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=input().split()
a=list(map(int,a))
i=0
ans=1
for calc in a:
    if(0 in a==True):
        print(0)
        exit()
    ans=ans*a[i]
    i+=1
    if(i==n):
        break
if(ans>1000000000000000000):
    print(-1)
else:
    print(ans)


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

print(a*b)
Buggy python submission (verdict: Time Limit Exceeded):
X, t = map(int,input().split())
r = 0
cont = 0
while X > 0 and cont < t :
    X = X - 1
    cont = cont + 1
    
print(X)

Fixed submission:
X, t = map(int,input().split())
if (X - t) >= 0:
    print(X - t)
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
s,t = map(list, input().split())
k = []
for i in range(len(s)):
    k.append(s[i] == t[i])
print(len(s)-sum(k))

Fixed submission:
s = list(input())
t = list(input())
k = []
for i in range(len(s)):
    k.append(s[i] == t[i])
print(len(s)-sum(k))

Buggy python submission (verdict: Runtime Error):
s,t = map(list, input().split())
k = []
for i in range(len(s)):
    k.append(s[i] !=t[i])
print(sum(k))

Fixed submission:
s = list(input())
t = list(input())
k = []
for i in range(len(s)):
    k.append(s[i] == t[i])
print(len(s)-sum(k))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
AN = list(map(int, input().split()))

X = 1
for i in range(N):
    X = X*AN[i]
if X <= 10**18:
    print(X)
else:
    print(-1)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))

ans = 1
if 0 in A:
    print(0)
    exit()
    
for i in range(N):
    ans *= A[i]
    if ans > 10 ** 18:
        print(-1)
        exit()
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = input()
AN = list(map(int, input().split()))
X = 1
T = len(AN)
for i in range(T):
    X = X*AN[i]
    
if X <= 10**18:
    print(X)
else:
    print(-1)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))

ans = 1
if 0 in A:
    print(0)
    exit()
    
for i in range(N):
    ans *= A[i]
    if ans > 10 ** 18:
        print(-1)
        exit()
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = input()
AN = list(map(int, input().split()))
X = 1
for i in range(len(AN)):
    X = X*AN[i]

if X <= 10**18:
    print(X)
else:
    print(-1)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))

ans = 1
if 0 in A:
    print(0)
    exit()
    
for i in range(N):
    ans *= A[i]
    if ans > 10 ** 18:
        print(-1)
        exit()
print(ans)
Buggy python submission (verdict: Runtime Error):
A,B = input().split()
A = int(a)
B = int(B[0]+B[2:])
print(A*B//100)

Fixed submission:

A,B = input().split()
A = int(A)
B = int(B[0]+B[2:])
print(A*B//100)

Buggy python submission (verdict: Runtime Error):
A,B = input().split()
A = int(a)

B = int(b[0]+b[2:])
print(A*B//100)

Fixed submission:

A,B = input().split()
A = int(A)
B = int(B[0]+B[2:])
print(A*B//100)
Buggy python submission (verdict: Runtime Error):
h1,m1,h2,m2,k = map(int(input()))

a = 60(h2-h1)
b = m2-m1
##起きている合計時間
c = a+b
##勉強開始時間の最遅時間
d = c-k
print(d)

Fixed submission:
h1, m1, h2, m2, k = map(int, input().split())
##勉強できる時間
h = 60*(h2 - h1)
m = m2-m1
time = h + m - k
print(time)
Buggy python submission (verdict: Runtime Error):
X, N = map(int, input().split())
p_list = list(map(int, input().split()))

p_list = sorted(p_list)
all_range = list(range(1, 101))
A = [i for i in all_range if i not in p_list]
B = [abs(i - X) for i in A]

low = X - min(B)
high = X + min(B)

output = 0
if high > 100:
  output = low
if low < 1:
  output = high

if N == 0:
  print(X)
elif output != 0:
  print(output)
elif high in p_list:
  print(low)
elif low in p_list:
  print(high)
else:
  print(low)

Fixed submission:
X, N = map(int, input().split())
p_list = list(map(int, input().split()))

if N == 0:
  print(X)
else:
  p_list = sorted(p_list)
  all_range = list(range(102))
  A = [i for i in all_range if i not in p_list]
  B = [abs(i - X) for i in A]

  low = X - min(B)
  high = X + min(B)

  output = 0
  if high > 101:
    output = low
  if low < 0:
    output = high

  if output != 0:
    print(output)
  elif high in p_list:
    print(low)
  elif low in p_list:
    print(high)
  else:
    print(low)

Buggy python submission (verdict: Runtime Error):
X, N = map(int, input().split())
p_list = list(map(int, input().split()))

p_list = sorted(p_list)
all_range = list(range(1, 101))
A = [i for i in all_range if i not in p_list]
B = [abs(i - X) for i in A]

low = X - min(B)
high = X + min(B)

output = 0
if high > 100:
  output = low
if low < 1:
  output = high

if N == 0:
  print(X)
elif output != 0:
  print(output)
elif high in p_list:
  print(low)
elif low in p_list:
  print(high)

Fixed submission:
X, N = map(int, input().split())
p_list = list(map(int, input().split()))

if N == 0:
  print(X)
else:
  p_list = sorted(p_list)
  all_range = list(range(102))
  A = [i for i in all_range if i not in p_list]
  B = [abs(i - X) for i in A]

  low = X - min(B)
  high = X + min(B)

  output = 0
  if high > 101:
    output = low
  if low < 0:
    output = high

  if output != 0:
    print(output)
  elif high in p_list:
    print(low)
  elif low in p_list:
    print(high)
  else:
    print(low)

Buggy python submission (verdict: Runtime Error):
X, N = map(int, input().split())
p_list = list(map(int, input().split()))

p_list = sorted(p_list)
all_range = list(range(1, 101))
A = [i for i in all_range if i not in p_list]
B = [abs(i - X) for i in A]

low = X - min(B)
high = X + min(B)

if N == 0:
  print(X)
elif high in p_list:
  print(low)
else:
  print(high)

Fixed submission:
X, N = map(int, input().split())
p_list = list(map(int, input().split()))

if N == 0:
  print(X)
else:
  p_list = sorted(p_list)
  all_range = list(range(102))
  A = [i for i in all_range if i not in p_list]
  B = [abs(i - X) for i in A]

  low = X - min(B)
  high = X + min(B)

  output = 0
  if high > 101:
    output = low
  if low < 0:
    output = high

  if output != 0:
    print(output)
  elif high in p_list:
    print(low)
  elif low in p_list:
    print(high)
  else:
    print(low)
Buggy python submission (verdict: Time Limit Exceeded):
from operator import mul
from functools import reduce
N = int(input())
A = list(map(int, input().split()))

out = reduce(mul, A)

if out <= 1e18:
  print(out)
else:
  print('-1')

Fixed submission:
N = int(input())
A = list(map(int, input().split()))

A.sort(reverse=True)
out = 1
if A[-1] == 0:
  out = 0
else:
  for i in A:
    out *= i
    if out > 1e18:
      out = -1
      break
print(out)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
out = 1
for i in range(N):
  out *= A[i]

if out <= 1e18:
  print(out)
else:
  print('-1')

Fixed submission:
N = int(input())
A = list(map(int, input().split()))

A.sort(reverse=True)
out = 1
if A[-1] == 0:
  out = 0
else:
  for i in A:
    out *= i
    if out > 1e18:
      out = -1
      break
print(out)
Buggy python submission (verdict: Runtime Error):
N, M, Q = map(int, input().split())
l = []
for i in range(Q):
  l.append(list(map(int, input().split())))

A_N = [[i] for i in range(1, M+1)]
for i in range(N-1):
  a = []
  for j in range(len(A_N)):
    last = A_N[j][-1]
    for k in range(last, M+1):
      a.append(A_N[j] + [k])
  A_N = a

high_score = 0
for i in range(len(A_N)):
    A = A_N[i]
    score = 0
    for j in range(len(l)):
        aj, bj, cj, dj = l[j]
        if A[bj-1]-A[aj-1] == cj:
            score += dj
        high_score = max(high_score, score) 
        
print(high_score)

Fixed submission:
K = int(input())
A, B = map(int, input().split())

x = list(range(A, B+1))

for i in x:
  if i % K == 0:
    print('OK')
    break
  elif i == B:
    print('NG')
  else:
    pass
Buggy python submission (verdict: Runtime Error):
import math
A, B, N = map(int, input().split())

x = list(range(1, N+1))

ans = -10**20
for i in x:
  y = math.floor(A*i/B) - A * math.floor(i/B)
  if y > ans:
    ans = y
print(y)

Fixed submission:
import math
A, B, N = map(int, input().split())

x = min(B-1, N)
y = math.floor(A*x/B) - A * math.floor(x/B)
print(y)

Buggy python submission (verdict: Runtime Error):
import math
A, B, N = map(int, input().split())

x = list(range(1, N+1))

ans = -10**20
for i in x:
  y = math.floor(A*i/B) - A * math.floor(i/B)
  if y > ans:
    ans = y
  elif y < ans:
    break
print(y)

Fixed submission:
import math
A, B, N = map(int, input().split())

x = min(B-1, N)
y = math.floor(A*x/B) - A * math.floor(x/B)
print(y)

Buggy python submission (verdict: Runtime Error):
import math
A, B, N = map(int, input().split())

x = list(range(1, N+1))

ans = -10**10
for i in x:
  y = math.floor(A*i/B) - A * math.floor(i/B)
  if y > ans:
    ans = y
  elif y < ans:
    break
print(y)

Fixed submission:
import math
A, B, N = map(int, input().split())

x = min(B-1, N)
y = math.floor(A*x/B) - A * math.floor(x/B)
print(y)

Buggy python submission (verdict: Runtime Error):
import math
A, B, N = map(int, input().split())

x = list(range(1, N+1))

ans = -10**10
for i in x:
  y = math.floor(A*i/B) - A * math.floor(i/B)
  if y > ans:
    ans = y
  elif y < ans:
    break
print(y)

Fixed submission:
import math
A, B, N = map(int, input().split())

x = min(B-1, N)
y = math.floor(A*x/B) - A * math.floor(x/B)
print(y)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))

for i in range(1, N+1):
  print(A.count(i))

Fixed submission:
import math

R = int(input())
output = 2* R * math.pi

print(output)
Buggy python submission (verdict: Time Limit Exceeded):
import math
from functools import reduce

K = int(input())

def gcd_list(numbers):
  return reduce(math.gcd, numbers)

output = 0

for a in range(1, K+1):
  for b in range(1, K+1):
    for c in range(1, K+1):
      output += gcd_list([a, b, c])

print(output)

Fixed submission:
import math
from functools import reduce

K = int(input())

def gcd(*numbers):
  return reduce(math.gcd, numbers)

output = 0

for a in range(1, K+1):
  for b in range(a, K+1):
    for c in range(b, K+1):
      if a == b == c:
        output += gcd(a, b, c)
      elif a != b and b != c and c != a:
        output += 6 * gcd(a, b, c)
      else:
        output += 3 * gcd(a, b, c)

print(output)
Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int, input().split())

I = N // K
n = N

for i in range(I+2):
  N = abs(N - K)
  if N < n:
    n = N

print(n)

Fixed submission:
N, K = map(int, input().split())

I = N // K
J = N % K
j = J

if J == 0:
  pass
else:
  j = J
  for i in range(I+2):
    J = abs(J - K)
    if J <= j:
      j = J
    else:
      break
      
print(j)
Buggy python submission (verdict: Runtime Error):
A, B, C, D = map(int, input().split())

def gcd(C, D):
  if C >= D:
    tmp = C
    C = D
    D = tmp
  gcd = 1  
  for i in range(D-C+1):
    dif_1 = D % C
    if C % dif_1 == 0:
      gcd = dif_1
      break
    D = C
    C = dif_1
  return gcd

gcd = gcd(C, D)
lcm = C * D // gcd
a_c = (A-1) // C
a_d = (A-1) // D
b_c = B // C
b_d = B // D
a_lcm = (A-1) // lcm
b_lcm = B // lcm
count = (B - A + 1) - ((b_c - a_c) + (b_d - a_d) - (b_lcm - a_lcm))
print(int(count))

Fixed submission:
import fractions
A, B, C, D = map(int, input().split())

gcd = fractions.gcd(C, D)
lcm = C * D // gcd
a_c = (A-1) // C
a_d = (A-1) // D
b_c = B // C
b_d = B // D
a_lcm = (A-1) // lcm
b_lcm = B // lcm
count = (B - A + 1) - ((b_c - a_c) + (b_d - a_d) - (b_lcm - a_lcm))
print(int(count))

Buggy python submission (verdict: Runtime Error):
A, B, C, D = map(int, input().split())

def gcd(C, D):
  if C >= D:
    tmp = C
    C = D
    D = tmp
  gcd = 1  
  for i in range(D-C+1):
    dif_1 = D % C
    if C % dif_1 == 0:
      gcd = C
      break
    D = C
    C = dif_1
  return gcd

gcd = gcd(C, D)
lcm = C * D // gcd
a_c = (A-1) // C
a_d = (A-1) // D
b_c = B // C
b_d = B // D
a_lcm = (A-1) // lcm
b_lcm = B // lcm
count = (B - A + 1) - ((b_c - a_c) + (b_d - a_d) - (b_lcm - a_lcm))
print(int(count))

Fixed submission:
import fractions
A, B, C, D = map(int, input().split())

gcd = fractions.gcd(C, D)
lcm = C * D // gcd
a_c = (A-1) // C
a_d = (A-1) // D
b_c = B // C
b_d = B // D
a_lcm = (A-1) // lcm
b_lcm = B // lcm
count = (B - A + 1) - ((b_c - a_c) + (b_d - a_d) - (b_lcm - a_lcm))
print(int(count))

Buggy python submission (verdict: Runtime Error):
A, B, C, D = map(int, input().split())

def gcd(C, D):
  if C >= D:
    tmp = C
    C = D
    D = tmp
  gcd = 1  
  for i in range(D-C+1):
    dif_1 = D % C
    if C % dif_1 == 0:
      gcd = dif_1
      break
    D = C
    C = dif_1
  return gcd

gcd = gcd(C, D)
lcm = C * D // gcd
a_c = (A-1) // C
a_d = (A-1) // D
b_c = B // C
b_d = B // D
a_lcm = (A-1) // lcm
b_lcm = B // lcm
count = (B - A + 1) - ((b_c - a_c) + (b_d - a_d) - (b_lcm - a_lcm))
print(int(count))

Fixed submission:
import fractions
A, B, C, D = map(int, input().split())

gcd = fractions.gcd(C, D)
lcm = C * D // gcd
a_c = (A-1) // C
a_d = (A-1) // D
b_c = B // C
b_d = B // D
a_lcm = (A-1) // lcm
b_lcm = B // lcm
count = (B - A + 1) - ((b_c - a_c) + (b_d - a_d) - (b_lcm - a_lcm))
print(int(count))
Buggy python submission (verdict: Runtime Error):
P, Q, R =map(int ,input().split(','))
print(min(P+Q, Q+R, R+P))

Fixed submission:
P, Q, R =map(int ,input().split())
print(min(P+Q, Q+R, R+P))

Buggy python submission (verdict: Runtime Error):
P, Q, R = int(input()), int(input()), int(input())
print(min(P+Q, Q+R, R+P))

Fixed submission:
P, Q, R =map(int ,input().split())
print(min(P+Q, Q+R, R+P))

Buggy python submission (verdict: Runtime Error):
P, Q, R = int(input('P:')), int(input('Q:')), int(input('R:'))
print(P, Q, R)
print(min(P+Q, Q+R, R+P))

Fixed submission:
P, Q, R =map(int ,input().split())
print(min(P+Q, Q+R, R+P))

Buggy python submission (verdict: Runtime Error):
P, Q, R = int(input('P:')), int(input('Q:')), int(input('R:'))
print(P, Q, R)
print(min(P+Q, Q+R, R+P))

Fixed submission:
P, Q, R =map(int ,input().split())
print(min(P+Q, Q+R, R+P))
Buggy python submission (verdict: Runtime Error):
a - int(input())

print(a+a**2+a**3)

Fixed submission:
a = int(input())

print(a+(a**2) + (a**3))
Buggy python submission (verdict: Runtime Error):
a = inputs()
if a.isupper():
  print("A")
else:
  print("a")

Fixed submission:
a = input()
if a.isupper():
  print("A")
else:
  print("a")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [int(i) for i in input().split()]
q = int(input())

replace = []
for _ in range(q):
  m, n = [int(i) for i in input().split()]
  replace.append((m,n))

l = len(a)
res = sum(a)
for r in replace:
  for i in range(l): 
    if a[i] == r[0]:
      res += r[1] - r[0]
      a[i] = r[1]
  print(res)

Fixed submission:
n = int(input())
a = [int(i) for i in input().split()]
a_dict = {}
for i in a:
  if i not in a_dict:
    a_dict[i] = 1
  else:
    a_dict[i] += 1

q = int(input())

replace = []
for _ in range(q):
  m, n = [int(i) for i in input().split()]
  replace.append((m,n))

res = sum([m*n for m,n in a_dict.items()])

for r in replace:
  if r[0] in a_dict:
    res += (r[1] - r[0])*a_dict[r[0]]
    
    if r[1] in a_dict:
      a_dict[r[1]] += a_dict[r[0]]
    else:
      a_dict[r[1]] = a_dict[r[0]]
    a_dict[r[0]] = 0

  print(res)
Buggy python submission (verdict: Runtime Error):
X, num = [int(i) for i in input().split(" ")]
l = [int(i) for i in input().split(" ")]
 
if num == 0:
  print(X)
else:
  for i in range(num):
    if X-i not in l:
      print(X-i)
      exit()
    elif X+i not in l:
      print(X+i)
      exit()
  print(X-num)

Fixed submission:
X, num = [int(i) for i in input().split(" ")]

 
if num == 0:
  print(X)
else:
  l = [int(i) for i in input().split(" ")]
  for i in range(num):
    if X-i not in l:
      print(X-i)
      exit()
    elif X+i not in l:
      print(X+i)
      exit()
  print(X-num)

Buggy python submission (verdict: Runtime Error):
X, num = [int(i) for i in input().split(" ")]
l = [int(i) for i in input().split(" ")]

if num == 0:
  print(X)
else:
  for i in range(num):
    if X-i not in l:
      print(X-i):
      exit()
    elif X+i not in l:
      print(X+i)
      exit()
  print(X-num)

Fixed submission:
X, num = [int(i) for i in input().split(" ")]

 
if num == 0:
  print(X)
else:
  l = [int(i) for i in input().split(" ")]
  for i in range(num):
    if X-i not in l:
      print(X-i)
      exit()
    elif X+i not in l:
      print(X+i)
      exit()
  print(X-num)
Buggy python submission (verdict: Runtime Error):
num = int(input())
l = [int(i) for i in input().split(" ")]

deny = False

for ele in l:
  if ele%2==0:
    if ele%3!=0 and ele%5!=0:
      print("DENIED")
      deny = True
      break;

if !deny:
  print("APPROVED)

Fixed submission:
num = int(input())
l = [int(i) for i in input().split(" ")]
 
deny = False
 
for ele in l:
  if ele%2==0:
    if ele%3!=0 and ele%5!=0:
      print("DENIED")
      deny = True
      break;
 
if not deny:
  print("APPROVED")
Buggy python submission (verdict: Runtime Error):
num = int(input())
i = [int(input()) for _ in range(num)]

count_dict = {}
for ele in i:
  if ele not in count_dict:
    count_dict[ele] = 1
  else:
    count_dict[ele] += 1

max_count = max(count_dict.values())
max_str = [a for a in count_dict if count_dict[a] == max_count]
for string in sorted(max_str):
  print(string)

Fixed submission:
num = int(input())
i = [input() for _ in range(num)]
 
count_dict = {}
for ele in i:
  if ele not in count_dict:
    count_dict[ele] = 1
  else:
    count_dict[ele] += 1
 
max_count = max(count_dict.values())
max_str = [a for a in count_dict if count_dict[a] == max_count]
for string in sorted(max_str):
  print(string)

Buggy python submission (verdict: Runtime Error):
num = int(input())
i = [int(input()) for _ in range(num)]

count_dict = {}
for ele in i:
  if ele not in count_dict:
    count_dict[ele] = 1
  else:
    count_dict[ele] += 1
    
max_count = max(count_dict.values())
max_str = [a for a in count_dict if count_dict[a] == max_count]
for string in sorted(max_str):
  print(string)

Fixed submission:
num = int(input())
i = [input() for _ in range(num)]
 
count_dict = {}
for ele in i:
  if ele not in count_dict:
    count_dict[ele] = 1
  else:
    count_dict[ele] += 1
 
max_count = max(count_dict.values())
max_str = [a for a in count_dict if count_dict[a] == max_count]
for string in sorted(max_str):
  print(string)
Buggy python submission (verdict: Time Limit Exceeded):
num = input()
str_list = input().split(" ")
 
yes = True
 
for index, s in enumerate(str_list):
	if s in str_list[:index]:
		yes = False
		break
if yes:
	print("YES")
else:
	print("NO")

Fixed submission:
num = input()
str_list = input().split(" ")
 
yes = True
num_dict = {}
for s in str_list:
	if s in num_dict:
		yes = False
		break
	else:
		num_dict[s] = 1
if yes:
	print("YES")
else:
	print("NO")

Buggy python submission (verdict: Runtime Error):
num = input()
str_list = input.split(" ")
 
yes = True

for index, s in enumerate(str_list):
	if s in str_list[:index]:
		yes = False
		break
if yes:
	print("YES")
else:
	print("NO")

Fixed submission:
num = input()
str_list = input().split(" ")
 
yes = True
num_dict = {}
for s in str_list:
	if s in num_dict:
		yes = False
		break
	else:
		num_dict[s] = 1
if yes:
	print("YES")
else:
	print("NO")

Buggy python submission (verdict: Runtime Error):
num = int(input())
str_list = input.split(" ")

yes = True
 
for index, s in enumerate(str_list):
	if s in str_list[:index]:
		yes = False
		break
if yes:
	print("YES")
else:
	print("NO")

Fixed submission:
num = input()
str_list = input().split(" ")
 
yes = True
num_dict = {}
for s in str_list:
	if s in num_dict:
		yes = False
		break
	else:
		num_dict[s] = 1
if yes:
	print("YES")
else:
	print("NO")

Buggy python submission (verdict: Runtime Error):
num = int(input())
str_list = input.split(" ")

yes = True
 
for index, s in enumerate(str_list):
	if s in str_list[:index]:
    	yes = False
		break
if yes:
	print("YES")
else:
	print("NO")

Fixed submission:
num = input()
str_list = input().split(" ")
 
yes = True
num_dict = {}
for s in str_list:
	if s in num_dict:
		yes = False
		break
	else:
		num_dict[s] = 1
if yes:
	print("YES")
else:
	print("NO")

Buggy python submission (verdict: Runtime Error):
num = int(input())
str_list = input.split(" ")

yes = True

for index, s in enumerate(str_list):
	if s in str_list[:index]:
    	yes = False
   		break
if yes:
	print("YES")
else:
	print("NO")

Fixed submission:
num = input()
str_list = input().split(" ")
 
yes = True
num_dict = {}
for s in str_list:
	if s in num_dict:
		yes = False
		break
	else:
		num_dict[s] = 1
if yes:
	print("YES")
else:
	print("NO")

Buggy python submission (verdict: Runtime Error):
num = int(input())
str_list = input.split(" ")
 
num_dict = {}
yes = True
for s in str_list:
  if s in num_dict:
    yes = False
    break
  else:
    num_dict[s] = 1
if yes:
  print("YES")
else:
  print("NO")

Fixed submission:
num = input()
str_list = input().split(" ")
 
yes = True
num_dict = {}
for s in str_list:
	if s in num_dict:
		yes = False
		break
	else:
		num_dict[s] = 1
if yes:
	print("YES")
else:
	print("NO")

Buggy python submission (verdict: Runtime Error):
num = int(input())
str_list = input.split(" ")

num_dict = {}
for s in str_list:
  if s in num_dict:
    print("NO")
    return
  else:
    num_dict[s] = 1
print("YES")

Fixed submission:
num = input()
str_list = input().split(" ")
 
yes = True
num_dict = {}
for s in str_list:
	if s in num_dict:
		yes = False
		break
	else:
		num_dict[s] = 1
if yes:
	print("YES")
else:
	print("NO")
Buggy python submission (verdict: Runtime Error):
H, A = input().split(" ")
H = int(H)
A = int(A)
return (H+A-1)//A

Fixed submission:
H, A = input().split(" ")
H = int(H)
A = int(A)
print((H+A-1)//A)

Buggy python submission (verdict: Runtime Error):
H, A = input().split(" ")
return (H+A-1)//A

Fixed submission:
H, A = input().split(" ")
H = int(H)
A = int(A)
print((H+A-1)//A)

Buggy python submission (verdict: Runtime Error):
H, A = input().split(" ")
print((H+A-1)//A)

Fixed submission:
H, A = input().split(" ")
H = int(H)
A = int(A)
print((H+A-1)//A)

Buggy python submission (verdict: Runtime Error):
H, A = input()
num = (H + (A-1))//A
print(num)

Fixed submission:
H, A = input().split(" ")
H = int(H)
A = int(A)
print((H+A-1)//A)
Buggy python submission (verdict: Runtime Error):
H, N = input().split(" ")
A = list(map(int, input().split()))
if sum(A) < H:
  print("No")
else:
  print("Yes")

Fixed submission:
H, N = input().split(" ")
A = list(map(int, input().split()))
if sum(A) < int(H):
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
H, N = input().split(" ")
A = input()
A = [int(a) for a in A]
if sum(A) < H:
  print("No")
else:
  print("Yes")

Fixed submission:
H, N = input().split(" ")
A = list(map(int, input().split()))
if sum(A) < int(H):
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
H, N = input().split(" ")
A = input()
if sum(A) < H:
  print("No")
else:
  print("Yes")

Fixed submission:
H, N = input().split(" ")
A = list(map(int, input().split()))
if sum(A) < int(H):
  print("No")
else:
  print("Yes")