Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
x,y=map(int,input().split())

if x==y:
  print(-1)
elif y==1:
  print(-1)
else:
  for i in range(1,10**10):
    if x*i>10**18:
      break
    elif x*i%y !=0:
      print(x*i)
      break


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

if x%y==0:
  print(-1)
else:
  print(x)

Buggy python submission (verdict: Time Limit Exceeded):
x,y=map(int,input().split())

if x==y:
  print(-1)
elif y==1:
  print(-1)
else:
  for i in range(1,10**10):
    if x*i%y !=0:
      print(x*i)
      break


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

if x%y==0:
  print(-1)
else:
  print(x)

Buggy python submission (verdict: Time Limit Exceeded):
x,y=map(int,input().split())

if x==y:
  print(-1)
elif y==1:
  print(-1)
else:
  for i in range(1,10**10):
    if x*i%y !=0:
      print(x*i)

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

if x%y==0:
  print(-1)
else:
  print(x)
Buggy python submission (verdict: Runtime Error):
r=int(input())
g=int(input())

print(2g-r)

Fixed submission:
r=int(input())
g=int(input())

print(2*g-r)

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

print(2g-r)

Fixed submission:
r=int(input())
g=int(input())

print(2*g-r)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input())

if a==c:
  print(b)
elif a==b:
  print(c)
else:
  print(a)

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

if a==c:
  print(b)
elif a==b:
  print(c)
else:
  print(a)
Buggy python submission (verdict: Runtime Error):
s=map(int,input().split())

s.sort()

print((s[0])+(s[1]))

Fixed submission:
s=list(map(int,input().split()))
 
s.sort()
 
print(s[0]+s[1])
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3

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

d={}
for i in range(m):
    a,b=map(int,input().split())
    if a in d:
        d[a]=d[a]+1
    else:
        d[a]=1

    if b in d:
        d[b]=d[b]+1
    else:
        d[b]=1

for i in range(n):
    print(d[i+1])


Fixed submission:
#!/usr/bin/env python3

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

d={}
for i in range(m):
    a,b=map(int,input().split())
    if a in d:
        d[a]=d[a]+1
    else:
        d[a]=1

    if b in d:
        d[b]=d[b]+1
    else:
        d[b]=1

for i in range(n):
    if i+1 in d:
        print(d[i+1])
    else:
        print(0)
Buggy python submission (verdict: Runtime Error):
a,op,b = input().split()

if op="+":
  print(int(a)+int(b))
elif op="-":
  print(int(a)-int(b))

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

if op=="+":
  print(int(a)+int(b))
elif op=="-":
  print(int(a)-int(b))
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split)

if a==b+c:
  print("Yes")
elif b==a+c:
  print("Yes")
elif c==a+b:
  print("Yes")

print("No")
      
        

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

if a==b+c:
  print("Yes")
elif b==a+c:
  print("Yes")
elif c==a+b:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())

for a in range(1, 10):
  for b in range(a, 10):
    if n = a * b:
      print('Yes')
      exit()

print('No')


Fixed submission:
n = int(input())

for a in range(1, 10):
  for b in range(a, 10):
    if n == a * b:
      print('Yes')
      exit()

print('No')
Buggy python submission (verdict: Runtime Error):
import math
n = int(input())
m = int(math.sqrt(n))

ans = n - 1

for a in range(m):
  if n % a == 0:
    b = n // a
    ans = min(ans, a + b - 2)
    
print(ans)

Fixed submission:
import math
n = int(input())
m = int(math.sqrt(n)) + 1

ans = n - 1

