Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p02687 (python)

Fixed submission:
s = list(input())
if s[1] == 'B':
  print('ARC')
elif s[1] == 'R':
  print('ABC')

Buggy submission (verdict: Runtime Error):
s = input()
a = ord(s)
b = ord('ABC')
r = ord('ARC')
if a == b:
  print('ARC')
elif a == b:
  print('ABC')

Buggy submission (verdict: Runtime Error):
s = map(list,input())
b = [ABC]
r = [ARC]
if s == b:
  print('ARC')
elif r == b:
  print('ABC')
Problem p02645 (python)

Fixed submission:
s = str(input())

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

Buggy submission (verdict: Runtime Error):
s = str(input())

print(s[1]+s[2]+s[3])

Buggy submission (verdict: Runtime Error):
s = str(input())

print(s[1]+s[2]+s[3])
Problem p02646 (python)

Fixed submission:
a = [int(i) for i in input().split()]
b = [int(j) for j in input().split()]
t = int(input())

dis = abs(a[0]-b[0])

if (b[1]*t+dis) <= a[1]*t:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
ca = [int(i) for i in input().split()]
b = [int(j) for j in input().split()]
t = int(input())

if (a[0]<b[0]) & (b[1]*t + (b[0]-a[0]) - a[1]*t) < 0:
    print("YES")
elif (a[0]>b[0]) & (b[1]*t + (a[0]-b[0]) - a[1]*t) < 0:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a = [int(i) for i in input().split()]
b = [int(j) for j in input().split()]
t = int(input())

if (a[0]<b[0]) .and. (b[1]*t + (b[0]-a[0]) - a[1]*t) < 0:
    print("YES")
elif:if (a[0]>b[0]) .and. (b[1]*t + (b[0]-a[0]) - a[1]*t) > 0:
    print("YES")
else:
    print("NO")
Problem p02789 (python)

Fixed submission:
N, M = [int(i) for i in input().split()]

if (N == M):
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
N, M = [int(i) for i in input().split()]

if (N == M):
    print(Yes)
else:
    print(No)

Buggy submission (verdict: Runtime Error):
N, M = [int(i) for i in input().split()]

if (N == M):
    print(Yes)
else:
    print(No)
Problem p02791 (python)

Fixed submission:
N = int(input())
list = [int(i) for i in input().split()]

ans = 0
min = list[0]

for j in range(N):
    if (min  >= list[j]):
        ans += 1
        min = list[j]
    else:
        continue

print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
list = [int(i) for i in input().split()]

ans = 0
min = 0

for j in rainge(N):
    if (min  >= list[j]):
        abs += 1
        min = list[j]
    else:
        continue

print(ans)
Problem p02664 (python)

Fixed submission:
t=input()

def score(t):
  count=0
  for i in range(len(t)-1):
    if t[i]=='D':
      count+=1
    if t[i]=='P'and t[i+1]=='D':
      count+=1
  return count

hold=0

t_tr=t.replace('?','D')
#if hold<=score(t_tr):
#  hold=score(t_tr)
#  t_hold=t_tr

print(t_tr)

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

def score(t):
  count=0
  for i in range(len(t)-1):
    if t[i]=='D':
      count+=1
    if t[i]=='P'and t[i+1]=='D':
      count+=1
  return count

hold=0
for i in range(t.count('?')):
  t_tr=t.replace('?','D',i+1)
  t_tr=t_tr.replace('?','P')
  if hold<=score(t_tr):
    hold=score(t_tr)
    t_hold=t_tr

print(t_hold)
Problem p02717 (python)

Fixed submission:
a=list(map(int,input().split()))
b=[]
b.append(a[2])
b.append(a[0])
b.append(a[1])
for i in range(len(b)):
    print(str(b[i])+' ',end='')
print()

Buggy submission (verdict: Runtime Error):
a=list(map(int,input().split()))
b=[]
b.append(a[2])
b.append(a[0])
b.append(a[1])                                                                     for i in range(len(b)):
    print(str(b[i])+' ',end='')
print()
Problem p02732 (python)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
aset=list(set(a))
ans=0
al=[0]*200000
for i in a:
    al[i]+=1
for j in aset:
    k=al[j]
    ans+=(k*(k-1))//2
for u in a:
    print(ans-al[u]+1)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
