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

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
Nc = 1
e = 0
B = [0]*N
for i in A:
    if (N-i-1) < 0:
        e = 1
        Nc = 0
        break
if e ==0:
    if A.count(0) >= 2:
        Nc *= 0
    else:
        if A.count(0) == 1:
            A.remove(0)
        for i in A:
            B[i] = B[i] + 1
        for i in B:
            if i == 2:
                Nc *= 2
            elif i == 0:
                Nc *= 1
            else:
                Nc *= 0
                break
print(Nc%1000000007)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
Nc = 1
if A.count(0) >= 2:
    Nc *= 0
else:
    for i in range(N):
        if (N-A[i]-1) >= 0:
                if A.count(i+1) == 2:
                    Nc = Nc*2
                elif A.count(i+1) == 0:
                else:
                    Nc *= 0
                    break
        else:
            Nc *= 0
            break

print(Nc%1000000007)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
Nc = 1
if A.count(0) >= 2:
    Nc *= 0
else:
    for i in range(N):
        if (N-A[i]) >=1
                if A.count(i+1) == 2:
                    Nc = Nc*2%1000000007
                elif A.count(i+1) == 0:
                    Nc *= 1
                else:
                    Nc *= 0
                    break
        else:
            Nc *= 0
            break

print(Nc)
Problem p03860 (python)

Fixed submission:
s = input()
A = 'A' + s[8] + 'C'
print(A)