for a in range(2, m):
  if n % a == 0:
    ans = min(ans, a + n//a - 2)
    
print(ans)
Buggy python submission (verdict: Runtime Error):
import math

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

v = (a * a * b)/2

if x >= v:
  print(math.degree(math.atan(2*(2*v-x)/(a**3))))
else:
  print(math.degree(math.atan(v/x)))

Fixed submission:
import math

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

v = (a * a * b)/2

if x >= v:
  print(math.degrees(math.atan(2*(2*v-x)/(a**3))))
else:
  print(math.degrees(math.atan((a*b*b)/(2*x))))
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()

b = ''
b += b + s[0]

for i in range(1, n):
  if s[i] != s[i-1]:
    b += b + s[i]

print(b)

Fixed submission:
n = int(input())
s = input()

ans = 1

for i in range(1, n):
  if s[i] != s[i-1]:
    ans += 1

print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()
if s == 'Sunny':
  print('Cloudy')
elid s == 'Cloudy':
  print('Rainy')
else:
  print('Sunny')

Fixed submission:
s = input()
if s == 'Sunny':
  print('Cloudy')
elif s == 'Cloudy':
  print('Rainy')
else:
  print('Sunny')
Buggy python submission (verdict: Time Limit Exceeded):
n, m = map(int, input().split())
import sys
input = sys.stdin.readline
a = list(map(int, input().split()))

from itertools import combinations_with_replacement
from itertools import groupby

ans = float("inf")
x =sum(a)

for i in combinations_with_replacement(range(n), m):
  m = x
  lis = list(i)
  for j, k in groupby(lis):
    m -= a[j]
    m += a[j]//(2**len(list(k)))
  ans = min(ans, m)
  
print(ans)


Fixed submission:
import heapq
N, M = map(int, input().split())
A = list(map(int, input().split()))
A =[-a for a in A]

heapq.heapify(A)
  
for i in range(M):
  curr = -heapq.heappop(A)
  heapq.heappush(A, -(curr//2))
  
print(-sum(A))

Buggy python submission (verdict: Time Limit Exceeded):
n, m = map(int, input().split())

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

from itertools import combinations_with_replacement
from itertools import groupby

ans = float("inf")
x =sum(a)

for i in combinations_with_replacement(range(n), m):
  m = x
  lis = list(i)
  for j, k in groupby(lis):
    m -= a[j]
    m += a[j]//(2**len(list(k)))
  ans = min(ans, m)
  
print(ans)

Fixed submission:
import heapq
N, M = map(int, input().split())
A = list(map(int, input().split()))
A =[-a for a in A]

heapq.heapify(A)
  
for i in range(M):
  curr = -heapq.heappop(A)
  heapq.heappush(A, -(curr//2))
  
print(-sum(A))
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
q,r=divmod(b-a,a-1)
if r==0:
  print(q+1)
else:
  print((q+2)
  

Fixed submission:
a,b=map(int,input().split())
q,r=divmod(b-a,a-1)
if r==0:
  print(q+1)
else:
  print(q+2)
Buggy python submission (verdict: Runtime Error):
n=int(input())
h=list(map(int,input().split()))
def f(i):
  if i==n-1:
    return 0
  if i<n-1 and h[i]>=h[i+1]:
    return f(i+1)+1
  return 0
m=0
for i in range(n):
  m=max(f(i),m)
print(m)


Fixed submission:
n = int(input())
h = list(map(int, input().split()))

c = 0
a = 0   
for i in range(n-1):
  if h[i] >= h[i+1]:
    c += 1
  else:
    a = max(c, a)
    c = 0
    
a = max(c, a)    
print(a)

Buggy python submission (verdict: Runtime Error):
n=int(input())
h=list(map(int,input().split()))
def f(i):
  if i==n-1:
    return 0
  if i<n-1 and h[i]>=h[i+1]:
    return f(i+1)+1
  if i<n-1 and h[i]<h[i+1]:
    return 0
m=0
for i in range(n):
  m=max(f(i),m)
print(m)

Fixed submission:
n = int(input())
h = list(map(int, input().split()))

c = 0
a = 0   
for i in range(n-1):
  if h[i] >= h[i+1]:
    c += 1
  else:
    a = max(c, a)
    c = 0
    
a = max(c, a)    
print(a)
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
    
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
    
ans = 0
for i in range(n):
  if a[i] <= b[i]:
    ans += a[i]
    b[i] -= a[i]
  if a[i + 1] <= b[i]:
    ans += a[i + 1]
    a[i + 1] = 0
  else:
    ans += b[i]
    a[i + 1] -= b[i]
  else:
    ans += b[i] 
    
print(ans)

Fixed submission:
import sys
input = sys.stdin.readline
    
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
    
ans = 0
for i in range(n):
  if a[i] <= b[i]:
    ans += a[i]
    b[i] -= a[i]
    if a[i + 1] <= b[i]:
      ans += a[i + 1]
      a[i + 1] = 0
    else:
      ans += b[i]
      a[i + 1] -= b[i]
  else:
    ans += b[i] 
    
print(ans)
Buggy python submission (verdict: Runtime Error):
N=int(input())
a=[int(input()) for i in range(N)]
b=sorted(a)[::-1]
for i in range(N):
  if a[i]=b[0]:
    print(b[1])
  else:
    print(b[0])
    

Fixed submission:
N=int(input())
a=[int(input()) for i in range(N)]
b=sorted(a)[::-1]
for i in range(N):
  if a[i]==b[0]:
    print(b[1])
  else:
    print(b[0])

Buggy python submission (verdict: Runtime Error):
N=int(input())
a=[int(input()) for i in range(N)]
b=a
for i in range(N):
  print(max(a.remove(a[i])))
  a=b


Fixed submission:
N=int(input())
a=[int(input()) for i in range(N)]
b=sorted(a)[::-1]
for i in range(N):
  if a[i]==b[0]:
    print(b[1])
  else:
    print(b[0])

Buggy python submission (verdict: Runtime Error):
N=int(input())
a=[int(input()) for i in range(N)]
for i in range(N):
  print(max(a.remove(a[i])))

Fixed submission:
N=int(input())
a=[int(input()) for i in range(N)]
b=sorted(a)[::-1]
for i in range(N):
  if a[i]==b[0]:
    print(b[1])
  else:
    print(b[0])
Buggy python submission (verdict: Runtime Error):
n,a,b-map(int,input().split())
print(min(a*n,b))

Fixed submission:
n,a,b=map(int,input().split())
print(min(a*n,b))
Buggy python submission (verdict: Runtime Error):
import numpy as np
n,d=map(int,input().split())
v=[]
for i in range(n):
  v.append(np.array(list(map(int,input().split()))))
  
ans=0
for i in range(n-1):
  for j in range(i+1,n):
    dist=np.linalg.norm(v[i]-v[j], ord = 2)
    if int(dist) == dist:
      ans += 1

print(ans)


Fixed submission:
import numpy as np
n,d=map(int,input().split())
v=[]
for i in range(n):
  v.append(np.array(list(map(int,input().split()))))
  
ans=0
for i in range(n-1):
  for j in range(i+1,n):
    dist=np.linalg.norm(v[i]-v[j], ord = 2)
    if int(dist) == dist:
      ans += 1

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n, m = map(int, input().split())

s=set()
l, r = map(int, input().split())
for i in range(l, r+1):
  s.add(i)
  
for i in range(m-1):
  l, r = map(int, input().split())
  t = set()
  for j in range(l, r+1):
    t.add(j)
    
  s = s & t
  
print(len(s))

Fixed submission:
n, m = map(int, input().split())

max_left = 1
min_right = n

for i in range(m):
    left, right = map(int, input().split())
    max_left = max(max_left, left)
    min_right = min(min_right, right)

print(max(min_right - max_left + 1, 0))
Buggy python submission (verdict: Runtime Error):
n, k = map(int,input().split())
s = input()
print(s.replace(s[k],s[k].lower()))


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

ans = ""
for i, j in enumerate(list(s)): 
  if i == k - 1:
    ans += j.lower()
  else:
    ans += j

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n, q = map(int, input().split())
s = input()

for i in range(q):
  l, r = map(int, input().split())
  print(s[l-1:r].count('AC'))

Fixed submission:
N, Q = map(int, input().split())
S = input()
t = [0] * (N + 1)
for i in range(N):
  t[i + 1] = t[i] + (1 if S[i : i + 2] == 'AC' else 0)
for i in range(Q):
  l, r = map(int, input().split())
  print(t[r-1] - t[l-1])

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

for i in range(q):
  l, r = map(int, input().split())
  print(s[l, r+1].count('AC')

Fixed submission:
N, Q = map(int, input().split())
S = input()
t = [0] * (N + 1)
for i in range(N):
  t[i + 1] = t[i] + (1 if S[i : i + 2] == 'AC' else 0)
for i in range(Q):
  l, r = map(int, input().split())
  print(t[r-1] - t[l-1])
Buggy python submission (verdict: Runtime Error):
s = list(map(int,input()))

print(2*min(s.count(0), s.count(1))


Fixed submission:
s = input()

one = s.count("1")
zero = s.count("0")

print(2 * min(one, zero))

Buggy python submission (verdict: Runtime Error):
s = list(map(int,input()))

print(2*mmin(s.count(0), s.count(1))

Fixed submission:
s = input()

one = s.count("1")
zero = s.count("0")

print(2 * min(one, zero))
Buggy python submission (verdict: Runtime Error):
s=input()
if s[5] == '1':
  print('TBD')
else:
  if s[6] > 4:
    print('TBD')
  else:
    print('Heisei')

Fixed submission:
S = list(input())
a = int(S[5]+S[6])

if a <= 4:
    ans = "Heisei"
else:
    ans = "TBD"
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
p=[input() for i in range(n)]
print(sum(p)-int(max(p)/2))

Fixed submission:
n=int(input())
p=[int(input()) for i in range(n)]
print(sum(p)-int(max(p)/2))
Buggy python submission (verdict: Runtime Error):
from math import sqrt
x=int(input())
c=1
for b in range(1,int(sqrt(x))+1):
  for p in range(2,x):
    if b**p<=x:
      c=mac(b**p,c)
    else:
      break
print(c)

Fixed submission:
from math import sqrt
x=int(input())
c=1
for b in range(1,int(sqrt(x))+1):
  for p in range(2,x):
    if b**p<=x:
      c=max(b**p,c)
    else:
      break
print(c)
Buggy python submission (verdict: Runtime Error):
n,m,x=map(int,input().split())
b=[0]*(N+1)
A=list(map(int,input().split()))
for a in A:
  b[a]=1
c=0
for i in range(x):
  c+=b[i]
print(n-c if c>=n-c else c)


Fixed submission:
n,m,x=map(int,input().split())
b=[0]*(n+1)
A=list(map(int,input().split()))
for a in A:
  b[a]=1
c=0
for i in range(x):
  c+=b[i]
print(m-c if c>=m-c else c)

Buggy python submission (verdict: Runtime Error):
n,m,x=map(int,input().split())
b=[0]*(N+1)
A=list(map(int,input().split()))
for a in A:
  b[a]=1
c=0
for i in range(x):
  c+=b[i]
print(c if c>=n-c else n-c)


Fixed submission:
n,m,x=map(int,input().split())
b=[0]*(n+1)
A=list(map(int,input().split()))
for a in A:
  b[a]=1
c=0
for i in range(x):
  c+=b[i]
print(m-c if c>=m-c else c)

Buggy python submission (verdict: Runtime Error):
n,m,x=map(int,input().split())
b=[0]*(N+1)
A=list(map(int,input().split()))
for a in A:
  b[a]=1
c=0
for i in range(x):
  c+=a[i]
print(c if c>=n-c else n-c)

Fixed submission:
n,m,x=map(int,input().split())
b=[0]*(n+1)
A=list(map(int,input().split()))
for a in A:
  b[a]=1
c=0
for i in range(x):
  c+=b[i]
print(m-c if c>=m-c else c)
Buggy python submission (verdict: Runtime Error):
n=int(input())
s=[input() for i in range(n)]
m=int(input())
t=[input() for i in range(m)]
lis=set(s)
print(max(0,max([s.count(l)-t.count(l) for l in lis]))

Fixed submission:
n=int(input())
s=[input() for i in range(n)]
m=int(input())
t=[input() for i in range(m)]
lis=set(s)
print(max(0,max([s.count(l)-t.count(l) for l in lis])))
Buggy python submission (verdict: Runtime Error):
n, a, b = map(int, input().split())

def degitalsum(i):
  s = str(i)
  array = list(s)
  return sum(array)

ans = 0

for i in range(1, n + 1):
  if a <= degitalsum(i) <= b:
    ans += i

print(ans)  

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

def degitalsum(i):
  s = str(i)
  array = list(map(int, s))
  return sum(array)

ans = 0

for i in range(1, n + 1):
  if a <= degitalsum(i) <= b:
    ans += i

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
def L(i):
  if i == 0:
    return 2
  if i == 1:
    return 1
  return L(i - 1) + L(i - 2)

print(L(int(input())))

Fixed submission:
n = int(input())

if n == 1:
  print(1)
else:
  a, b = 2, 1
  for i in range(n - 1):
    a, b = b, a + b
  print(b)
Buggy python submission (verdict: Runtime Error):
a=input().split
print(a[0][0]+a[1][0]+a[2][0])

Fixed submission:
a=input().split()
print(a[0][0]+a[1][0]+a[2][0])
Buggy python submission (verdict: Runtime Error):
n,k,x,y = list(map(int,input().split()))
print(n*x+(y-x)*max(n-k,0))

Fixed submission:
n,k,x,y = (int(input()) for i in range(4))
print(n*x+(y-x)*max(n-k,0))
Buggy python submission (verdict: Runtime Error):
l= [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]
k = int(input())
print(l[k+1])

Fixed submission:
l= [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]
k = int(input())

print(l[k-1])
Buggy python submission (verdict: Runtime Error):
import math
h= int(input())
a= int(input())
result = math.ceil(h/a)
print(result)




Fixed submission:
import math
h,a = map(float,input().split())
result = math.ceil(h/a)
print(result)
Buggy python submission (verdict: Runtime Error):
    w,c = map(int,input().split())
     
    res = w - (c+c)
    if res < 0:
      res =0
    print(res)

Fixed submission:
w,c = map(int,input().split())
         
res = w - (2*c)

if res < 0:
    res =0
print(res)
Buggy python submission (verdict: Runtime Error):
l = [int(i) for i in input().split()]
print((l[3] + 0.5) // l[0] * l[1])

Fixed submission:
l = [int(i) for i in input().split()]
print(int((l[2] + 0.5) // l[0] * l[1]))
Buggy python submission (verdict: Runtime Error):
dic = {"A" : "T", "T" : "A", "C" : "G", "G" : "C"}
print(dict[input()])

Fixed submission:
dic = {"A" : "T", "T" : "A", "C" : "G", "G" : "C"}
print(dic[input()])
Buggy python submission (verdict: Time Limit Exceeded):
cnt = 0
s = input()
while ('01' in s)or('10' in s):
    sa = s.replace('01', '')
    sa = sa.replace('10', '')
    cnt += len(s)-len(sa)
    s = sa
print(cnt)


Fixed submission:
s = input()
print(min(s.count('0'), s.count('1'))*2)

Buggy python submission (verdict: Time Limit Exceeded):
s = input()
cnt = 0
a = 0
while True:
    fidx = s.find('10')
    if fidx==-1:
        a = 1
    cnt += s.count('10')
    s = s.replace('10', '')
    fidx = s.find('01')
    if (fidx==-1)and(a==1):
        break
    cnt += s.count('01')
    s = s.replace('01', '')
print(cnt*2)


Fixed submission:
s = input()
print(min(s.count('0'), s.count('1'))*2)
Buggy python submission (verdict: Runtime Error):
l = [int(i) for i in input().split()]
if min(abs(l[0]-l[1]), abs(l[1]-l[2]), abs(l[0]-abs[2])) <= l[3]:
  print('Yes')
else:
  print('No')

Fixed submission:
l = [int(i) for i in input().split()]
print("Yes" if ((abs(l[0] - l[1]) <= l[3]) & (abs(l[1] - l[2]) <= l[3])) or (abs(l[0] - l[2]) <= l[3]) else "No")

Buggy python submission (verdict: Runtime Error):
l = [int(i) for i in input().split()]
if max(abs(l[0-l[1]], abs(l[1]-l[2])) <= l[3]:
  print('Yes')
else:
  print('No')

Fixed submission:
l = [int(i) for i in input().split()]
print("Yes" if ((abs(l[0] - l[1]) <= l[3]) & (abs(l[1] - l[2]) <= l[3])) or (abs(l[0] - l[2]) <= l[3]) else "No")

Buggy python submission (verdict: Runtime Error):
l = [int(i) for i in input().split()]
if max(abs(l[0-l[1]], abs(l[1]-l[2]))) <= l[3]:
  print('Yes')
else:
  print('No')

Fixed submission:
l = [int(i) for i in input().split()]
print("Yes" if ((abs(l[0] - l[1]) <= l[3]) & (abs(l[1] - l[2]) <= l[3])) or (abs(l[0] - l[2]) <= l[3]) else "No")
Buggy python submission (verdict: Runtime Error):
s = input()
c = 0
for i in 'abc': if s.count(i) == 1: c += 1
print('Yes' if c == 3 else 'No')

Fixed submission:
s = input()
c = 0
for i in 'abc':
  if s.count(i) == 1:
    c += 1
print('Yes' if c == 3 else 'No')
Buggy python submission (verdict: Runtime Error):
s = ''
for i in range(3):
  s += [j for j in input().split()][i]
print(s)


Fixed submission:
s = ''
for i in range(3): s += input()[i]
print(s)

Buggy python submission (verdict: Runtime Error):
s = ''
for i in range(3):
  l = [int(j) for j in input().split()]
  s += l[i]
print(s)

Fixed submission:
s = ''
for i in range(3): s += input()[i]
print(s)

Buggy python submission (verdict: Runtime Error):
for i in range(3): l[i] = [int(j) for j in input().split()]
print(l[0][0] + l[1][1] + l[2][2])

Fixed submission:
s = ''
for i in range(3): s += input()[i]
print(s)

Buggy python submission (verdict: Runtime Error):
for i in range(3): l[i] = [int(i) for i in input().split()]
print(l[0][0] + l[1][1] + l[2][2])

Fixed submission:
s = ''
for i in range(3): s += input()[i]
print(s)

Buggy python submission (verdict: Runtime Error):
l = [[int(i) for i in input().split()] * 3]
print(l[0][0] + l[1][1] + l[2][2])

Fixed submission:
s = ''
for i in range(3): s += input()[i]
print(s)
Buggy python submission (verdict: Runtime Error):
a,b,c=input().split()
print('NYOE S'[[a[-1]==b[0] and b[-1]==c[0]]::2])

Fixed submission:
a,b,c=input().split();print('NYOE S'[a[-1]==b[0]and b[-1]==c[0]::2])

Buggy python submission (verdict: Runtime Error):
a,b,c=input().split();print('NYOE S'[[a[-1]==b[0]and b[-1]==c[0]]::2])

Fixed submission:
a,b,c=input().split();print('NYOE S'[a[-1]==b[0]and b[-1]==c[0]::2])

Buggy python submission (verdict: Runtime Error):
a,b,c=input().split();print('NYOE S'[a[-1]==b[0]and b[-1]==c[0]]::2)

Fixed submission:
a,b,c=input().split();print('NYOE S'[a[-1]==b[0]and b[-1]==c[0]::2])
Buggy python submission (verdict: Runtime Error):
n-int(input());print(800*n-n//15*200)

Fixed submission:
n=int(input());print(800*n-n//15*200)
Buggy python submission (verdict: Runtime Error):
a,b=map(lambda x:14 if int(x)==1 else int(x),input().split())
if a>b:s='Alice';elif a<b:s='Bob';else:s='Draw';print(s)

Fixed submission:
a,b=map(lambda x:14 if int(x)==1 else int(x),input().split())
if a>b:s='Alice'
elif a<b:s='Bob'
else:s='Draw'
print(s)
Buggy python submission (verdict: Runtime Error):
a = input()
a = int(a)
l = [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(l[k-1])

Fixed submission:
a = input()
a = int(a)
 
l = [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(l[a-1])

Buggy python submission (verdict: Runtime Error):
a = input()
a = int(a)
 
l = [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(l[a+1])

Fixed submission:
a = input()
a = int(a)
 
l = [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(l[a-1])

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

l = [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(l[a+1])

Fixed submission:
a = input()
a = int(a)
 
l = [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(l[a-1])
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split(" "))

if a*b % 2 = 0:
  print('Even')
else:
  print('Odd')

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

if a*b % 2 == 0:
  print('Even')
else:
  print('Odd')
Buggy python submission (verdict: Runtime Error):
a, b = input()
n = a + b
n = int(n)

if (n ** 0.5).isinteger():
  print(Yes)
else:
  print(No)


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

if (n ** 0.5).is_integer():
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
K = int(input())
nums = [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(nums[K])

Fixed submission:
K = int(input())
nums = [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(nums[K - 1])

Buggy python submission (verdict: Runtime Error):
import numpy as np


a,b,c = list(map(float,input().split()))
if (np.sqrt((a)) + np.sqrt(b)) < np.sqrt(c):
    print('Yes')
else:
    print('No')




Fixed submission:
nums = [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
]
K = int(input())
print(nums[K-1])
Buggy python submission (verdict: Runtime Error):
import numpy as np


h,w = list(map(int,input().split()))
if h == 1 or w == 1:
    print(1)
else
    print( int(np.ceil(h*w/2)))


Fixed submission:
import numpy as np


h,w = list(map(int,input().split()))
if h == 1 or w == 1:
    print(1)
else:
    print( int(np.ceil(h*w/2)))
Buggy python submission (verdict: Runtime Error):
a, b = map(int, list(input.split(" ")) )
s = a + b
print((s+1)/2)


Fixed submission:
a, b = map(int, list(input().split(" ")) )
s = a + b
print(int((s+1)/2))