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

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

if A >= B:
    L, S = A, B
if A < B:
    L, S = B, A

while L%S != 0:
    tmp = L;
    L = S;
    S = tmp%S;

gcd = int(S)

if gcd == 1:
    print(1)
    exit()

com_div = []
com_div.append(gcd)
for i in range(1,gcd):
    if gcd % i == 0:
        com_div.append(i)

com_div.sort(reverse=True)
print(com_div[K-1])

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

if A >= B:
    L, S = A, B
if A < B:
    L, S = B, A

while L%S != 0:
    tmp = L;
    L = S;
    S = tmp%S;

gcd = int(S)

if gcd == 1:
    print(1)
    exit()

com_div = []
count = 1
while count < gcd:
    if gcd % count == 0:
        gcd = int(gcd / count)
        com_div.append(gcd)
        com_div.append(count)
    count += 1

com_div.sort(reverse=True)
print(com_div[K-1])

Buggy submission (verdict: Runtime Error):
import math

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

if A >= B:
    L, S = A, B
if A < B:
    L, S = B, A

while L%S != 0:
    tmp = L;
    L = S;
    S = tmp%S;

gcd = int(S)

com_div = []
count = 1
while count <= gcd:
    if gcd % count == 0:
        gcd = int(gcd / count)
        com_div.append(gcd)
        com_div.append(count)
    count += 1

com_div.sort(reverse=True)
print(com_div[K-1])

Buggy submission (verdict: Runtime Error):
import math

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

gcd = int(math.gcd(A, B))

com_div = []
count = 1
while count <= gcd:
    if gcd % count == 0:
        gcd = int(gcd / count)
        com_div.append(gcd)
        com_div.append(count)
    count += 1

com_div.sort(reverse=True)
print(com_div[K-1])
Problem p03125 (python)

Fixed submission:
#coding: utf-8

#A = int(input())
#B = int(input())
A, B = map(int, input().split())


if B%A == 0:
    print(A + B)
else:
    print(B - A)

Buggy submission (verdict: Runtime Error):
#coding: utf-8

A = int(input())
B = int(input())

if B%A == 0:
    print(A + B)
else:
    print(B - A)

Buggy submission (verdict: Runtime Error):
#coding: utf-8

A = int(input())
B = int(input())

if B%A == 0:
    print(A + B)
else:
    print(B - A)
Problem p03126 (python)

Fixed submission:
#coding: utf-8

N, M = map(int, input().split())

List = []
all_and = []
for i in range(N):
    l = list(map(int, input().split()))
    del l[0]
    List.append(l)

    if i ==0:
        all_and = List[0]
    else:
        all_and = set(all_and) & set(List[i])
        all_and = list(all_and)

#print(all_and)
print(len(all_and))

Buggy submission (verdict: Runtime Error):
#coding: utf-8

N, M = map(int, input().split())

List = []
all_and = []
for i in range(N):
    l = list(map(int, input().split()))
    #print(l)
    del l[0]
    #print(l)
    List.append(l)
    #print(List[i])
    #print(List)
    #print( )

    all_and = set(all_and) & set(List[i])
    all_and = List(all_and)

all_and_list = list(all_and)
#print(all_and)
#print(all_and_list)
print(len(all_and_list))

Buggy submission (verdict: Runtime Error):
#coding: utf-8

N, M = map(int, input().split())

List = []
all_and = []
for i in range(N):
    l = list(map(int, input().split()))
    #print(l)
    del l[0]
    #print(l)
    List.append(l)
    #print(List[i])
    #print(List)
    #print( )

    all_and = set(all_and) & set(List[i])
    all_and = List(all_and)

all_and_list = list(all_and)
#print(all_and)
#print(all_and_list)
print(len(all_and_list))

Buggy submission (verdict: Runtime Error):
#coding: utf-8

N, M = map(int, input().split())

List = []
for i in range(N):
    l = list(map(int, input().split()))
    #print(l)
    del l[0]
    #print(l)
    List.append(l)
    #print(List[i])
    #print(List)
    #print( )

    if i != 0:
        all_and = set(List[i-1]) & set(List[i])

all_and_list = list(all_and)
print(len(all_and_list))
Problem p03239 (python)

Fixed submission:
#cording: utf-8

N, T = map(int, input().split())

ct = []
for i in range(N):
    ct.append(list(map(int, input().split())))