Buggy submission (verdict: Runtime Error):
a, b, x = map(int,input().split())
N = 0
if a%x ==0:
    N = int((b-a)//x)+1
else:
    c = a + (x-a%x)
    if b>=c:
        N = int((b-c)//x)+1
print(N)
Problem p03962 (python)

Fixed submission:
a, b, c = map(int,input().split())
list = [a, b, c]
N = len(set(list))
print(N)

Buggy submission (verdict: Runtime Error):
import math

N = int(input())
T = []
A = []
Nb = 0
for i in range(N):
    a, b = map(int,input().split())
    T.append(a)
    A.append(b)
Tn = T[0]
An = A[0]
for i in range(N):
        tmp = math.ceil(max(Tn / T[i], An / A[i]))
        Nb = (T[i] + A[i])*tmp
        Tn = T[i] * tmp
        An = A[i] * tmp
print(Nb)
Problem p03964 (python)

Fixed submission:
N = int(input())
T = []
A = []
Nb = 0
for i in range(N):
    a, b = map(int,input().split())
    T.append(a)
    A.append(b)
Tn = 1
An = 1
for i in range(N):
        tmp = max((Tn+T[i]-1) // T[i], (An+A[i]-1) // A[i])
        Tn = T[i] * tmp
        An = A[i] * tmp
print(Tn + An)

Buggy submission (verdict: Runtime Error):
N = int(input())
T = []
A = []
Nb = 0
for i in range(N):
    a, b = map(int,input().split())
    T.append(a)
    A.append(b)
Tn = 1
An = 1
for i in range(N):
        tmp = max(math.ceil(Tn / T[i]), math.ceil(An / A[i]))
        Tn = T[i] * tmp
        An = A[i] * tmp
print(Tn + An)
Problem p03697 (python)

Fixed submission:
A,B = map(int, input().split(" "))
if A+B >= 10:
    print("error")
else:
    print(A+B)

Buggy submission (verdict: Runtime Error):
A,B = input().split(" ")
if A+B >= 10:
    print("error")
else:
    print(A+B)
Problem p03699 (python)

Fixed submission:
import itertools

DIM = int(input())
args = [int(input()) for a in range(DIM)]
temp = list(map(lambda x:x%10, args))
if sum(temp) == 0:
    print(0)
    exit()
i = DIM
while(i>0):
    comb = list(itertools.combinations(args, i))
    combMax = list(map(sum, comb))
    for c in sorted(combMax, reverse=True):
        if c%10==0:
            continue
        else:
            print(c)
            exit()
    i = i -1
print(0)
exit()

Buggy submission (verdict: Runtime Error):
import itertools

DIM = int(input())
args = [int(input()) for a in range(DIM)]
temp = list(map(lambda x:x%10, args))
if sum(temp) == 0:
    exit(0)
i = DIM
while(i>0):
    comb = list(itertools.combinations(args, i))
    combMax = list(map(sum, comb))
    for c in sorted(combMax, reverse=True):
        if c%10==0:
            continue
        else:
            exit(c)
    i = i -1
print(0)
exit()

Buggy submission (verdict: Runtime Error):
import itertools

DIM = int(input())
args = [int(input()) for a in range(DIM)]
temp = list(map(lambda x:x%10, args))
if sum(temp) == 0:
    exit(0)
i = DIM
while(i>0):
    comb = list(itertools.combinations(args, i))
    combMax = list(map(sum, comb))
    print(comb)
    print(combMax)
    for c in sorted(combMax, reverse=True):
        if c%10==0:
            continue
        else:
            exit(c)
    i = i -1
print(0)
exit()

Buggy submission (verdict: Runtime Error):
import itertools

DIM = int(input())
args = [int(input()) for a in range(DIM)]
i = DIM
while(i>0):
    comb = list(itertools.combinations(args, DIM))
    combMax = list(map(sum, comb))
    for c in combMax.sort().reversed():
        if c%10==0:
            continue
        else:
            print(c)
            exit()
    i = i -1
print(0)
exit()
Problem p03693 (python)

Fixed submission:
r, g, b = map(int, input().split())
rgb = r * 100 + g * 10 + b
if rgb % 4 == 0:
    output = "YES"
else:
    output = "NO"
print(output)

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

output = int(max(data)) - int(min(data))
print(output)
Problem p03694 (python)

Fixed submission:
N = int(input())
data = input().split()

output = int(max(data)) - int(min(data))
print(output)

Buggy submission (verdict: Runtime Error):
N = int(input())
a = [input() for i in range(N)]

output = int(max(a)) - int(min(a))
print(output)
Problem p03693 (python)

Fixed submission:
inps = [i for i in input().split()]
sorted(inps)
inpsS = "".join(inps)
inpsI = int(inpsS)
if inpsI % 4 == 0:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
import math

ranks = [False for i in range(8)]
highs = 0
n = int(input())
inps = [int(i) for i in input().split()]
highs = min(len([i for i in inps if i > 3199]), 8)
inps = [i for i in inps if i <= 3199]
for i in inps:
    ranks[math.floor(i/399)] = True

lows = len([i for i in ranks if i == True]) 

minimum = max(lows, 1)
maximum = lows + highs

print(minimum, maximum)
Problem p03695 (python)

Fixed submission:
import math

ranks = [False for i in range(8)]
highs = 0
n = int(input())
inps = [int(i) for i in input().split()]
highs = len([i for i in inps if i > 3199])
inps = [i for i in inps if i <= 3199]
for i in inps:
    if i >= 1 and i <= 399:
        ranks[0] = True
    elif i >= 400 and i <= 799:
        ranks[1] = True
    elif i >= 800 and i <= 1199:
        ranks[2] = True
    elif i >= 1200 and i <= 1599:
        ranks[3] = True
    elif i >= 1600 and i <= 1999:
        ranks[4] = True
    elif i >= 2000 and i <= 2399:
        ranks[5] = True
    elif i >= 2400 and i <= 2799:
        ranks[6] = True
    elif i >= 2800 and i <= 3199:
        ranks[7] = True
lows = len([i for i in ranks if i == True])

minimum = max(lows, 1)
maximum = lows + highs

print(minimum, maximum)

Buggy submission (verdict: Runtime Error):
import math

ranks = [False for i in range(8)]
highs = 0
n = int(input())
inps = [int(i) for i in input().split()]
highs = len([i for i in inps if i > 3199])
inps = [i for i in inps if i <= 3199]
for i in inps:
    ranks[math.floor(i/399)] = True

lows = min(len([i for i in ranks if i == True]), 8) 

minimum = max(lows, 1)
maximum = lows + highs

print(minimum, maximum)

Buggy submission (verdict: Runtime Error):
import math

ranks = [False for i in range(8)]
highs = 0
n = int(input())
inps = [int(i) for i in input().split()]
highs = len([i for i in inps if i > 3199])
inps = [i for i in inps if i <= 3199]
for i in inps:
    ranks[math.floor(i/399)] = True

lows = len([i for i in ranks if i == True]) 

minimum = max(lows, 1)
maximum = lows + highs

print(minimum, maximum)

Buggy submission (verdict: Runtime Error):
import math

ranks = [False for i in range(8)]
highs = 0
n = int(input())
inps = [int(i) for i in input().split()]
highs = min(len([i for i in inps if i > 3199]), 8)
inps = [i for i in inps if i <= 3199]
for i in inps:
    ranks[math.floor(i/399)] = True

lows = len([i for i in ranks if i == True]) 

minimum = max(lows, 1)
maximum = lows + highs

print(minimum, maximum)

Buggy submission (verdict: Runtime Error):
import math

ranks = [False for i in range(8)]
highs = 0
n = int(input())
inps = [int(i) for i in input().split()]
highs = len([i for i in inps if i > 3199])
inps = [i for i in inps if i <= 3199]
for i in inps:
    ranks[math.floor(i/399)] = True

lows = len([i for i in ranks if i == True]) 

minimum = lows + (1 if ranks != 0 else 0) - 1
maximum = lows + highs

print(minimum, maximum)
Problem p03711 (python)

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

a = [0,1,3,1,2,1,2,1,1,2,1,2,1]

if a[x] == a[y]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
import sys

l_1 = [1,3,5,7,8,10,12]
l_2 = [4,6,9,11]

x, y = map(int, input().split())

if x == 2:
    if y == 2:
        print("yes")
    else:
        print("no")
elif x in l_1:
    if y in x_1:
        print("yes")
    else:
        print("no")
else x in l_2:
    if y in l_2:
        print("yes")
    else:
        print("no")

Buggy submission (verdict: Runtime Error):
import sys

l_1 = [1,3,5,7,8,10,12]
l_2 = [4,6,9,11]

x,y = map(list(int,input()).split())

if x == 2:
    if y == 2:
        print("yes")
    else:
        print("no")
elif x in l_1:
    if y in x_1:
        print("yes")
    else:
        print("no")
else x in l_2:
    if y in l_2:
        print("yes")
    else:
        print("no")

Buggy submission (verdict: Runtime Error):
l_1 = [1,3,5,7,8,10,12]
l_2 = [4,6,9,11]
l_3 = [2]

x,y = map(list(int,input()).split())

if x == 2:
    if y == 2:
        print("yes")
    else:
        print("no")
elif x in l_1:
    if y in x_1:
        print("yes")
    else:
        print("no")
else x in l_2:
    if y in l_2:
        print("yes")
    else:
        print("no")
Problem p03759 (python)

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

if b - a == c - b:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
O = input()
E = input()
X = ""

for i in range(len(E)):
    X += (O[i] + E[i])

if len(O) != len(E):
    X += O[-1]
    
print(X)
Problem p03759 (python)

Fixed submission:
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
if b - a == c - b:
    print('YES')
else:
    print('NO')

Buggy submission (verdict: Runtime Error):
a = input()
b = input()
i = 0
for i in range(len(a)):
    print(a[i], end = '')
    if i == len(b):
        break
    print(b[i], end = '')

Buggy submission (verdict: Runtime Error):
a = input()
b = input()
n = len(b)
x = 0
i = 0
j = 0
while (x < n * 2):
    if x % 2:
        print(b[i], end = '')
        i += 1
    else:
        print(a[j], end = '')
        j += 1
    x += 1
print('')
Problem p03699 (python)

Fixed submission:
#!/bin/usr/python

n = input()

s = [0 for i in range(100)]
a = 0

for i in range(n):
  s[i] = input()
  a += s[i]

flag = True
if a % 10 == 0:
  s = sorted(s)
  for i in range(n):
    if s[-1*n + i] % 10 != 0:
      a -= s[-1*n + i]
      break

if a % 10 == 0:
  a = 0

print(a)

Buggy submission (verdict: Runtime Error):
#!/bin/usr/python

n = input()

s = [0 for i in range(100)]
a = 0

for i in range(n):
  s[i] = input()
  a += s[i]

flag = True
if a % 10 == 0:
  s = sorted(s)
  for i in range(n):
    if s[-1*n + i] % 10 != 0:
      a -= s[-1*n + i]
      break

if a % 10 == 0:
  a = 0

print(a)
Problem p03714 (python)

Fixed submission:
import heapq

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

red, blue = a[:n], [-1*i for i in a[2*n:]]
sr, sb = sum(red), sum(blue)

results = [0] * (n + 1)
results[0] = sr
results[-1] = sb

heapq.heapify(red)
heapq.heapify(blue)

for k in range(n, 2*n):
    v = a[k]
    p = heapq.heappushpop(red, v)
    sr += v - p
    results[k-n+1] += sr

for k in range(2*n-1, n-1, -1):
    v = -1 * a[k]
    p = heapq.heappushpop(blue, v)
    sb += v - p
    results[k-n] += sb

print(max(results))

Buggy submission (verdict: Runtime Error):
import heapq

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

red, blue = a[:n], [-1*i for i in a[2*n:]]
sr, sb = sum(red), sum(blue)

results = [0] * (n + 1)
results[0] = sr
results[-1] = sb

heapq.heapify(red)
heapq.heapify(blue)

for k in range(n, 2*n):
    v = a[k]
    p = heapq.heappushpop(red, v)
    sr += v - p
    results[i-n+1] += sr

for k in range(2*n-1, n-1, -1):
    v = -1 * a[k]
    p = heapq.heappushpop(blue, v)
    sb += v - p
    results[i-n] += sb

print(max(results))
Problem p03697 (python)

Fixed submission:
ilist =  input().split(" ")
ans = int(ilist[0]) + int(ilist[1] )
if ans >= 10:
        print("error")
else :
        print(ans)

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


ans = a + b
if ans >= 10:
        print("error")
else :
        print(ans)
Problem p03697 (python)

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

total = A+B

if A >= 1 and B <=9 :
    if total < 10:
        print(total)
    else:
        print('error')

Buggy submission (verdict: Runtime Error):
s = input()
c = 0

#check for constraints
if 2<=len(s) and len(s) <= 26:
    s2 = ''.join(sorted(s))
    for i in s2:
        if c > len(s):
            quit()
        if s2[c] == s2[c+1]:
            print("no")  # string is not unique
            quit()
        elif s2[c] != s2[c+1]:
            c = c + 1
else: quit()

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

total = A+B

if A >= 1 and B <= :
    if total < 10:
        print(total)
    else:
        print('error')
Problem p03697 (python)

Fixed submission:
a,b = map(int, input().split())
if (a+b>=10):
	print("error")
else:
	print(a+b)

Buggy submission (verdict: Runtime Error):
文字列を取り込む。
文字数を数える。
文字列をソートする。
最初の文字と二番目の文字が同じかどうか確認する。
同じならば'NO'を出力する。
違うならば二番目の文字列と三番目の文字列が同じかどうか確認する。
同じならば'NO'を出力する。
・
・
・
最後から一つ前の文字と最後の文字を確認して違うならば
'YES'を出力する。
Problem p03777 (python)

Fixed submission:
a, b = [(i) for i in input().split()]
if a == 'H':
    if b == 'H':
        print('H')
    else:
        print('D')
else:
    if b == 'H':
        print('D')
    else:
        print('H')

Buggy submission (verdict: Runtime Error):
import math
w, a, b = [int(i) for i in input().split()]
if a+w < b:
    print(int(math.fabs(b-a-w)))
elif b+w < a:
    print(int(math.fabs(b+w-a)))
else:
    print(int(0))
Problem p03778 (python)

Fixed submission:
import math
w, a, b = [int(i) for i in input().split()]
if a+w < b:
    print(int(math.fabs(b-a-w)))
elif b+w < a:
    print(int(math.fabs(b+w-a)))
else:
    print(int(0))

Buggy submission (verdict: Runtime Error):
w, a, b = [int(i) for i in input().split()]
if a+w < b:
    print(fabs(b-a-w))
elif b+w < a:
    print(fabs(b+w-a))
else:
    print(0)

Buggy submission (verdict: Runtime Error):
w, a, b = [int(i) for i in input().split()]
if a+w < b:
    print(fabs(b-a-w))
elif b+w < a:
    print(fabs(b-a-w))
else:
    print(0)
Problem p03719 (python)

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

if a<=c and b>=c:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
. 
if a<=c and b>=c:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
2. 
3.if a<=c and b>=c:
4.    print("Yes")
5.else:
6.    print("No")

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

if a<=c and b>=c:
    print("Yes")
else;
    print("No")
Problem p03720 (python)

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

alllist=[]

for i in range(b):
    tmp=list(map(int,input().split()))
    alllist.extend(tmp)

for chk in range(a):
    print(alllist.count(chk+1))

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

alllist=[]
for i in range(b):
    tmp=list(map(int,input().split())
    alllist.append(tmp)

for chk in range(a):
    print(list.alllist(chk+1))
Problem p03721 (python)

Fixed submission:
a,b=map(int,input().split())
alllist=[]
goukei=1
for i in range(a):
    tmplist=list(map(int,input().split()))
    alllist.append(tmplist)

alllist2=sorted(alllist)
for i in range(a):
    goukei=alllist2[i][1]+goukei
    if goukei>b:
        owari=alllist2[i][0]
        break
    else:
        pass

print(owari)

Buggy submission (verdict: Runtime Error):

a,b=map(int,input().split())
alllist=[]
goukei=0
for i in range(a):
    tmplist=list(map(int,input().split()))
    alllist.append(tmplist)

alllist2=sorted(alllist)
for i in range(a):
    goukei=alllist2[i][1]+goukei
    if goukei>b:
        owari=alllist2[i][0]
        break
    else:
        pass

print(owari)

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
alllist=[]
goukei=0
for i in range(a):
    tmplist=list(map(int,input().split()))
    alllist.append(tmplist)
    
sorted(alllist)
for i in range(a):
    goukei=alllist[a][1]+goukei
    if goukei>b:
        owari=alllist[a][0]
        break
    else:
        pass

print(owari)

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

goukei=0
for i in range(a):
    aN,bN=map(int,input().split())
    goukei=bN+goukei
    if goukei>b:
        owari=aN
        break
    else:
        pass

print(owari)
Problem p03729 (python)

Fixed submission:
a,b,c = map(str,input().split())
 
if a[-1]==b[0] and b[-1]==c[0]:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input(),split())
d=0

for n=range(1,b+1):
    if n*a%b==c:
        d=d+1
    else:
        d=d:
if d>0:
    print("YES")
else:
    print("NO")

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

if a[-1]=b[0] and b[-1]=c[0]:
    print("YES")
else:
    print("NO")
Problem p03730 (python)

Fixed submission:
a,b,c=map(int,input().split())
d=0
 
for n in range(1,b+1):
    if n*a%b==c:
        d=d+1
    else:
        d=d
if d>0:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input(),split())
d=0
 
for n in range(1,b+1):
    if n*a%b==c:
        d=d+1
    else:
        d=d
if d>0:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input(),split())
d=0
 
for n in range(1,b+1):
    if n*a%b==c:
        d=d+1
    else:
        d=d:
if d>0:
    print("YES")
else:
    print("NO")
Problem p03738 (python)

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

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

if a>b:
    print("GREATER")
elif a<b:
    print("LESS")
else:
    print(EQUAL)
Problem p03740 (python)

Fixed submission:
a,b=map(int,input().split())
 
if abs(a-b)<2:
    print("Brown")
else:
    print("Alice")

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

if abs(a-b)<2:
    print("Brown")
elif:
    print("Alice")
Problem p03759 (python)

Fixed submission:
a,b,c = map(int,input().split())
if b-a == c-b:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
s=[]
if len(a)==len(b):
    for i in range(len(a)):
        s.append(a[i])
        s.append(b[i])
else:
    for i in range(len(b)):
        s.append(a[i])
        s.append(b[i])
    s.append(a[-1])
print("".join(s))

Buggy submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
if  (b−a) == (c−b):
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
if  b−a == c−b:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
if  b−a == c−b:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
if  b−a == c−b:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
if  b−a == c−b:
  print ("YES")
else:
  print ("NO")

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split().split())
if  b−a == c−b:
  print ("YES")
