Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [int(input()) for i in range(n)]
if 0 in a:
  total = 0
else:
  total=1
  for i in a:
    total *= i
    if total > 10**8:
      total = -1
      break
print(total)


Fixed submission:
n = int(input())
cnt = 1
l = list(map(int, input().split()))
if 0 in l:
    print(0)
else:
    for i in l:
        cnt *= i
        if cnt > 10 ** 18:
            print(-1)
            exit()
        else:
            pass
    print(cnt)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
if 0 in a:
  total = 0
  break
else:
  total=1
  for i in a:
    total *= i
    if total > 10**8:
      total = -1
      break
print(total)


Fixed submission:
n = int(input())
cnt = 1
l = list(map(int, input().split()))
if 0 in l:
    print(0)
else:
    for i in l:
        cnt *= i
        if cnt > 10 ** 18:
            print(-1)
            exit()
        else:
            pass
    print(cnt)
Buggy python submission (verdict: Runtime Error):
, B, C, K = map(int, input().split())
print(max(K, A)+min(0, K-A-B))

Fixed submission:
A, B, C, K = map(int, input().split())
print(min(K, A)-max(0, K-A-B))

Buggy python submission (verdict: Runtime Error):
, B, C, K = map(int, input().split())
print(min(K, A)-max(0, K-A-B))

Fixed submission:
A, B, C, K = map(int, input().split())
print(min(K, A)-max(0, K-A-B))
Buggy python submission (verdict: Runtime Error):
X = int(input())
deposit = 100
year = 0
while (deopsit<X):
  deposit = deposit*101//100
  year += 1
print(year)

Fixed submission:
X = int(input())
year = 0
deposit = 100
while deposit < X:
    deposit = deposit*101//100
    year += 1
print(year)
Buggy python submission (verdict: Runtime Error):
N = int(input())
for i in range(1,1+N):
  if N % 3 != 0 or N%5 !=0:
    x += i
print(x)

Fixed submission:
N = int(input())
x = 0
for i in range(1, N+1):
    if (i % 3) != 0 and (i % 5) != 0:
        x = x+i
print(x)

Buggy python submission (verdict: Runtime Error):
N = int(input())
for i in range N:
  if i % 3 ==0 or i % 5 ==0:
    x += i
print(x)
  

Fixed submission:
N = int(input())
x = 0
for i in range(1, N+1):
    if (i % 3) != 0 and (i % 5) != 0:
        x = x+i
print(x)
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = sorted(list(map(int,input().split())))
a_list=[]
for i in a[:m]:
  if sum(a)/(a*m) > i:
    print('No')
    exit()
  else:
    a_list.append(i)
print('Yes')

Fixed submission:
n,m = map(int,input().split())
a = sorted(list(map(int,input().split())),reverse=True)
b = sum(a)/(4*m)
c=[]
for i in a[:m]:
  if i >= b:
    c.append(i)

if len(c) == m:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
S = input()
print('Yes' len(set(S)) == 2 else 'No')

Fixed submission:
S = input()
print('Yes' if len(set(S)) == 2 else 'No')
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [i for i in map(int,input().split())]
Check = Fasle
check_list=[]
for s in range(n):
  if a[s]%2 == 0:
    check_list.append(a[s])
for t in range(len(check_list)):
  if check_list[t]%3 == 0 or check_list[t]%5==0:
    Check =True
if Check:
  print('APPROVED')
else:
  print('DENIED')

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans=0
ans2=0
for i in a:
  if i % 2 == 0:
    ans +=1
    if i % 3 == 0 or i % 5 == 0:
      ans2 +=1
if ans == ans2:
  print('APPROVED')
else:
  print('DENIED')
Buggy python submission (verdict: Runtime Error):
Suji=[]
for i in range(1,9):
  Suji.append(i)
N = int(input())
Suji_check=False
for s in Suji:
  A = N%s
  try A != 0:
      for t in Suji:
      if A == t:
        Suji_check = True
  except:
    pass
if Suji_check:
  print('Yes')
else:
  print('No')


Fixed submission:
N = int(input())
Suji_check = False
for s in range(1,10):
  for t in range(1,10):
    if s*t == N:
      Suji_check = True
      break