c_min = 1001
for i in range(N):
    if (ct[i][1] <= T) and (ct[i][0] <= c_min):
        c_min = ct[i][0]

print(c_min if c_min != 1001 else 'TLE')

Buggy submission (verdict: Runtime Error):
#cording: utf-8

N, T = map(int, input().split())

ct = [], []
for i in range(N):
    ct.append(map(int, input().split()))

if len(c) != 0:
    print(min(c))
else:
    print('TEL')

Buggy submission (verdict: Runtime Error):
#cording: utf-8

N, T = map(int, input().split())

ct = []
for i in range(N):
    ct.append(list(map(int, input().split())))

c_min = 1001
for i in range(N):
    if (ct[i][1] <= T) and (ct[i][0] <= c_min):
        c_min = ct[i][0]

print(minc if minc != 1001 else 'TLE')
Problem p03289 (python)

Fixed submission:
S = list(str(input()))

if S[0] == 'A':
    count_C = 0
    for ind in range(3-1, len(S)-1):
        if S[ind] == 'C':
            ind_C = ind
            count_C += 1
    if count_C == 1:
        del S[0]
        del S[ind_C - 1]
        s = 'a'
        for i in S:
            s = s + i
        if s.islower():
            print('AC')
            exit()
print('WA')

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

if S[0] == 'A':
    count_C = 0
    for ind in range(3-1, len(S)-1):
        if S[ind] == 'C':
            ind_C = ind
            count_C += 1
    if count_C == 1:
        del S[0]
        del S[ind_C]
        s = 'a'
        for i in S:
            s = s + i
        if S.islower():
            print('AC')
            exit()
print('WA')
Problem p03243 (python)

Fixed submission:
n=int(input())
for count in range(10):
    if 100*count+10*count+count>n-1:
        print(100*count+10*count+count)
        break
    else:
        pass

Buggy submission (verdict: Runtime Error):
n=int(input())
for count in range(10):
    if 100*count+10*count+count>n-1:
        input(100*count+10*count+count)
        break
    else:
        pass
Problem p02861 (python)

Fixed submission:
import itertools

def calculate_distance(x1, x2):
    l2_norm = (x1[0] - x2[0])**2 + (x1[1] - x2[1])**2
    return l2_norm**(1/2)

N = int(input())
point = []
for i in range(N):
    a,b = map(int,input().split())
    point.append([a, b])
    

distance = 0
M = 0
for a in itertools.permutations(range(N)):
  M += 1
  
  for i in range(N-1):
        start, end = a[i], a[i+1]
        distance += calculate_distance(point[start], point[end])
print(distance/M)

Buggy submission (verdict: Runtime Error):
def calculate_distance(x1, x2):
    l2_norm = (x1[0] - x2[0])**2 + (x1[1] - x2[1])**2
    return math.sqrt(l2_norm)

N = int(input())
point = []
for i in range(N):
    a,b = map(int,input().split())
    point.append([a, b])
    
res = []
for a in itertools.permutations(range(N)):
    distance = 0
    for i in range(N-1):
        distance += calculate_distance(point[i], point[i+1])
    res.append(distance)
np.mean(res)
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=int(input())
b=int(input())
if a<=8 and b<=8:
    print('Yay!')
else:
    print(':(')

Buggy submission (verdict: Runtime Error):
a=int(input())
b=int(input())
if a<=8 and b<=8:
    print('Yay!')
else:
    print(':(')
Problem p03437 (python)

Fixed submission:
x,y=map(int,input().split())
if x%y == 0:
    print(-1)
else:
    print(x)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
sum = 0
for i in range(n):
    if a[i] - b[i] > 0:
        sum += a[i]- b[i]
    else:
        sum += (b[i] - a[i]) / 2
sum_a = 0
sum_b = 0
for i in range(n):
    sum_a += a.pop(0)
    sum_b += b.pop(0)
if sum <= sum_b - sum_a:
    print ('YES')
else:
    print ('NO')

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
sum = 0
for i in range(n):
    if a[i] - b[i] > 0:
        sum += a[i]- b[i]
    else:
        sum += (b[i] - a[i]) / 2
sum_a = 0
sum_b = 0
for i in range(n):
    sum_a += a.pop(0)
    sum_b += b.pop(0)
if sum <= sum_b - sum_a:
    print ('YES')
else:
    print ('NO')
Problem p03447 (python)