else:
  print ("NO")

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split().split())
if  b−a == c−b:
  print ("YES")
else:
  print ("NO")

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split().split())
if  b−a == c−b:
  print ("YES")
else:
 print("NO")

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split().split())
if  b−a==c−b:
  print ("YES")
elif print("NO")

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split().split())
if  b−a=c−b:
  print ("YES")
elif print("NO")
Problem p03760 (python)

Fixed submission:
a=input()
b=input()
s=[]
if len(a)==len(b):
    for i in range(len(a)):
        s.append(a[i])
        s.append(b[i])
else:
    for i in range(len(b)):
        s.append(a[i])
        s.append(b[i])
    s.append(a[-1])
print("".join(s))

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
s=[]
if len(a)==len(b):
    for i in range(len(a)):
        s.append(a[i])
        s.append(b[i])
else:
    for i in range(len(b)):
        s.append(a[i])
        s.append(b[i])
    s.append(a[range(len(b))+1])
print("".join(s))

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
s=[]
for i in range(len(a)):
    s.append(a[i])
    s.append(b[i])
print("".join(s))

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
s=[]
for i in range(a):
    s.append(a[i])
    s.append(b[i])
print("".join(s))

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
s=[]
for i in range(a):
    s=append(s,a(i),b(i))
Problem p03773 (python)

