Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n,m=map(int,input().split())
if n==1:
        print(m)
else:
        max=1
        for i in range(1,m//n+1):
           if m%i==0:
                max=i
        print(max)

Fixed submission:
import math

n,m=map(int,input().split())
if n==1:
        print(m)
else:
        l=[]
        for i in range(1,math.floor(m**0.5)+1):
           if m%i==0 and i<=m//n:
                l.append(i)
                if m//i<=m//n:
                        l.append(m//i)
        l.sort()
        print(l[-1])

Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
if n==1:
        print(m)
else:
        max=1
        for i in range(1,m//n+1):
        if m%i==0:
                max=i
        print(max)

Fixed submission:
import math

n,m=map(int,input().split())
if n==1:
        print(m)
else:
        l=[]
        for i in range(1,math.floor(m**0.5)+1):
           if m%i==0 and i<=m//n:
                l.append(i)
                if m//i<=m//n:
                        l.append(m//i)
        l.sort()
        print(l[-1])

Buggy python submission (verdict: Time Limit Exceeded):
n,m=map(int,input().split())
max=1
for i in range(1,m//n+1):
    if m%i==0:
        max=i
print(max)

Fixed submission:
import math

n,m=map(int,input().split())
if n==1:
        print(m)
else:
        l=[]
        for i in range(1,math.floor(m**0.5)+1):
           if m%i==0 and i<=m//n:
                l.append(i)
                if m//i<=m//n:
                        l.append(m//i)
        l.sort()
        print(l[-1])

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

k=[]

for i in range(m):
  if (m%i==0) and (m//i <= n):
    k.append(i)
    
print(max(k))    

    





Fixed submission:
import math

n,m=map(int,input().split())
if n==1:
        print(m)
else:
        l=[]
        for i in range(1,math.floor(m**0.5)+1):
           if m%i==0 and i<=m//n:
                l.append(i)
                if m//i<=m//n:
                        l.append(m//i)
        l.sort()
        print(l[-1])

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

k=[]

for i in range(m):
  if (m%i==0) and (m//i <= n):
    k.append(i)
    
print(max(k))    

    





Fixed submission:
import math

n,m=map(int,input().split())
if n==1:
        print(m)
else:
        l=[]
        for i in range(1,math.floor(m**0.5)+1):
           if m%i==0 and i<=m//n:
                l.append(i)
                if m//i<=m//n:
                        l.append(m//i)
        l.sort()
        print(l[-1])
Buggy python submission (verdict: Runtime Error):
N, M, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))

def war():
 if max([X]+x) < min([Y]+y):
    print('No War')
else:
  print('War')

war()

Fixed submission:
N, M, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))

ans = 'No War' if max([X] + x) < min([Y] + y) else 'War'
print(ans)
Buggy python submission (verdict: Runtime Error):
import collections

s = list(input())
t = list(input())

cs = collections.Counter(s)
ct = collections.Counter(t)

slist = cs.values()
tlist = ct.values()

slist.sort()
tlist.sort()

if slist == tlist:
    print("Yes")
else:
    print("No")



Fixed submission:
import collections

s = list(input())
t = list(input())

cs = collections.Counter(s)
ct = collections.Counter(t)

slist = list(cs.values())
tlist = list(ct.values())

slist.sort()
tlist.sort()

if slist == tlist:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
from collections import Counter

s = list(input())
t = list(input())

cs = Counter(s)
ct = Counter(t)

slist = list(cs.value())
tlist = list(cs.value())

slist.sort()
tlist.sort()

if slist == tlist:
    print("Yes")
else:
    print("No")


Fixed submission:
import collections

s = list(input())
t = list(input())

cs = collections.Counter(s)
ct = collections.Counter(t)

slist = list(cs.values())
tlist = list(ct.values())

slist.sort()
tlist.sort()

if slist == tlist:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
from collections import Counter

s = list(input())
t = list(input())

cs = Counter(s)
ct = Counter(t)

slist = cs.value()
tlist = cs.value()

slist.sort()
tlist.sort()

if slist == tlist:
    print("Yes")
else:
    print("No")

Fixed submission:
import collections

s = list(input())
t = list(input())

cs = collections.Counter(s)
ct = collections.Counter(t)

slist = list(cs.values())
tlist = list(ct.values())

slist.sort()
tlist.sort()

if slist == tlist:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n,x = map(int, input().split())
A = list(map(int, input().split()))

A.sort()

ans = 0

for i in range(N):
  x -= A[i]
  if x >= 0:
    ans += 1
  else:
    break
    
if x > 0:
  print(ans-1)
else:
  print(ans)

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

A.sort()

ans = 0

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

if (a*b)%2 = 1:
  print("Yes")
else:
  print("No")
  


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

if (a*b)%2 == 1:
  print("Yes")
else:
  print("No")

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

if (a*b=1) or (a*b=3):
  print("Yes")
else:
  print("No")
  

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

if (a*b)%2 == 1:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))

i=1
count=0

while i<n:
  if a[i]=a[i-1]:
    count+=1
    i+=2
  else:
    i+=1

print(count)

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

i=1
count=0

while i<n:
  if a[i]==a[i-1]:
    count+=1
    i+=2
  else:
    i+=1

print(count)

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

i = 1
count = 0

while i < n:
  if a[i] = a[i-1]:
    count += 1
    i += 2
    else:
      i += 1

print(count)

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

i=1
count=0

while i<n:
  if a[i]==a[i-1]:
    count+=1
    i+=2
  else:
    i+=1

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

if (a+b==15):
  print("+")
elseif (a*b==15):
  print("*")
else:
  print("×")

Fixed submission:
A, B = map(int, input().split())
if(A+B==15):
    print("+")
elif(A*B==15):
    print("*")
else:
    print("x")

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

if a+b=15:
  print("+")
elseif a*b=15:
  print("*")
else:
  print("×")

Fixed submission:
A, B = map(int, input().split())
if(A+B==15):
    print("+")
elif(A*B==15):
    print("*")
else:
    print("x")
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s=input()
l=[]
for i in range(n):
  x=s[:i].count('W')+s[i+1:].count('E')
  l.append(x)
print(min(l))

Fixed submission:
n=int(input())
s=input()
lw=0
re=s.count('E')
l=[]
for i in range(n):
  if s[i]=='W':
    x=lw+re
    lw+=1
  else:
    x=lw+(re-1)
    re-=1
  l.append(x)
print(min(l))
Buggy python submission (verdict: Time Limit Exceeded):
import statistics
import copy

n=int(input())
a=list(map(int,input().split()))
for i in range(n):
    l=copy.deepcopy(a)
    l.pop(i)
    l.sort()
    ans=l[n//2-1]
    print(ans)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
l=sorted(a)
x=l[n//2-1]
y=l[n//2]
for z in a:
    if z<=x:
        print(y)
    else:
        print(x)

Buggy python submission (verdict: Time Limit Exceeded):
import statistics
import copy

n=int(input())
a=list(map(int,input().split()))
for i in range(n):
    l=copy.deepcopy(a)
    l.pop(i)
    median=statistics.median(l)
    print(median)


Fixed submission:
n=int(input())
a=list(map(int,input().split()))
l=sorted(a)
x=l[n//2-1]
y=l[n//2]
for z in a:
    if z<=x:
        print(y)
    else:
        print(x)
Buggy python submission (verdict: Runtime Error):
n=int(input())
l=[0]*10
for i in range(n):
  x=input()
  y=x[0]
  if y=='M':
    l[0]+=1
  elif y=='A':
    l[1]+=1
  elif y=='R':
    l[2]+=1
  elif y=='C':
    l[3]+=1
  elif y=='H':
    l[4]+=1
ans=0
for i in range(3):
  for j in range(i+1,i+4):
    for k in range(j+1,j+4):
      sum+=l[i]*l[j]*l[k]
print(sum)


Fixed submission:
n=int(input())
l=[0]*10
for i in range(n):
  x=input()
  y=x[0]
  if y=='M':
    l[0]+=1
  elif y=='A':
    l[1]+=1
  elif y=='R':
    l[2]+=1
  elif y=='C':
    l[3]+=1
  elif y=='H':
    l[4]+=1
ans=0
for i in range(3):
  for j in range(i+1,i+4):
    for k in range(j+1,j+4):
      ans+=l[i]*l[j]*l[k]
print(ans)
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
print(1800*m+100*n)*2**m

Fixed submission:
n,m=map(int,input().split())
print((1800*m+100*n)*2**m)
Buggy python submission (verdict: Runtime Error):
s=input()
count=0
for i in range(s.length):
  if s[i]==1:
    count+=1

print(count) 

Fixed submission:
s=input()
count=0
for i in range(len(s)):
  if int(s[i])==1:
    count+=1
 
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
a,b,c,d,e,f=map(int,input().split())
INF=10**3

total=0
s=0
max=0
for w in range(31):
    for x in range(31):
        for y in range(101):
            for z in range(101):
                water=100*(w*a+x*b)
                sugar=y*c+z*d
                if water==0:
                    m=INF
                else:
                    m=(sugar/water)*100
                if water+sugar<=f and m<=e:
                    n=100*sugar/(water+sugar)
                    if n>max:
                        max=n
                        total=sugar+water
                        s=sugar
print(total,s)

Fixed submission:
a,b,c,d,e,f=map(int,input().split())
w=set()
for x in range(0,f+1,100*a):
    for y in range(0,f+1-x,100*b):
        w.add(x+y)
s=set()
for x in range(0,f+1,c):
    for y in range(0,f+1-x,d):
        s.add(x+y)

max=-1
total=0
sugar=0
for x in w:
    for y in s:
        if 0<x+y<=f and y<=x*e//100:
            if max<y/(x+y):
                total=x+y
                sugar=y
                max=y/(x+y)
print(total,sugar)
Buggy python submission (verdict: Runtime Error):
from collections import Counter

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

c=Counter(a)
l=c.most_common()
rectangle=[]
square=[]
x=len(l)
for i in range(x):
    if l[i][1]>=2:
        rectangle.append(l[i][0])
    if l[i][1]>=4:
        square.append(l[i][0])
rectangle.sort()
square.sort()
ans1=rectangle[-1]*rectangle[-2]
ans2=square[-1]**2
if ans1<ans2:
    print(ans2)
else:
    print(ans1)

Fixed submission:
from collections import Counter

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

c=Counter(a)
l=c.most_common()
rectangle=[]
square=[]
x=len(l)
for i in range(x):
    if l[i][1]>=2:
        rectangle.append(l[i][0])
    if l[i][1]>=4:
        square.append(l[i][0])
rectangle.sort()
square.sort()
if len(rectangle)<2 and len(square)<1:
    print(0)
elif len(rectangle)>=2 and len(square)<1:
    print(rectangle[-1]*rectangle[-2])
elif len(rectangle)<2 and len(square)>=1:
    print(square[-1]**2)
else:
    ans1=rectangle[-1]*rectangle[-2]
    ans2=square[-1]**2
    if ans1<ans2:
        print(ans2)
    else:
        print(ans1)
Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
a=list(map(int,input().split()))
def gcd(a,b):
  if b==0:
    return a
  else:
    return gcd(b,a%b)

if n==1:
  x=a[0]
else:
  x=gcd(a[0],a[1])
  for i in range(2,n):
    x=gcd(x,a[i])

if max(a)>=k and k%g==0:
    print("POSSIBLE")
else:
    print("IMPOSSIBLE")

Fixed submission:
n,k=map(int,input().split())
a=list(map(int,input().split()))
def gcd(a,b):
  if b==0:
    return a
  else:
    return gcd(b,a%b)

if n==1:
  x=a[0]
else:
  x=gcd(a[0],a[1])
  for i in range(2,n):
    x=gcd(x,a[i])

if max(a)>=k and k%x==0:
    print("POSSIBLE")
else:
    print("IMPOSSIBLE")
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
odd=0
for x in a:
    if a%2==1:
        odd+=1
if odd%2==1:
    print('NO')
else:
    print('YES')

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
odd=0
for x in a:
    if x%2==1:
        odd+=1
if odd%2==1:
    print('NO')
else:
    print('YES')
Buggy python submission (verdict: Runtime Error):
n=int(input())
l=list(map(int,input().split()))

l.sort()
k=l[::2]

print(k.sum())

Fixed submission:
n=int(input())
l=list(map(int,input().split()))
 
l.sort()
k=l[::2]
sum=0
for i in range(n):
  sum += k[i]
  
print(sum)
Buggy python submission (verdict: Runtime Error):
def main():
    N, Q = [int(s) for s in input().split()]
    adj = [[] for _ in range(N)]
    counters = [0] * N
    increments = [0] * N

    for _ in range(N - 1):
        a, b = [int(s) - 1 for s in input().split()]
        adj[a].append(b)
        adj[b].append(a)

    for _ in range(Q):
        p, x = [int(s) for s in input().split()]
        increments[p - 1] += x

    dfs(0, -1, 0, increments, adj, counters)
    print(' '.join(str(c) for c in counters))


def dfs(vertex, parent, increment, increments, adj, counter):
    increment += increments[vertex]
    counter[vertex] += increment

    for other in adj[vertex]:
        if other != parent:
            dfs(other, vertex, increment, increments, adj, counter)


if __name__ == '__main__':
    main()

Fixed submission:
def main():
    N, Q = [int(s) for s in input().split()]
    adj = [[] for _ in range(N)]
    counters = [0] * N
    increments = [0] * N

    for _ in range(N - 1):
        a, b = [int(s) - 1 for s in input().split()]
        adj[a].append(b)
        adj[b].append(a)

    for _ in range(Q):
        p, x = [int(s) for s in input().split()]
        increments[p - 1] += x

    stack = [(0, 0, -1)]

    while stack:
        u, inc, parent = stack.pop()
        inc += increments[u]
        counters[u] += inc

        for v in adj[u]:
            if v != parent:
                stack.append((v, inc, u))

    print(' '.join(str(c) for c in counters))


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
L = list(map(int, input().split()))
ret = []
for i in range(1,n+1):
  for k, x in enumerate(L):
    if x == i:
      ret.append(k+1)
      break
print(*ret)

Fixed submission:
n = int(input())
L = list(map(int, input().split()))
ret = []
L = sorted(range(len(L)), key=lambda k: L[k])
print(*map(lambda x: x+1, L))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
L = list(map(int, input().split()))
ret = []
for i in range(1,n+1):
  ret.append([k+1 for k, x in enumerate(L) if x == i])
print(*sum(ret,[]))

Fixed submission:
n = int(input())
L = list(map(int, input().split()))
ret = []
L = sorted(range(len(L)), key=lambda k: L[k])
print(*map(lambda x: x+1, L))
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if ((a+b)/2)is_integer():
  print((a+b)//2)
  exit()
print("IMPOSSIBLE")

Fixed submission:
a, b = map(int, input().split())
if ((a+b)/2).is_integer():
  print((a+b)//2)
  exit()
print("IMPOSSIBLE")

Buggy python submission (verdict: Time Limit Exceeded):
a, b = map(int, input().split())
for i in range(max(a,b)):
  if abs(a-i) == abs(b-i):
    print(i)
    exit()
print("IMPOSSIBLE")

Fixed submission:
a, b = map(int, input().split())
if ((a+b)/2).is_integer():
  print((a+b)//2)
  exit()
print("IMPOSSIBLE")
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if x < a:
  print(0)
else:
  print(10)

Fixed submission:
a, b = map(int, input().split())
if a < b:
  print(0)
else:
  print(10)
Buggy python submission (verdict: Runtime Error):
s = input()
ans = []
cnt = 0
for i in range(len(s)):
  if s[i] in set("ATCG"):
    cnt += 1
  else:
    ans.append(cnt)
    cnt = 0
print(max(ans))

Fixed submission:
s = input()
ans = []
cnt = 0
for i in range(len(s)):
  if s[i] in set("ATCG"):
    cnt += 1
    ans.append(cnt)
  else:
    ans.append(cnt)
    cnt = 0
print(max(ans))
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
C = []
for _ in range(a):
  c, t = map(int, input().split())
  if t <= b:
    C.append(c)
print(min(C))

Fixed submission:
a, b = map(int, input().split())
C = []
for _ in range(a):
  c, t = map(int, input().split())
  if t <= b:
    C.append(c)
if not C ==[]:
  print(min(C))
else:
  print("TLE")
Buggy python submission (verdict: Runtime Error):
if int(input())%2 == 1 and int(input())%2 == 1:
  print("Yes")
else:
  print("No")

Fixed submission:
a, b = map(int, input().split())
if a%2 == 1 and b%2 == 1:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
print((int(input())-1)*(int(input())-1))

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

Fixed submission:
n = int(input())
if n%2 == 0:
  print(n)
else:
  print(2*n)
Buggy python submission (verdict: Runtime Error):
if int(input()) <= 8 and int(input()) <= 8:
  print("Yay!")
else:
  print(":(")

Fixed submission:
a, b = map(int, input().split())
if a <= 8 and b <= 8:
  print("Yay!")
else:
  print(":(")
Buggy python submission (verdict: Runtime Error):
print((int(input())+int(input()))//2+1)

Fixed submission:
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
count=0
while True:
  for i in A:
    if i%2 != 0:
      print(int(count))
      quit()
  
  A = list(map(lambda x: x/2, A))
  #print(A)
  count+=1
  #break
print(int(count))

Fixed submission:
count = 0
for i in str(input()):
  if i == "1":
    count+=1    
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
k, s = map(int, input().split())
count=0
if k < s/3:
  print(0)
  quit()
for a in range(0, k+1):
  if a == s:
    print(count+1)
    quit()
  for b in range(0, k+1):
    if a+b == s:
      count+=1
      break
    elif a+b > s:
      break
    for c in range(0, k+1):
      if a+b+c == s:
        count+=1
      elif a+b+c > s:
        break
print(count)

Fixed submission:
k, s = map(int, input().split())
count=0
for a in range(0, k+1):
  for b in range(0, k+1):
    if s-a-b >= 0 and s-a-b <= k:
      count+=1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
import math
k, s = map(int, input().split())
count=0
if k < s/3:
  print(0)
  quit()
for a in range(0, k+1):
  if a == s:
    print(count+1)
    quit()
  for b in range(0, k+1):
    if a+b == s:
      count+=1
      break
    elif a+b > s:
      break
    for c in range(0, k+1):
      if a+b+c == s:
        count+=1
print(count)

Fixed submission:
k, s = map(int, input().split())
count=0
for a in range(0, k+1):
  for b in range(0, k+1):
    if s-a-b >= 0 and s-a-b <= k:
      count+=1
print(count)
Buggy python submission (verdict: Runtime Error):
a, b, x = map(int, input().split())
if a%x == 0:
  print(b//x-a//x+1)
else:
  print(b//x-a//x)

Fixed submission:
A, B, C = input().split()
print("A"+B[0]+"C")
Buggy python submission (verdict: Runtime Error):
n=input()
def ina():
  return map(int,raw_input().split())
a=ina()
b=ina()
c=0
for i in range(n):
  if a[i]>b[i]
  	c+=a[i]-b[i]
print c

Fixed submission:
n=input()
def ina():
  return map(int,raw_input().split())
a=ina()
b=ina()
c=0
for i in range(n):
  if a[i]>b[i]:
  	c+=a[i]-b[i]
print c
Buggy python submission (verdict: Runtime Error):
def f(x,n):
	if x == 1: return [n];
	if x % 2 == 1:
		return f(x >> 1,n + 1) + [n]
	else:
		return [n] + f(x - 1,n + 1)

n = input()
p += range(1,len(p) + 1)
print ' '.join(list(map(str,p)))



Fixed submission:
def f(x,n):
	if x == 1: return [n];
	if x % 2 == 1:
		return f(x >> 1,n + 1) + [n]
	else:
		return [n] + f(x - 1,n + 1)

def g(x,n):
	if x == 1: return [n];
	if x % 2 == 1:
		return g(x >> 1,n + 1) + [n]
	else:
		return g(x - 1,n + 1) + [n]

n = input()
p = f(n,1) + g(n,1)
print len(p)
print ' '.join(list(map(str,p)))
Buggy python submission (verdict: Runtime Error):
A,B=(int(x) for x in input().split())
A!=B

if abs(A-K)==abs(B-K):
    print(K)
else:
    print('IMPOSSIBLE')

Fixed submission:
A,B=(int(x) for x in input().split())
K=(A+B)//2
if abs(A-K) == abs(B-K):
    print(K)
else:
    print('IMPOSSIBLE')
Buggy python submission (verdict: Runtime Error):
S=list(int(i) for i in input().split())
for x in range(len(S)-1):
  if S[x]==S[x+1]:
    print('Bad')
  break
  else:
    print('Good')


Fixed submission:
S=list(int(i) for i in input())
for i in range(len(S)-1):
  if S[i]==S[i+1]:
    print('Bad')
    break
else:
  print('Good')

Buggy python submission (verdict: Runtime Error):
S=list(int(i) for i in input().split())
for x in range(len(S)+1):
  if S[x]==S[x+1]:
    print('Bad')
  break 
else:
  print('Good')


Fixed submission:
S=list(int(i) for i in input())
for i in range(len(S)-1):
  if S[i]==S[i+1]:
    print('Bad')
    break
else:
  print('Good')

Buggy python submission (verdict: Runtime Error):
S=list(int(i) for i in input().split())
for x in range(len(S)+1):
  if S[x]==S[x+1]:
    print('Bad')
    break 
else:
  print('Good')


Fixed submission:
S=list(int(i) for i in input())
for i in range(len(S)-1):
  if S[i]==S[i+1]:
    print('Bad')
    break
else:
  print('Good')

Buggy python submission (verdict: Runtime Error):
S=list(int(i) for i in input().split())
for x in range(len(S)+1):
  if S[x]==S[x+1]:
    print('Bad')
  else:
    print('Good')


Fixed submission:
S=list(int(i) for i in input())
for i in range(len(S)-1):
  if S[i]==S[i+1]:
    print('Bad')
    break
else:
  print('Good')

Buggy python submission (verdict: Runtime Error):
S=list(int(i) for i in input().split())
if S[i]==S[i+1]:
  print('Bad')
else:
  print('Good')


Fixed submission:
S=list(int(i) for i in input())
for i in range(len(S)-1):
  if S[i]==S[i+1]:
    print('Bad')
    break
else:
  print('Good')
Buggy python submission (verdict: Runtime Error):
X,A=(inx(x) for x in input().split())
if X>=A:
  print(10)
else:
  print(0)

Fixed submission:
X,A=(int(x) for x in input().split())
if X>=A:
  print(10)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
N,K=(int(x) for x in input().split())
S=list(int(i) for i in input())
S[K-1] = S[K-1].lower()
print(' '.join(S))

Fixed submission:
N,K=(int(x) for x in input().split())
S=list(input())
S[K-1] = S[K-1].lower()
print(''.join(S))

Buggy python submission (verdict: Runtime Error):
N,K=(int(x) for x in input().split())
S=list(int(i) for i in input())
S[K-1] = S[K-1].lower()
print(','.join(S))

Fixed submission:
N,K=(int(x) for x in input().split())
S=list(input())
S[K-1] = S[K-1].lower()
print(''.join(S))

Buggy python submission (verdict: Runtime Error):
N,K=(int(x) for x in input().split())
S=list(int(i) for i in input())
S[K] = S[K].lower()
print(','.join(S))

Fixed submission:
N,K=(int(x) for x in input().split())
S=list(input())
S[K-1] = S[K-1].lower()
print(''.join(S))
Buggy python submission (verdict: Runtime Error):
a,b,c=(int(X) for x in input().split())
print(int((a*b)/2))

Fixed submission:
a,b,c=(int(x) for x in input().split())
print(int((a*b)/2))
Buggy python submission (verdict: Runtime Error):
d=int(input())
if d == 22:
  print('Christmas Eve Eve Eve')
elif d == 23:
  print('Christmas Eve Eve')
elif d == 24:
  print('Christmas Eve')
eilf d == 25:
  print('Christmas')

Fixed submission:
d=int(input())
if d == 22:
  print('Christmas Eve Eve Eve')
elif d == 23:
  print('Christmas Eve Eve')
elif d == 24:
  print('Christmas Eve')
elif d == 25:
  print('Christmas')
Buggy python submission (verdict: Runtime Error):
n=int(input())
if n==1:
    print('Hello World')
elif n==2:
    a,b=(int(x) for x in input().split())
    print(int(a + b))

Fixed submission:
n=int(input())
if n==1:
    print('Hello World')
elif n==2:
    a=int(input())
    b=int(input())
    print(int(a + b))
Buggy python submission (verdict: Runtime Error):
t,a,b=int(input())
print(min(t*a,b))

Fixed submission:
t,a,b=map(int,input().split())
print(min(t*a,b))