Fixed submission:
x = int(input())
a = int(input())
b = int(input())
print ((x-a)%b)

Buggy submission (verdict: Runtime Error):
n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
m = 0
for i in range(n):
    m = max(m, sum(a1[:i+1])+sum(b1[i:]))
print (m)

Buggy submission (verdict: Runtime Error):
l = [int(input()) for i in range(4)]
#ABCX
count = 0
for i in range(l[2]+1):
    for j in range(l[1]+1):
        for k in range(l[0]+1):
            if (i*500+j*100+k*50)==l[3]:
                count += 1
print (count)
Problem p03474 (python)

Fixed submission:
a,b = map(int,input().split())
s = list(input())
ans = 'Yes'
if len(s) != a+b+1:
    ans = 'No'
else:
    for i in range(a+b+1):
        if i == a and s[i] != '-':
            ans = 'No'
            break
        if (not s[i].isdigit()) and i != a:
            ans ='No'
            break
print (ans)

Buggy submission (verdict: Runtime Error):
a,b = map(int,input().split())
s = list(input())
ans = Yes
if len(s) != a+b+1:
    ans = 'No'
else:
    for i in range(a+b+1):
        if i == a and s[i] != '-':
            ans = 'No'
            break
        if (not s[i].isdigit()) and i != a:
            ans ='No'
            break
print (ans)

Buggy submission (verdict: Runtime Error):
a,b = map(int,input().split())
s = list(input())
ans = True
for i in range(a+b+2):
    if i == a and s[i] != '-':
        ans = 'No'
    if not s[i].isdigit() and i != a:
        ans ='No'
        break
    if s[i].isdigit() and i != a:
        if 0>int(s[i]) or int(s[i]) > 9:
            ans ='No'
            
print (ans)
Problem p03496 (python)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
count = 0
s = []

def find_i():
    for i in range(n):
        if a[i] == max(a):
            return i+1
        
def find_m():
    for i in range(n):
        if a[i] == min(a):
            return i+1
        
maxi = find_i()
mini = find_m()

if min(a) < 0:
    if abs(min(a)) <= abs(max(a)):
        for _ in range(n):
            a[_] += max(a)
            s.append(str(maxi) + ' ' + str(_+1))
            count += 1
        for i in range(n-1):
            a[i+1] += a[i]
            s.append(str(i+1) + ' ' + str(i+2))
            count += 1
            
    else:
        for _ in range(n):
            a[_] += min(a)
            s.append(str(mini) + ' ' + str(_+1))
            count += 1
        for i in range(n-2,-1,-1):
            a[i] += a[i+1]
            s.append(str(i+2) + ' ' + str(i+1))
            count += 1

else:
    for i in range(n-1):
        a[i+1] += a[i]
        s.append(str(i+1) + ' ' + str(i+2))
        count += 1
print(count)
for i in range(len(s)):
    print (s[i])

Buggy submission (verdict: Runtime Error):
import math
n = int(input())
a = list(map(int,input().split()))
b = sorted(a)
count = 0

        
def expand_a():
    global a,b,count
    def find_i(k):
        for i in range(n):
            if a[i] == b[k]:
                return i+1
    for i in range(1,n):
        if a[i-1] > a[i]:
            for j in range(n):
                if b[j] >= a[i-1]-a[i]:
                    print (str(find_i(j)) +" " + str(i+1))
                    a[i] += b[j]
                    count += 1
                    b = sorted(a)
                    break
            else:
                mc = math.ceil((a[i-1]-a[i])/b[n-1])
                for _ in range(mc):
                    print(str(find_i(n-1)) +" "+ str(i+1))
                a[i] += b[n-1]*mc
                count += mc
                b = sorted(a)
expand_a()
print (count)

Buggy submission (verdict: Runtime Error):
import math
n = int(input())
a = list(map(int,input().split()))
b = sorted(a)
count = 0

def find_i(j):
    global a,b
    for i in range(n):
        if a[i] == b[j]:
            return i+1
        
def expand_a():
    global a,b,count
    for i in range(1,n):
        if a[i-1] > a[i]:
            for j in range(n):
                if b[j] >= a[i-1]-a[i]:
                    a[i] += b[j]
                    print (str(find_i(j)) +" " + str(i+1))
                    count += 1
                    break
            else:
                mc = math.ceil((a[i-1]-a[i])/b[n-1])
                a[i] += b[n-1]*mc
                count += mc
                for _ in range(mc):
                    print(str(find_i(n-1)) +" "+ str(i+1))