Fixed submission:
a, b=map(int, input().split())
c=a+b
if c<24:
  print (c)
elif c>=24:
  print (c-24)

Buggy submission (verdict: Runtime Error):
a, b=map(int, input().split())
2.c=a+b
3.if c<24:
4.  print (c)
5.elif c>=24:
6.  print (c-24)
Problem p03697 (python)

Fixed submission:
rawIn= input()
rawIn= rawIn.split(' ')
a=int(rawIn[0])
b=int(rawIn[1])
if a+b >= 10:
    print('error')
else:
    print(a+b)

Buggy submission (verdict: Runtime Error):
a= int(input())
b=int(input())
if a+b >= 10:
    print('error')
else:
    print(a+b)
Problem p03711 (python)

Fixed submission:
l = raw_input().split(" ")
#print(l[0])
#print(l[1])

a=[1,3,5,7,8,10,12]
b=[4,6,9,11]
c=[2]

ans="No"


if (int(l[0]) in a and int(l[1]) in a):
    ans="Yes"

if (int(l[0]) in b and int(l[1]) in b):
    ans="Yes"

if (int(l[0]) in c and int(l[1]) in c):
    ans="Yes"

print(ans)

Buggy submission (verdict: Runtime Error):
 b.py  a.py                                                                    X
l = raw_input().split(" ")