e=list(set(a))                                                                     s=0                                                                                t=[0]*200000                                                                       for i in a:
    t[i]+=1                                                                        for j in e:                                                                            k=t[j]                                                                             s+=(k*(k-1))//2
for u in a:
    print(s-t[u]+1)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
aset=list(set(a))
ans=0
al=[0]*n
for i in a:
    al[i]+=1
for j in aset:
    k=al[j]
    ans+=(k*(k-1))//2
for u in a:
    print(ans-al[u]+1)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
aset=list(set(a))
ans=0
alist=[0]*n
for j in aset:
    k=a.count(j)
    alist[j]=k
    ans+=(k*(k-1))//2
for u in a:
    print(ans-alist[u]+1)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
aset=list(set(a))
ans=0
alist=[ 0 for i in range(n)]
for _ in a:
    alist[_ - 1] += 1
for j in aset:
    k=a.count(j)                                                                       ans += (k*(k-1)) // 2                                                          for u in a:
    print(ans - alist[u - 1]+1)

Buggy submission (verdict: Runtime Error):
import copy
n=int(input())
a=list(map(int,input().split()))
a2=copy.copy(a)
for i in a2:
    a.append(i)
    ad=a[i+1:n+i]
    ans = 0                                                                            adset=list(set(ad))
    for j in adset:
        k = ad.count(j)                                                                    if(k >= 2):                                                                           ans += (k*(k-1))//2                                                             else:
            continue
    print(ans)
Problem p02747 (python)

Fixed submission:
s=input()
if(len(s)<=1):
    print('No')
    exit()

for i in range(len(s)-1):
    if(s[i]=='h'):
        if(s[i+1]=='i'):
            continue
        else:
            print('No')
            exit()
    elif(0<i and s[i]=='i'):
        if(s[i+1]=='h'):
            if(i+2<len(s) and s[i+2]=='i'):
                continue
            else:
                print('No')
                exit()
        else:
            print('No')
            exit()
    else:
        print('No')
        exit()
print('Yes')

Buggy submission (verdict: Runtime Error):
s=input()
if(len(s)<=1):                                                                                            print('No')                                                                                           exit()
                                                                                                      for i in range(len(s)-1):                                                                                 if(s[i]=='h'):
        if(s[i+1]=='i'):
            continue
        else:
            print('No')
            exit()
    elif(s[i]=='i'):
        if(s[i+1]=='h'):
            if(i+2<len(s) and s[i+2]=='i'):
                continue
            else:
                print('No')
                exit()
        else:
            print('No')
            exit()
    else:
        print('No')                                                                                           exit()
print('Yes')

Buggy submission (verdict: Runtime Error):
s=input()
for i in range(len(s)-1):
    if(s[i]=='h'):
        if(s[i+1]=='i'):
            continue
        else:
            print('No')
            exit()
    elif(s[i]=='i'):
        if(s[i+1]=='h'):
            if(s[i+2]=='i'):
                continue
            else:
                print('No')
                exit()
        else:
            print('No')
            exit()
    else:
        print('No')
        exit()
print('Yes')
Problem p02789 (python)

Fixed submission:
n,m=map(int,input().split())
if(n==m):
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
if(n==m)
	print('Yes')
else:
  print('No')
Problem p02917 (python)

Fixed submission:
n=int(input())
b=list(map(int,input().split()))
a=[]
ans=b[0]
a.append(ans)
#print(n-2)
#exit()
if(n-2==0):
    print(b[0]*2)
    exit()
for i in range(1,n-1):
    if(b[i] < ans):
        a.append(b[i])
    else:
        a.append(ans)
    ans=b[i]
a.append(b[i])
print(sum(a))

Buggy submission (verdict: Runtime Error):
n=int(input())
b=list(map(int,input().split()))
a=[]
ans=b[0]
a.append(ans)
for i in range(1,n-1):
    if(b[i] < ans):
        a.append(b[i])
    else:
        a.append(ans)
    ans=b[i]
a.append(b[i])
print(sum(a))

Buggy submission (verdict: Runtime Error):
n=int(input())
b=list(map(int,input().split()))
a=[]
ans=b[0]
a.append(ans)
for i in range(1,n-1):
    #print('i=',i)
    if(b[i] < ans):
        a.append(b[i])
    else:
        a.append(ans)
    ans=b[i]
a.append(b[i])
print(sum(a))
Problem p02969 (python)

Fixed submission:
print(3*(int(input()))**2)