expand_a()
print (count)
Problem p03503 (python)

Fixed submission:
n = int(input())
f = [list(map(int,input().split())) for _ in range(n)]
p = [list(map(int,input().split())) for _ in range(n)]

a     = []
count = 0
point = []
PP = []

for _ in range(2**10+1,2**10*2):
    a.append(list(map(int,list(bin(_)[3:]))))

for k in range(2**10-1):
    for i in range(n):
        for j in range(10):
            if f[i][j]&a[k][j] == 1:
                count += 1
        point.append(p[i][count])
        count = 0
    PP.append(sum(point))
    point = []
print (max(PP))

Buggy submission (verdict: Runtime Error):
n = int(input())
f = [list(map(int,input().split())) for _ in range(n)]
p = [list(map(int,input().split())) for _ in range(n)]

a     = []
count = 0
point = []
PP = []

for _ in range(1025,2048):
    a.append(list(map(int,list(bin(_)[3:]))))

for k in range(1024):
    for i in range(n):
        for j in range(10):
            if f[i][j]&a[k][j] == 1:
                count += 1
        point.append(p[i][count])
        count = 0
    PP.append(sum(point))
    point = []
print (max(PP))
Problem p02983 (python)

Fixed submission:
import sys
import math
import numpy as np
INF = 1000000000
MOD = 2019


def input():
    return sys.stdin.readline().rstrip()


def main():
    l, r = [int(e) for e in input().split()]
    ans = INF
    for i in range(l, min(l + MOD, r + 1)):
        for j in range(i + 1, min(l + MOD, r + 1)):
            ans = min(ans, ((i % MOD) * (j % MOD)) % MOD)
    print(ans)


main()

Buggy submission (verdict: Runtime Error):
import sys
import math
import numpy as np
INF = 1000000000
MOD = 2019


def input():
    return sys.stdin.readline().rstrip()


def main():
    l, r = [int(e) for e in input().split()]
    ans = INF
    for i in range(l, min(l + MOD, r + 1)):
        for j in range(j + 1, min(l + MOD, r + 1)):
            ans = min(ans, ((i % MOD) * (j % MOD)) % MOD)
    print(ans)


main()
Problem p03006 (python)

Fixed submission:
import sys
import numpy as np


def main():
    n = int(input())
    balls = [[int(e) for e in input().split()] for _ in range(n)]
    if n == 1:
        print(n)
        sys.exit()
    diff = {}
    for i in range(n):
        for j in range(n):
            if i == j:
                continue
            if ((balls[i][0] - balls[j][0]), (balls[i][1] - balls[j][1])) in diff:
                diff[((balls[i][0] - balls[j][0]), (balls[i][1] - balls[j][1]))] += 1
            else:
                diff[((balls[i][0] - balls[j][0]), (balls[i][1] - balls[j][1]))] = 1
    print(n - max(diff.values()))


main()

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


def main():
    n = int(input())
    balls = [[int(e) for e in input().split()] for _ in range(n)]
    diff = {}
    for i in range(n):
        for j in range(n):
            if i == j:
                continue
            if ((balls[i][0] - balls[j][0]), (balls[i][1] - balls[j][1])) in diff:
                diff[((balls[i][0] - balls[j][0]), (balls[i][1] - balls[j][1]))] += 1
            else:
                diff[((balls[i][0] - balls[j][0]), (balls[i][1] - balls[j][1]))] = 1
    print(n - max(diff.values()))


main()
Problem p03007 (python)

Fixed submission:
import sys
import collections as col
import bisect
import numpy as np


def main():
    n = int(input())
    aarray = [int(e) for e in input().split()]
    aarray.sort()
    record = []
    endpoint = max(1, bisect.bisect(aarray, 0))
    aqueue = col.deque(aarray)
    while len(aqueue) > endpoint + 1:
        amax = aqueue.pop()
        amin = aqueue.popleft()
        record.append((amin, amax))
        aqueue.appendleft(amin - amax)
    amax = aqueue.pop()
    while len(aqueue) > 0:
        amin = aqueue.popleft()
        record.append((amax, amin))
        amax -= amin
    print(amax)
    for r in record:
        print(r[0], r[1])


main()

Buggy submission (verdict: Runtime Error):
import sys
import collections as col
import numpy as np