a=[1,3,5,7,8,10,12]
b=[4,6,9,11]
c=[2]

ans="No"

if (l[0] in a and l[1] in a):
    ans="Yes"
if (l[0] in b and l[1] in b):
    ans="Yes"
if (l[0] in c and l[1] in c):
    ans="Yes"

print(ans)

Buggy submission (verdict: Runtime Error):
 b.py  a.py                                                                    X
l = raw_input().split(" ")


a=[1,3,5,7,8,10,12]
b=[4,6,9,11]
c=[2]

ans="No"

if (l[0] in a and l[1] in a):
    ans="Yes"
if (l[0] in b and l[1] in b):
    ans="Yes"
if (l[0] in c and l[1] in c):
    ans="Yes"

print(ans)

Buggy submission (verdict: Runtime Error):
l = raw_input().split(" ")


a=[1,3,5,7,8,10,12]
b=[4,6,9,11]
c=[2]

ans="NO"

if (l[0] in a and l[1] in a):
    ans="YES"
if (l[0] in b and l[1] in b):
    ans="YES"
if (l[0] in c and l[1] in c):
    ans="YES"

print(ans)
Problem p03712 (python)

Fixed submission:
N, M = map(int ,raw_input().split())
s="#"*(M+2)
a=[]

a.append(s)
for i in range(N):
    a.append("#"+raw_input()+"#")
a.append(s)

for i in range(N+2):
    print(a[i])

Buggy submission (verdict: Runtime Error):
N, M = map(int ,raw_input().split())
s="#"*(M+2)
a=[]

a.append(s)
for i in range(N):
    a.append("#"+raw_input()+"#")

a.append(s)

for i in range(N+2):
    print(a[i])
Problem p03962 (python)

Fixed submission:
from sys import stdin

a = set((int(x) for x in stdin.readline().split()))

print(len(a))

Buggy submission (verdict: Runtime Error):
from sys import stdin

a = map((int(x) for x in stdin.readline().split()))

print(len(a))