if Suji_check:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
Suji=[]
for i in range(1:9):
  Suji.append(i)
N = int(input())
Suji_check=False
for s in Suji:
  A = N%s
  try A != 0:
      for t in Suji:
      if A == t:
        Suji_check = True
  except:
    pass
if Suji_check:
  print('Yes')
else:
  print('No')


Fixed submission:
N = int(input())
Suji_check = False
for s in range(1,10):
  for t in range(1,10):
    if s*t == N:
      Suji_check = True
      break
if Suji_check:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
Suji=[]
for i in range(1:9):
  Suji.append(i)
N = int(input())
Suji_check=False
for s in Suji:
  A = N%s
  for t in Suji:
    if A == t:
      Suji_check = True
if Suji_check:
  print('Yes')
else:
  print('No')

Fixed submission:
N = int(input())
Suji_check = False
for s in range(1,10):
  for t in range(1,10):
    if s*t == N:
      Suji_check = True
      break
if Suji_check:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
N = int(input())
D = map(int,input().split())
count=0
for i in range(N):
  for j in D[i+1:]:
    A = D[i]*j
    count+=A
print(A)


Fixed submission:
N = int(input())
D = list(map(int,input().split()))
count=0
for i in range(N-1):
  for j in D[i+1:]:
    A = D[i]*j
    count+=A
print(count)

Buggy python submission (verdict: Runtime Error):
N = int(input())
D = list(map(int,input().split()))
count=0
for i in range(N):
  for j in d[i+1:]:
    A = d[i]*j
    count+=A
print(A)

Fixed submission:
N = int(input())
D = list(map(int,input().split()))
count=0
for i in range(N-1):
  for j in D[i+1:]:
    A = D[i]*j
    count+=A
print(count)
Buggy python submission (verdict: Runtime Error):
weather = ["Sunny","Cloudy","Rainly"]
S = input()
print(weather[(weather.index(S)+1)%3])


Fixed submission:
weather = ["Sunny","Cloudy","Rainy"]
S = input()
print(weather[(weather.index(S)+1)%3])

Buggy python submission (verdict: Runtime Error):
weather = ["Sunny","Cloudy","Rainly"]
S = input()
print(wether[(weather.index(S)+1)%3])

Fixed submission:
weather = ["Sunny","Cloudy","Rainy"]
S = input()
print(weather[(weather.index(S)+1)%3])
Buggy python submission (verdict: Runtime Error):
A, B = map(int,input().split())
con,out = 0,1
for out < B:
  out = out -1
  out = out + A
  con += 1
print(con)
  

Fixed submission:
import math
A,B = map(int,input().split())
print(1+math.ceil((B-A)/(A-1)))
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
total=0
for i in a:
  total += 1/a
print(1/total)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
total=0
for i in a:
  total += 1/i
print(1/total)
Buggy python submission (verdict: Runtime Error):
K,X = map(int,input().split())
for i in range((K-X+1):(K+X)):
  print(i,end=" ")

Fixed submission:
K,X = map(int,input().split())
for i in range(X-K+1,K+X):
  print(i,end=" ")