Buggy submission (verdict: Runtime Error):
print(3*(int(input())**2)
Problem p03103 (python)

Fixed submission:
n,m=map(int,input().split())
a=[]
ans=0
for i in range(n):
    a.append(list(map(int,input().split())))
a=sorted(a)
for i in range(n):
    m=m-a[i][1]
    if(m<=0):
        ans+=a[i][0]*(a[i][1]+m)
        break
    else:
        ans+=a[i][1]*a[i][0]
print(ans)

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
a=[]
b=[]
ans=0
for _ in range(n):
    c,d=map(int,input().split())
    a.append(c)
    b.append(d)
e=sorted(a)
for i in range(n):
    m=m-b[a.index(e[i])]
    if(m=<0):
        ans+=e[i]*(b[a.index(e[i])]+m)
        break
    else:
        ans+=b[a.index(e[i])]*e[i]
print(ans)
Problem p03125 (python)

Fixed submission:
a,b=map(int,input().split())
if(b%a==0):
    print(a+b)
else:
    print(b-a)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=sorted(list(map(int,input().split())))
i=0
while(a[1] != 0):
    a[i+1]=a[i+1]-(a[i+1]//a[i])*a[i]
    a=sorted(a)
    if(a[0] == 0):
        i += 1
        while(a[1] != 0):
            a[i+1]=a[i+1]-(a[i+1]//a[i])*a[i]
            a=sorted(a)
print(a[i+1])

Buggy submission (verdict: Runtime Error):
n=int(input())
a=sorted(list(map(int,input().split())))
i=0
while(a[-2] != 0):
    if(a[-1]%a[i]==0):
        a[-1]=0
        i+=1
    else:
        a[-1]=a[-1]-(a[-1]//a[i])*a[i]
    a=sorted(a)
print(a[-1])
Problem p03126 (python)

Fixed submission:
n,m=map(int,input().split())
l=[]
for _ in range(n):
    a=list(map(int,input().split()))
    a=set(a[1:])
    l.append(a)
for i in range(n-1):
    l[i+1]=l[i]&l[i+1]
print(len(l[-1]))

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
lovelist=[]
for _ in range(n):
    a=set(sorted(list(map(int,input().split()))))
    lovelist.append(a)
for i in range(n-1):
    lovelist[i+1]=lovelist[i]&lovelist[i+1]
print(len(lovelist[2]))
Problem p03219 (python)

Fixed submission:
x, y = map( int, input().split())
print( int( x + y/ 2))

Buggy submission (verdict: Runtime Error):
N = int(input())
T, A = map( int, input().split())
H = list( map( int, input.split()))
         
K = []
Ksorted=[]
tmp=[]
 
for i in range(N):
  tmp.append( T - H[i] * 0.006)
  K.append(abs( A - tmp[i]))
  Ksorted = sorted(K)
  
T = K.index(Ksorted[0])
print(T+1)

Buggy submission (verdict: Runtime Error):
N = int(input())
T, A = map( int, input().split())
H = list( map( int, input.split()))
         
K = []
Ksorted=[]
tmp=[]
 
for i in range(N):
  tmp.append( T - H[i] * 0.006)
  K.append(abs( A - tmp[i]))
  Ksorted = sorted(K)
  
T = K.index(Ksorted[0])
Problem p03220 (python)

Fixed submission:
N = int(input())
T, A = map( int, input().split())
H = list( map( int, input().split()))
         
K = []
Ksorted=[]
tmp=[]
 
for i in range(N):
  tmp.append( T - H[i] * 0.006)
  K.append(abs( A - tmp[i]))
  Ksorted = sorted(K)
  
T = K.index(Ksorted[0])
print(T+1)

Buggy submission (verdict: Runtime Error):
N = int(input())
T, A = map( int, input().split())
H = list( map( int, input.split()))
         
K = []
Ksorted=[]
tmp=[]
 
for i in range(N):
  tmp.append( T - H[i] * 0.006)
  K.append(abs( A - tmp[i]))
  Ksorted = sorted(K)
  
T = K.index(Ksorted[0])
print(T+1)

Buggy submission (verdict: Runtime Error):
N = int(input())
T, A  map( int, input().split())
H = list( map( int, input.split()))
         
K = []
Ksorted=[]
tmp=[]

for i in range(N):
  tmp.append( T - H[i] * 0.006)
  K.append(abs( A - tmp[i]))
  Ksorted = sorted(K)
  
T = K.index(Ksorted[0])
print(T + 1)
Problem p03238 (python)

Fixed submission:
N = int(input())

if( N == 1):
  print('Hello World')
  
if( N ==2):
  A = int( input())
  B = int( input())
  print( int( A + B))

Buggy submission (verdict: Runtime Error):
N = int(input())

if( N == 1):
  print('Hello World')
  
if( N == 2):
  A = int(input())
  B = int(input())
  
 print(int( A + B))

Buggy submission (verdict: Runtime Error):
N = int(input())
if(int(N == 1)):
  print('Hello World')
 
if(int(N == 2)):
  A, B = map( int, input().split())
  print( int(A + B))
Problem p03251 (python)

Fixed submission:
N, M, X, Y =map( int, input().split())
x = list(map( int, input().split()))
y = list(map( int, input().split()))
 
x = sorted(x)
y = sorted(y)
 
for i in range(X + 1, Y + 1):
  if( x[N-1] < i <= y[0]):
    print('No War')
    exit()
    
print('War')

Buggy submission (verdict: Runtime Error):
N, M, X, Y =map( int, input()split())
x = list(map( int, input().split()))
y = list(map( int, input().split()))
 
x = sorted(x)
y = sorted(y)
 
for i in range(X + 1, Y + 1):
  if( x[N-1] < i <= y[0]):
    print('No War')
    exit()
    
  else:
    print('War')

Buggy submission (verdict: Runtime Error):
N, M, X, Y =map( int, input()split())
x = list(map( int, input().split()))
y = list(map( int, input().split()))

x = sorted(x)
y = sorted(y)

for i in range(X + 1, Y + 1):
  if( x[N-1] < i <= y[0]):
    print('No War')
    exit()
    
  else:
    print('war')
    break
Problem p03260 (python)

Fixed submission:
A, B = map( int, input().split())
 
D = A * B
 
if( D % 2 == 1):
  print('Yes')
  
else:
  print('No')

Buggy submission (verdict: Runtime Error):
N = int(input())

W = []

W.append(input())

for n in range(N):
    w = input()

    if( w[0] == W[n][-1] and w not in W):
        W.append(w)
        continue

    else:
        print('No')
        exit()

print('Yes')

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

D = A * B

if( D % 2 == 1):
  print('Yes')
  
else:
  print('No')
Problem p03261 (python)

Fixed submission:
N = int(input())

W = []

W.append(input())

for n in range(N-1):
    w = input()

    if( w[0] == W[n][-1] and w not in W):
        W.append(w)
        continue

    else:
        print('No')
        exit()

print('Yes')

Buggy submission (verdict: Runtime Error):
N = int(input())

W = []

W.append(input())

for n in range(N):
    w = input()

    if( w[0] == W[n][-1] and w not in W):
        W.append(w)
        continue

    else:
        print('No')
        exit()

print('Yes')
Problem p03323 (python)

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

if( A <= 8 and B <= 8):
  print('Yay!')
  
else:
  print(':(')

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

if( abs(A - B) == 1):
  print('yey!)
        
else:
  print(':(')
Problem p03328 (python)

Fixed submission:
a,b=map(int,input().split())
l=[]
e=b-a
k=0
for i in range(1000):
    k+=i
    l.append(k)

for j in range(999):
   o=l[j+1]-l[j]
   if(o==e):
       print(l[j]-a)
   else:
       continue

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
l=[]
k=0
c=0
for i in range(999):
    k+=i
    l.append(k)

for j in range(999):
   c=a+j
   if(c in l):
       d=l.index(c)
       if(l[d+1]-j==b):
           print(j)
       else:
           continue
   else:
       continue
Problem p03337 (python)

Fixed submission:
A, B = map( int, input().split())
C = []

C1 = A + B
C.append(C1)

C2 = A - B
C.append(C2)

C3 = A * B
C.append(C3)

C = sorted(C)

print(C[2])

Buggy submission (verdict: Runtime Error):
N = int( input())
S = list( input())

intger2 = 0

for i in range(N):
  intger1 = 0
  str1 = list(set(S[i + 1:]))
  str2 = list(set(S[:i + 1]))
  l = len(str2)
  
  for j in range(l):
    if( str2[j] in str1):
      intger1 += 1
      
    else:
      continue
  
  if( intger2 <= intger1):
    intger2 = intger1
    
  else:
    continue
    
print(intger2)

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

C1 = A + B
C.append(C1)

C2 = A - B
C.append(C2)

C3 = A * B
C.apend(C3)

C = sorted(C)

print(C[2])

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

C1 = A + B
C2 = A - B
C3 = A * B

C = [ C1, C2, C3 ]

C = sorted.C

print(C[2])
Problem p03399 (python)

Fixed submission:
A = int(input())
B = int(input())
C = int(input())
D = int(input())

if( A < B):
  if(C < D):
    print(A + C)
    
  else:
    print(A + D)
    
else:
  if(C < D):
    print(B + C)
  
  else:
    print(B + D)

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(input())
D = int(input())

if( A < B):
  if(C < D):
    print(A + C)
    
  else:
    print(A + D)
    
else:
  if(C < D)
    print(B + C)
  
  else:
    print(B + D)
Problem p03408 (python)

Fixed submission:
N = int( input())
s = list()

for i in range(N):
  S = input()
  s.append(S)
  
M = int( input())
t = list()

for j in range(M):
  T = input()
  t.append(T)

  judge = 0
for l in range(N):
  money = s.count(s[l]) - t.count(s[l])
  
  if( judge < money):
    judge = money
  else:
    continue
    
print(judge)

Buggy submission (verdict: Runtime Error):
N = int( input())
s = [ input() for i in range(N)]
M = int(input())
t = [ input() for j in rangwe(M)]

judge = 0
for l in range(N):
  money = s.count(s[l]) - t.count(s[l])
  
  if( judge < money):
    judge = money
  
  else:
    continue
    
print(judge)
Problem p03415 (python)

Fixed submission:
C1 = list(input())
C2 = list(input())
C3 = list(input())

print(C1[0]+C2[1]+C3[2])

Buggy submission (verdict: Runtime Error):
C1 = list(input())
C2 = list(input())
C3 = list(imput())

print(C1[0]+C2[1]+C3[2])
Problem p03434 (python)

Fixed submission:
N = int(input())
a = list( map( int, input().split()))
a = sorted(a)
a.reverse()
Alice = 0
Bob = 0
a.append(0)
a.append(0)

for i in range(N//2 + 1):
	Alice += int(a[2 * i])  
	Bob += int(a[2 * i + 1])
    
print(Alice -Bob)

Buggy submission (verdict: Runtime Error):
N = int(input())
a = list( map( int, input().split()))
a = sorted(a)
a.reverse()
Alice_Bob = o
Bob = 1

for i in a:
	Alice_Bob += a * Bob  
	Bob *= -1
    
print(Alice_Bob)

Buggy submission (verdict: Runtime Error):
N = int(input())
a = list( map( int, input().split()))
a = sorted(a)
Alice = 0
Bob = 0
a.append(0)

for i in range(N//2 + 1):
	Alice += int(a[2 * i])  
	Bob += int(a[2 * i + 1])
    
print(Alice -Bob)

Buggy submission (verdict: Runtime Error):
N = int(input())
a = list( map( int, input().split()))
a = sorted(a)
Alice = 0
Bob = 0

for i in range(N):
	Alice += int(a[2*i])  
	Bob += int(a[2*i + 1])
    
print(Alice -Bob)
Problem p03455 (python)

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

d = a * b

if( d % 2 == 0):
  print('Even')
  
else:
  print('Odd')

Buggy submission (verdict: Runtime Error):
a, b = map( int, input().split())
  print(['Even','Odd'][a * b % 2 == 1])

Buggy submission (verdict: Runtime Error):
a, b = map( int, input().split())
  print(['Even','Odd'][a * b % 2])
Problem p03469 (python)

Fixed submission:
S = input()

S = S.replace('2017', '2018')

print(S)

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

S[3] += 1

print(S)
Problem p03473 (python)

Fixed submission:
M = int(input())
print(48 - M)

Buggy submission (verdict: Runtime Error):
print(24 - int(input())
Problem p03477 (python)

Fixed submission:
A, B, C, D = map( int, input().split())
L = A + B
R = C + D

if( L < R):
  print('Right')
  
elif(L == R):
  print('Balanced')
  
else:
  print('Left')

Buggy submission (verdict: Runtime Error):
A,B,C,D=map(int,input().split())
print([Balanced,Left,Right][(C+D<A+B)-(C+D>A+B)])

Buggy submission (verdict: Runtime Error):
A, B, C, D = map( int, input().split())
L = A + B
R = C + D
print(["Balance","Left","Right"][R<L - R>L]

Buggy submission (verdict: Runtime Error):
A, B, C, D = map( int, input()split())
L = A + B
R = C + D

if( L < R):
  print('Right')
  
else:
  print('Left')
Problem p03485 (python)

Fixed submission:
import math
a, b = map( int, input().split())
print(math.ceil((a + b)/2))

Buggy submission (verdict: Runtime Error):
a, b = map( int, input().split())
print(math.ceil((a + b)/2))
Problem p03493 (python)

Fixed submission:
S = list(input())
print(S.count('1'))

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int, input().split()))
count=0 
def h(L):
  for i in range(len(L)):
    if L[i] % 2 != 0:
      return(1)
  return(0)
while h(a) == 0:
  for j in range(n):
    a[j]=a[j]/2
  count=count+1
  
print(count)

Buggy submission (verdict: Runtime Error):
S = list(input())
print(s.count('1'))
Problem p03494 (python)

Fixed submission:
n=int(input())
a=list(map(int, input().split()))
count=0 
def h(L):
  for i in range(len(L)):
    if L[i] % 2 != 0:
      return(1)
  return(0)
while h(a) == 0:
  for j in range(n):
    a[j]=a[j]/2
  count=count+1
  
print(count)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int, input().split()))
count=0 
def h(L):
  for i in range(len(L)):
    if L[i] % 2 != 0:
      return(1)
  return(0)
while h(a) == 0:
    a[j]=a[j]/2
  count=count+1
  
print(count)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int, input().split()))
count=0 
def h(L):
  for i in range(len(L)):
    if L[i] % 2 != 0:
      return(1)
  return(0)
while h(a) == 0:
  for j in range(N):
    A[j]=A[j]/2
  count=count+1
  
print(count)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int, input().split()))
count=0 
def h(L):
  for i in range(len(L)):
    if L[i] % 2 != 0:
      return 1
  return 0:
while h(a) == 0:
  for j in range(N):
    A[j]=A[j]/2
  count=count+1
  
print(count)
Problem p03555 (python)

Fixed submission:
C1 = list(input())
C2 = list(input())

for i in range(3):
    if(C1[i] == C2[2-i]):
        continue

    else:
        print('NO')
        exit()

print('YES')

Buggy submission (verdict: Runtime Error):
n = print(int(int(input())**0.5)**2)
Problem p03609 (python)

Fixed submission:
X, t = map(int, input().split())
D = X -t
if(D>0):
    print(D)

else:
    print('0')

Buggy submission (verdict: Runtime Error):
X, t = map(int, input().split())
print(x-t)
Problem p03624 (python)

Fixed submission:
s = input()
check = 'abcdefghijklmnopqrstuvwxyz'

s = set(s)
check = set(check)
s = check - s
s = sorted(s)
if(s):
    print(s[0])
else:
    print('None')

Buggy submission (verdict: Runtime Error):
print(min(set(map(chr,range(97,123)))-set(input())) or["None"])
Problem p03635 (python)

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

Buggy submission (verdict: Runtime Error):
n, m = map(int(input().split())
print((n-1)*(m-1))

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

Fixed submission:
n=int(input())
a=[]
ans=1
for i in range(n):
    b=int(input())
    a.append(b)
c=a[0]
if(c==2):
    print(ans)
else:
    while(c!=2):
        ans+=1
        c=a[c-1]
        if(ans>len(a)):
            print(-1)
            exit()
    print(ans)

Buggy submission (verdict: Runtime Error):
a=[input() for _ in range(int(input()))]
ans=1
c=a[0]
if(c==2):
    print(ans)
else:
    while(c!=2):
        ans+=1
        c=a[c-1]
        if(ans>len(a)):
            print(-1)
            exit()
    print(ans)
Problem p03737 (python)

Fixed submission:
s = list(input().upper().split())
print(s[0][0]+s[1][0]+s[2][0])

Buggy submission (verdict: Runtime Error):
for a in input().upper().split():
print(a[0] end="")
Problem p03826 (python)

Fixed submission:
a,b,c,d=map(int,input().split())
print(max(a*b,c*d))

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int,inpyt().split())
print(max(a*b,c*d))