def main():
    n = int(input())
    aarray = [int(e) for e in input().split()]
    aqueue = col.deque(sorted(aarray))
    record = []
    while len(aqueue) > 2:
        amin = aqueue.popleft()
        amax = aqueue.pop()
        record.append((amin, amax))
        anext = aqueue.pop()
        record.append((anext, (amin - amax)))
        aqueue.append(anext - (amin - amax))
        aqueue = sorted(aqueue)
    if len(aqueue) == 2:
        amin = aqueue.popleft()
        amax = aqueue.pop()
        print(amax - amin)
        record.append((amax, amin))
    else:
        print(aqueue.pop())
    for r in record:
        print(r[0], r[1])


main()
Problem p03078 (python)

Fixed submission:
import sys


def main():
    x, y, z, k = [int(n) for n in input().split()]
    va = sorted([int(n) for n in input().split()], reverse=True)
    vb = sorted([int(n) for n in input().split()], reverse=True)
    xy = min(x*y, k)
    vab = (sorted([a + b for a in va for b in vb], reverse=True))[:xy]
    vc = sorted([int(n) for n in input().split()], reverse=True)
    xyz = min(x*y*z, k)
    print(*((sorted([ab + c for ab in vab for c in vc], reverse=True))[:xyz]), sep="\n")


main()

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


def main():
    x, y, z, k = [int(n) for n in input().split()]
    a = sorted([int(n) for n in input().split()], reverse=True)
    b = sorted([int(n) for n in input().split()], reverse=True)
    c = sorted([int(n) for n in input().split()], reverse=True)
    va = np.array(a)[:, np.newaxis, np.newaxis]
    vb = np.array(b)[np.newaxis, :, np.newaxis]
    vc = np.array(c)[np.newaxis, np.newaxis, :]
    vx = np.arange(1, x + 1)[:, np.newaxis, np.newaxis]
    vy = np.arange(1, y + 1)[np.newaxis, :, np.newaxis]
    vz = np.arange(1, z + 1)[np.newaxis, np.newaxis, :]
    print(*(sorted((va + vb + vc)[(vx * vy * vz) <= k], reverse=True))[:k], sep="\n")


main()
Problem p03330 (python)

Fixed submission:
import sys
import itertools
import numpy as np
MOD = 3
INF = 1000000000


def input():
    return sys.stdin.readline().rstrip()


def main():
    n, c = [int(e) for e in input().split()]
    dMat = [[int(e) for e in input().split()] for _ in range(c)]
    cMat = [[int(e) for e in input().split()] for _ in range(n)]

    cost = [[0 for _ in range(c)] for _ in range(MOD)]
    for hi in range(n):
        for wi in range(n):
            cMod = ((hi + 1) + (wi + 1)) % MOD
            for ci in range(c):
                cost[cMod][ci] += dMat[cMat[hi][wi] - 1][ci]

    ans = INF
    for perm in itertools.permutations(range(c), MOD):
        costSum = 0
        for di in range(MOD):
            costSum += cost[di][perm[di]]
        ans = min(ans, costSum)
    print(ans)


main()

Buggy submission (verdict: Runtime Error):
import sys
import itertools
import numpy as np
MOD = 3
INF = 1000000000


def input():
    return sys.stdin.readline().rstrip()


def main():
    n, c = [int(e) for e in input().split()]
    dMat = [[int(e) for e in input().split()] for _ in range(c)]
    cMat = [[int(e) for e in input().split()] for _ in range(n)]

    cost = [[0 for _ in range(c)] for _ in range(MOD)]
    for hi in range(n):
        for wi in range(n):
            cMod = ((hi + 1) + (wi + 1)) % MOD
            for ci in range(c):
                cost[cMod][ci] += dMat[cMat[hi][wi] - 1][ci]

    ans = INF
    for perm in itertools.permutations(range(c), MOD):
        costSum = 0
        for di in range(MOD):
            costSum += cost[di][perm[di]]
        ans = min(ans, costSum)
    print(ans)


main()
Problem p02995 (python)

Fixed submission:
def gcd(a,b):
  while b!=0:
    a,b=b,a%b
  return(a)

a,b,c,d=map(int,input().split())
cn1=0
cn2=0
cn3=0
an1=0
an2=0
an3=0
cnt=0
ans=0
lm=(c*d)//gcd(c,d)