Buggy python submission (verdict: Runtime Error):
print(3*((int(input())**2))

Fixed submission:
a = int(input())
print(3*a**2)
Buggy python submission (verdict: Runtime Error):
N,L = map(int,input().split())
l = []
ll = []
for i in range(1,N+1):
  l.append(L+i-1)
  ll.append(abs(L+i-1))
a = l.index(min(ll))
print(sum(l)-l[a])


Fixed submission:
n, l = map(int, input().split())
a = []
b = []
for i in range(1,n+1):
    a.append(l+i-1)
    b.append(abs(l+i-1))
x = b.index(min(b))
print(sum(a)-a[x])

Buggy python submission (verdict: Runtime Error):
N,L = map(int,input().split())
l = []
ll = []
for i in range(1,N+1):
  l.append(L+i-1)
  ll.append(abs(L+i-1))
a = l.index(min(ll))
print(sum(l)-a)

Fixed submission:
n, l = map(int, input().split())
a = []
b = []
for i in range(1,n+1):
    a.append(l+i-1)
    b.append(abs(l+i-1))
x = b.index(min(b))
print(sum(a)-a[x])
Buggy python submission (verdict: Runtime Error):
n,x = map(int,input().split())
l = list(map(int,input().split()))
d = 0
count=1
for i in range(n):
  d += n[i]
  if d<=x:
    count+=1
print(count)

Fixed submission:
n,x = map(int,input().split())
l = list(map(int,input().split()))
d = 0
count=1
for i in range(n):
  d += l[i]
  if d<=x:
    count+=1
print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
W = list(map(int,input().split()))
L = []
for i in range(1,N):
  L.append(abs(sum(N[:i])-sum(N[i:])))
print(min(L))


Fixed submission:
N = int(input())
W = list(map(int,input().split()))
L = []
for i in range(1,N):
  L.append(abs(sum(W[:i])-sum(W[i:])))
print(min(L))

Buggy python submission (verdict: Runtime Error):
N = int(input())
W = map(int,input().split())
L = []
for i in range(1,N):
  L.append(abs(sum(N[:i])-sum(N[i:])))
print(min(L))

Fixed submission:
N = int(input())
W = list(map(int,input().split()))
L = []
for i in range(1,N):
  L.append(abs(sum(W[:i])-sum(W[i:])))
print(min(L))
Buggy python submission (verdict: Runtime Error):
n = int(input())
L=[]
for i in range(n):
  s,p=input()
  L.append([s,int(p),i+1])
list.sort(L,reverse=True)
for i in range(n):
  print(L[i][2])

Fixed submission:
n = int(input())
L=[]
for i in range(n):
  s,p=input().split()
  L.append([s,-int(p),i+1])
list.sort(L)
for i in range(n):
  print(L[i][2])
Buggy python submission (verdict: Runtime Error):
A,B,C = map(int,input().split())
print(min(B//A,C)

Fixed submission:
A,B,C = map(int,input().split())
print(min(B//A,C))
Buggy python submission (verdict: Runtime Error):
T,X = input().split()
print(T/X)

Fixed submission:
T,X = map(float,input().split())
print(T/X)
Buggy python submission (verdict: Runtime Error):
N = input()
L = [int(input()) for i in range(N)]
print("Yes" if sum(L) > 2*max(L) else "No")

Fixed submission:
input()
L = list(map(int, input().split()))
print("Yes" if sum(L) > 2*max(L) else "No")

Buggy python submission (verdict: Runtime Error):
N = int(input())
L = [int(input()) for i in range(N)]
print('Yes' if sum(L)-max(L) > max(L) and sum(L) -max(L) == max(L) + 1 else 'No')


Fixed submission:
input()
L = list(map(int, input().split()))
print("Yes" if sum(L) > 2*max(L) else "No")

Buggy python submission (verdict: Runtime Error):
N = int(input())
L = [int(input()) for i in range(N)]
print('Yes' if sum(L)-max(L) > max(L) else 'No')

Fixed submission:
input()
L = list(map(int, input().split()))
print("Yes" if sum(L) > 2*max(L) else "No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
p = [int(input()) for i in N]
print(sorted(p)[-1]//2 + sum(sorted(p)[:N-1]))

Fixed submission:
N = int(input())
p = [int(input()) for i in range(N)]
print(sorted(p)[-1]//2 + sum(sorted(p)[:N-1]))
Buggy python submission (verdict: Runtime Error):
n = input()
print(n.replace('1','x').replace('9','1').replace('x','9')

Fixed submission:
n = input()
print(n.replace('1','x').replace('9','1').replace('x','9'))
Buggy python submission (verdict: Runtime Error):
a,b,c = sorted(int(input().split()))
print(c*10+b+a)

Fixed submission:
a,b,c = sorted(map(int,input().split()))
d=str(c)+str(b)
print(a+int(d))
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
print(A*B-(A+B-1))

Fixed submission:
A,B = map(int,input().split())
print(A*B-(A+B-1))
Buggy python submission (verdict: Runtime Error):
*a = map(int,input().split())
print(max(a)-min(a))

Fixed submission:
a,b,c = sorted(map(int,input().split()))
print(c-b + b-a)
Buggy python submission (verdict: Runtime Error):
a,b,c,k = map(int,input().split())
count = 0
if k = 0:
  print(a-b)
  exit()

while count = k:
  a1 = a
  b1 = b
  c1 = c
  a = b1+c1
  b = a1+c1
  c = a1+b1
  count +=1
print(a-b)


Fixed submission:
a,b,c,k = map(int,input().split())
if k % 2 == 0:
  print(a-b)
else:
  print(b-a)
Buggy python submission (verdict: Runtime Error):
n = [int(input()) for i in range(int(input()))]
m = [int(input()) for i in range(int(input()))]
l = list(set(n))
print(max(0,(n.count(l[i])-m.count(l[i])) for i in range(len(l))))

Fixed submission:
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))

Buggy python submission (verdict: Runtime Error):
n = [int(input()) for i in range(int(input()))]
m = [int(input()) for i in range(int(input()))]
print(max(len(set(n))-len(set(m)),0))


Fixed submission:
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))

Buggy python submission (verdict: Runtime Error):
n = [int(input()) for i in range(int(input()))]
m = [int(input()) for i in range(int(input()))]
print(min(len(set(n))-len(set(m)),0))

Fixed submission:
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))
Buggy python submission (verdict: Runtime Error):
S = input()
S[3:4] = '8'
print(S)

Fixed submission:
S = input()
print('2018' + S[4:])
Buggy python submission (verdict: Runtime Error):
N = int(input())
d = [int(input()) for i in N]
print(len(set(d)))


Fixed submission:
print(len(set([int(input()) for _ in range(int(input()))])))

Buggy python submission (verdict: Runtime Error):
N = int(input())
d = [int(input()) for i in N]
print(set(d))

Fixed submission:
print(len(set([int(input()) for _ in range(int(input()))])))

Buggy python submission (verdict: Runtime Error):
N = int(input())
d = list([int(input()) for i in range(N)])
print(d.count())

Fixed submission:
print(len(set([int(input()) for _ in range(int(input()))])))
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
import math
print(math.ceil((a+b)/2)

Fixed submission:
import math
a,b = map(int,input().split())
print(math.ceil((a+b)/2))
Buggy python submission (verdict: Runtime Error):
a,b,c,d = input().split()
print('Yes' if a == b == c or b == c == d or a == b == d or a == c == d else 'No')


Fixed submission:
a,b,c,d = input()
print('Yes' if a == b == c or b == c == d else 'No')
Buggy python submission (verdict: Runtime Error):
a,b,c,d = input().split()
pm = '+-'
for i in pm:
  for j in pm:
    for k in pm:
      total = a+i+b+j+c+k+d
      if eval(total) == 7:
        print(total+'=7')
        exit()

Fixed submission:
A = input()
n = len(A)-1
for i in range(2**n):
  pn = ['-']*n
  for j in range(n):
    if ((i>>j)&1):
      pn[n-1-j] = '+'
  ans = A[0]+pn[0]+A[1]+pn[1]+A[2]+pn[2]+A[3]
  
  if eval(ans) == 7:
    print(ans+'=7')
    break
Buggy python submission (verdict: Runtime Error):
N = int(input())
print(int(N**(0.5))

Fixed submission:
N = int(input())
x = int(N**(1/2))
print(x*x)
Buggy python submission (verdict: Runtime Error):
N = int(input())
if N in 9:
  print("Yes")
else:
  print("No")

Fixed submission:
N = input()
if "9" in N:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
s = input()
a = int(len(s))
x = []
while i <= a:
  if i == 0:
    i = 1
    x.append(s[i])
  else:
    i += 2
    x.append(s[i])
print(x,end=',')

Fixed submission:
s = input()
print(s[::2])
Buggy python submission (verdict: Runtime Error):
N = int(input())
print('Yes' if N[0] == N[-1] else 'No')

Fixed submission:
N = input()
print('Yes' if N[0] == N[-1] else 'No')
Buggy python submission (verdict: Runtime Error):
print((int(input())-1)*(int(input())-1))

Fixed submission:
n,m = map(int,input().split())
print((n-1)*(m-1))

Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
pritn(n+m-1)

Fixed submission:
n,m = map(int,input().split())
print((n-1)*(m-1))

Buggy python submission (verdict: Runtime Error):
n = int(input())
m = int(input())
print(n+m-1)

Fixed submission:
n,m = map(int,input().split())
print((n-1)*(m-1))

Buggy python submission (verdict: Runtime Error):
n = int(input())
m = int(input())
print(n*m - 1)

Fixed submission:
n,m = map(int,input().split())
print((n-1)*(m-1))
Buggy python submission (verdict: Runtime Error):
a,*b,c = input().split()
print(a+str(len(b))+c)


Fixed submission:
a = input()
print(a[0]+str(len(a)-2)+a[-1])

Buggy python submission (verdict: Runtime Error):
a,*b,c = input().split()
print(a+len(b)+c)

Fixed submission:
a = input()
print(a[0]+str(len(a)-2)+a[-1])
Buggy python submission (verdict: Runtime Error):
abc=lint(map(int,input().split()))
print(sum(sorted(abc)[:2]))

Fixed submission:
a,b,c = sorted(map(int,input().split()))
print(a+b)
Buggy python submission (verdict: Runtime Error):
a,b == input().split()
print("H" if a == b else "D")

Fixed submission:
a,b = input().split()
print('H' if a==b else 'D')
Buggy python submission (verdict: Runtime Error):
a,b,c = input().split()
print(a+" "+b+" "+c)

Fixed submission:
a,b,c = input().split(',')
print(a,b,c)

Buggy python submission (verdict: Runtime Error):
a,b,c = input().split()
print(a,b,c)

Fixed submission:
a,b,c = input().split(',')
print(a,b,c)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(input().split())
print(a[0]+b[0]+c[0])

Fixed submission:
print("A"+input()[8]+"C")
Buggy python submission (verdict: Runtime Error):
s = input()
n = len(s-1)
total=0
for i in range(2**n):
  pl=['']*n
  ans=''
  for j in range(n):
    if ((i>>j)&1):
      pl[n-1-j] = '+'
  for k in range(n):
    ans += s[k]+pl[k]
  ans+=s[-1]
  total += eval(ans)

print(total)

Fixed submission:
S = input()

res_list = []

for i in range(2**(len(S)-1)):
    temp_s = ''
    for j in range(len(S)):
        temp_s += S[j]
        if ((i >> j) & 1):
            temp_s += '+'
    # print(temp_s)
    res_list.append(temp_s)

temp_S_list = [eval(item) for item in res_list]

print(sum(temp_S_list))
Buggy python submission (verdict: Runtime Error):
n,l = map(int,input().ssplit())
s = sorted([input() for i in range(n)])
print(*s,sep="")

Fixed submission:
n,l = map(int,input().split())
s = sorted([input() for i in range(n)])
print(*s,sep='')

Buggy python submission (verdict: Runtime Error):
n,l = map(int,input().ssplit())
s = sorted([int(input()) for i in range(n)])
print(*s,sep="")

Fixed submission:
n,l = map(int,input().split())
s = sorted([input() for i in range(n)])
print(*s,sep='')

Buggy python submission (verdict: Runtime Error):
N,L = map(int,input().split())
s = sorted([int(innput()) for i in range(N)])
print(*s,sep="")

Fixed submission:
n,l = map(int,input().split())
s = sorted([input() for i in range(n)])
print(*s,sep='')
Buggy python submission (verdict: Runtime Error):
n = long(input())
a = [long(x) for x in input().split()]

ans=1
for i in range(n):
	ans*=a[i]
	if(ans>1000000000000000000):
		break;
	if(ans==0):
		break;

if(ans>1000000000000000000):
	print(-1)
else:
	print(ans)


Fixed submission:
n = int(input())
a = [int(x) for x in input().split()]

abc=0

for i in range(n):
	if(a[i]==0):
		abc=1
		break
if(abc==1):
	print(0)
else:
	ans=1
	for i in range(n):
		ans*=a[i]
		if(ans>1000000000000000000):
			break

	if(ans>1000000000000000000):
		print(-1)
	else:
		print(ans)

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

ans=1
for i in range(n):
	ans*=a[i]

if(ans>1000000000000000000):
	print(-1)
else:
	print(ans)

Fixed submission:
n = int(input())
a = [int(x) for x in input().split()]

abc=0

for i in range(n):
	if(a[i]==0):
		abc=1
		break
if(abc==1):
	print(0)
else:
	ans=1
	for i in range(n):
		ans*=a[i]
		if(ans>1000000000000000000):
			break

	if(ans>1000000000000000000):
		print(-1)
	else:
		print(ans)
Buggy python submission (verdict: Runtime Error):
import sys
import math
import collections
import heapq

def set_debug(debug_mode=False):
    if debug_mode:
        fin = open('input.txt', 'r')
        sys.stdin = fin


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


if __name__ == '__main__':
    set_debug(True)

    # t = int(input())
    t = 1

    for ti in range(1, t + 1):
        n = int(input())

        A = int_input()

        A.sort(reverse=True)

        res = sum(A[:-1])

        print(res)



Fixed submission:
import sys
import math
import collections
import heapq

def set_debug(debug_mode=False):
    if debug_mode:
        fin = open('input.txt', 'r')
        sys.stdin = fin


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


if __name__ == '__main__':
    # set_debug(True)

    # t = int(input())
    t = 1

    for ti in range(1, t + 1):
        n = int(input())

        A = int_input()

        A.sort()

        res = A[-1]
        for i in range(len(A)-2):
            res += A[-(i//2)-2]
        print(res)
Buggy python submission (verdict: Runtime Error):
import sys
import math
import collections

def set_debug(debug_mode=False):
    if debug_mode:
        fin = open('input.txt', 'r')
        sys.stdin = fin


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


if __name__ == '__main__':
    # set_debug(True)

    t = input()
    
    if t.is_upper():
        print('A')
    else:
        print('a')

    

Fixed submission:
import sys
import math
import collections
 
def set_debug(debug_mode=False):
    if debug_mode:
        fin = open('input.txt', 'r')
        sys.stdin = fin
 
 
def int_input():
    return list(map(int, input().split()))
 
 
if __name__ == '__main__':
    # set_debug(True)
 
    t = input()
    
    if 'A' <= t <= 'Z':
        print('A')
    else:
        print('a')
Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())
if n >= 10:
  return k
else:
  return n + 100 * (10-k)

Fixed submission:
n, k = map(int, input().split())
if n >= 10:
  print(k)
else:
  print(k + 100 * (10-n))
Buggy python submission (verdict: Runtime Error):
import math
A=[float(a) for a in input().split()]
a=math.sqrt(A[0])
b=math.sqrt(A[1])
c=math.sqrt(A[2])
B=('%.1000f'%(a+b))
C=('%.1000f'%c)
if (B) < C:
    print('Yes')
else:
    print('No')

Fixed submission:
K=int(input())
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(list[K-1])

Buggy python submission (verdict: Runtime Error):
import math
A=[float(a) for a in input().split()]
if round(math.sqrt(A[0],100))+round(math.sqrt(A[1],100))<round(math.sqrt(A[2],100)):
    print('Yes')
else:
    print('No')

Fixed submission:
K=int(input())
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(list[K-1])

Buggy python submission (verdict: Runtime Error):
A = [int(a) for a in input().split()]
masu=int((A[0]*A[1]/2)+0.5)
if A[1]==1 or A[0]==1:
    print(1)
else:
    print(masu)

Fixed submission:
K=int(input())
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(list[K-1])
Buggy python submission (verdict: Runtime Error):
S=input()
if S[0]==S[1] and S[1]==S[2]:
    print('No')
else:
    print('Yes')

Fixed submission:
S=input()
if S[0]==S[1] and S[1]==S[2]:
    print('No')
else:
    print('Yes')

Buggy python submission (verdict: Runtime Error):
S=input('S')
if S[0]==S[1] and S[1]==S[2]:
    print('No')
else:
    print('Yes')

Fixed submission:
S=input()
if S[0]==S[1] and S[1]==S[2]:
    print('No')
else:
    print('Yes')