#bまで
cn1=b//c
cn2=b//d
cn3=b//lm
#aまで
an1=(a-1)//c
an2=(a-1)//d
an3=(a-1)//lm
#aからbまで
cn1=cn1-an1
cn2=cn2-an2
cn3=cn3-an3

cnt=cn1+cn2-cn3
ans=b-a-cnt

print(ans+1)

Buggy submission (verdict: Runtime Error):
import math

a,b,c,d=map(int,input().split())
cn1=0
cn2=0
cn3=0
an1=0
an2=0
an3=0
cnt=0
ans=0
lm=(c*d)//math.gcd(c,d)

#bまで
cn1=b//c
cn2=b//d
cn3=b//lm
#aまで
an1=(a-1)//c
an2=(a-1)//d
an3=(a-1)//lm
#aからbまで
cn1=cn1-an1
cn2=cn2-an2
cn3=cn3-an3

cnt=cn1+cn2-cn3
ans=b-a-cnt

print(ans+1)

Buggy submission (verdict: Runtime Error):
import math

def lcm(x,y):
    return (x*y)//math.gcd(x,y)

a,b,c,d=map(int,input().split())
cn1=0
cn2=0
cn3=0
an1=0
an2=0
an3=0
cnt=0
ans=0
lm=lcm(c,d)

#bまで
cn1=b//c
cn2=b//d
cn3=b//lm
#aまで
an1=(a-1)//c
an2=(a-1)//d
an3=(a-1)//lm
#aからbまで
cn1=cn1-an1
cn2=cn2-an2
cn3=cn3-an3

cnt=cn1+cn2-cn3
ans=b-a-cnt

print(ans+1)

Buggy submission (verdict: Runtime Error):
import math

def lcm(x,y):
    return (x*y)//math.gcd(x,y)

def hantei(A,B,C,D):
    if (A%C==0 or A%D==0) and (B%C==0 or B%D==0):
        return False
    return True

a,b,c,d=map(int,input().split())
cn1=0
cn2=0
cn3=0
an1=0
an2=0
an3=0
cnt=0
ans=0
lm=lcm(c,d)

#bまで
cn1=b//c
cn2=b//d
cn3=b//lm
#aまで
an1=a//c
an2=a//d
an3=a//lm
#aからbまで
cn1=cn1-an1
cn2=cn2-an2
cn3=cn3-an3

cnt=cn1+cn2-cn3
ans=b-a-cnt

if hantei(a,b,c,d):
    ans+=1

print(ans)
Problem p03738 (python)

Fixed submission:
a=int(input())
b=int(input())
if a>b:
    print("GREATER\n")
elif a==b:
    print("EQUAL\n")
else:
    print("LESS\n")

Buggy submission (verdict: Runtime Error):
a=input().split()
if a[0]>a[1]:
    print("GREATER\n")
elif a[0]==a[1]:
    print("EQUAL\n")
else:
    print("LESS\n")

Buggy submission (verdict: Runtime Error):
a=input().split()
if a[0]>a[1]:
    print("GREATER")
elif a[0]==a[1]:
    print("EQUAL")
else:
    print("LESS")
Problem p03455 (python)

Fixed submission:
a, b = map(int,input().split())
c = a*b
 
if c%2 == 0:
    print("Even")
else :
    print("Odd")

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
 
c = a*b
 
if c%2 == 0:
    print("Even")
else :
    print("Odd")

Buggy submission (verdict: Runtime Error):
a = int(input("aa= "))
b = int(input("bb= "))

c = a*b

if c%2 == 0:
    print("Even")
else :
    print("Odd")

Buggy submission (verdict: Runtime Error):
a = int(input("aa= "))
b = int(input("bb= "))

c = a*b

if c%2 == 0:
    print("even")
else :
    print("odd")

Buggy submission (verdict: Runtime Error):
a = int(input("aa= "))
b = int(input("bb= "))

c = a*b

print(c%2)
if c%2 == 0:
    print("even")
else :
    print("odd")
Problem p03470 (python)

Fixed submission:
n = int(input())
a = [0]*n
for i in range(n):
    a[i] = int(input())
a.sort(reverse = True)

s = set(a)
a_list = list(s)
print(len(a_list))

Buggy submission (verdict: Runtime Error):
a = [int(input()) for _ in range(n)]
a.sort(reverse = True)
print(len(list(set(a))))