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

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

Buggy submission (verdict: Runtime Error):
a,b=map(int,[input().split())
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")

Buggy submission (verdict: Runtime Error):
a,b=map(int,input() for i in range(2))
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")

Buggy submission (verdict: Runtime Error):
a,b=map(int,[input() for i in range(2)])
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")
Problem p03456 (python)

Fixed submission:
a,b=input().split()
n=int(a+b)
for i in range(1000):
  if n==i**2:
    print("Yes")
    break
  if n<i**2:
    print("No")
    break

Buggy submission (verdict: Runtime Error):
a, b = input().split()
n = int(a + b)
for i in range(1000):
        if i * i == n:
            print("Yes")
            exit()
        if i * i > num:
            print("No")
            exit()
Problem p03477 (python)

Fixed submission:
a,b,c,d=map(int,input().split())
if a+b > c+d:
    print("Left")
elif a+b == c+d:
    print("Balanced")
else:
    print("Right")

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
if a+b > c+d:
print("Left")
elif a+b == c+d:
print("Balanced")
elif a+b < c+d:
print("Right")

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
if a+b > c+d:
print("Left")
elif a+b == c+d:
print("Balanced")
else:
print("Right")
Problem p03478 (python)

Fixed submission:
n, a, b = map(int, input().split())
t = 0
for num in range(1, n+1):
     sum_dgt = sum(map(int, str(num)))
     if sum_dgt >= a and sum_dgt <= b:
         t += num
print(t)

Buggy submission (verdict: Runtime Error):
n, a, b = map(int, input().split()
t = 0
for num in range(1, n+1):
     sum_dgt = sum(map(int, str(num)))
     if sum_dgt >= a and sum_dgt <= b:
         t += num
print(t)
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(int(((a+b)/2)+1)))
Problem p03494 (python)

Fixed submission:
n=int(input())
l=list(map(int,input().split()))
count=0
while True:
    if all(elem % 2==0 for elem in l):
        count+=1
        for i in range(n):
            l[i]=l[i]//2
    else:
        break
print(count)

Buggy submission (verdict: Runtime Error):
n=int(input())
l=maplist((int,input().split()))
count=0
while True:
    if all(elem % 2==0 for elem in l):
        count+=1
        for i in range(n):
            l[i]=l[i]//2
    else:
        break
print(count)
Problem p03502 (python)

Fixed submission:
s=input()
nums=[int(c) for c in s]
if int(s)%sum(nums)==0:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
s=input()
n=[int(c) for c in s]
 if int(s)%sum(n)==0:
    print('Yes')
else:
    print('No')
Problem p03545 (python)

Fixed submission:
import sys
n=input()
op= ['+', '-']
for op1 in op:
    for op2 in op:
        for op3 in op:
            a = n[0]+op1+n[1]+op2+n[2]+op3+n[3]
            if eval(a) == 7:
                print(a+'=7')
                sys.exit()

Buggy submission (verdict: Runtime Error):
n=input()
pm=[+,-]
for op1 in pm:
  for op2 in pm:
    for op3 in pm:
      if (n[0] op1 n[1] op2 n[2] op3 n[3])==7:
        print("n[0] op1 n[1] op2 n[2] op3 n[3]=7")

Buggy submission (verdict: Runtime Error):
n=int(input())
a = n[0] +or- n[1] +or- n[2] +or-n[3]
if a==7:
  print(a)
Problem p03547 (python)

Fixed submission:
x,y=input().split()
if x > y:
  print(">")
elif x==y:
  print("=")
else:
  print("<")

Buggy submission (verdict: Runtime Error):
X,Y,Z = map(int,input().split(" "))
ans = (X-Z)//(Y+Z)
print(ans)

Buggy submission (verdict: Runtime Error):
X,Y,Z = map(int,input().split())
ans = (X-Z)//(Y+Z)
print(ans)

Buggy submission (verdict: Runtime Error):
x=input()
y=input()
A,B,C,D,E,F=1,2,3,4,5,6
if x > y:
  print(">")
elif x==y:
  print("=")
else:
  print("<")
Problem p03548 (python)

Fixed submission:
X,Y,Z = map(int,input().split())
ans = (X-Z)//(Y+Z)
print(ans)

Buggy submission (verdict: Runtime Error):
x,y,z=input().split()
a=x//(y+z)
b=x%(y+z)
if b>=z:
  print(a)
else:
  print(a-1)
Problem p03549 (python)

Fixed submission:
N,M=map(int,input().split())

ans=((N-M)*100+M*1900)*pow(2,M)

print(str(ans))

Buggy submission (verdict: Runtime Error):
N,M=input().split()

ans=((N-M)*100+M*1900)*pow(2,M)

print(str(ans))
Problem p03555 (python)

Fixed submission:
a=input()
b=input()
if (a[0]==b[2] and a[1]==b[1] and a[2]==b[0]):
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
a,b=input().split("
                  ")
if (a[0]==b[2] and a[1]==b[1] and a[2]==b[0]):
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
a,b=input().split()
if a[0]==b[2] and a[1]==b[1] and a[2]==b[0]:
  print("YES")
else:
  print("NO")
Problem p03557 (python)

Fixed submission:
import bisect

n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort()
b.sort()
c.sort()
A = 0
for x in b:
  i = bisect.bisect_left(a, x)
  j = bisect.bisect_right(c, x)
  if i > 0 and j != len(c):
    A += i * (n - j)
print(A)

Buggy submission (verdict: Runtime Error):
import bisect

n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort()
b.sort()
c.sort()
A = 0
for x in b:
  i = bisect.bisect_left(a, x)
  j = bisect.bisect_right(c, x)
  if i > 0 and j != len(c):
    ans += i * (n - j)
print(ans)
Problem p03563 (python)

Fixed submission:
r=int(input())
g=int(input())
a=2*g-r
print(a)

Buggy submission (verdict: Runtime Error):
r=input()
g=input()
a=2*g-r
print(a)
Problem p03564 (python)

Fixed submission:
n=int(input())
k=int(input())
a=1
for i in range(0,n):
    if a >k:
        a=a+k
    else:
        a=2*a
print(a)

Buggy submission (verdict: Runtime Error):
n=int(input())
k=int(input())
a=1
for i in range(1,n+1):
  if a >k:
    a=a+k
  else:
    a=2a
Problem p03573 (python)

Fixed submission:
a,b,c=input().split(" ")
if a==b:
  print(c)
elif a==c:
  print(b)
else:
  print(a)

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

Fixed submission:
H, W = map(int, input().split())
S = [input() for i in range(H)]
offset_h = (-1,-1,-1,0,0,1,1,1)
offset_w = (-1,0,1,-1,1,-1,0,1)
for h in range(H):
  for w in range(W):
    if S[h][w] == "#":
      print("#", end="")
    else:
      bomb = 0
      for i,j in zip(offset_h, offset_w):
        if h+i >= 0 and h+i < H and w+j >=0 and w+j < W and S[h+i][w+j]=="#":
          bomb += 1
            
      print(bomb, end="")
     
  print("")

Buggy submission (verdict: Runtime Error):
h,w=map(int,input().split())
s=[input() for i in range(h)]

for i in range(h):
  for j in range(w):
    if s[i][j]=="#":
      continue
    count=0
    
    for dx in [-1,0,1]:
      for dy in [-1,0,1]:
        if 0<=i+dy<h and 0<=j+dx<w and s[i+dy][j+dx]=="#":
          count+=1
    s[i][j]=str(count)
    
for a in s:
  print(''.join(a))

Buggy submission (verdict: Runtime Error):
h,w=map(int,input().split())
s=[input() for i in range(h)]

for i in range(h):
  for j in range(w):
    if s[i][j]=="#":
      continue
    count=0
    
    for dx in [-1,0,1]:
      for dy in [-1,0,1]:
        if 0<=i+dy<h and 0<=j+dx<w and s[i+dy][j+dx]=="#":
          count+=1
    s[i][j]=str(count)
    
for a in s:
  print(''.join(a))
Problem p03597 (python)

Fixed submission:
n,a=(int(input()) for _ in range(2))
print(n**2-a)

Buggy submission (verdict: Runtime Error):
n=int(input())
k=int(input())
l=[int(x) for x in input().split()]
s=0
for i in range(n):
  if abs(l[i]-k)>abs(l[i]):
    s+=abs(l[i])
  else:
    s+=abs(l[i]-k)
print(s*2)
Problem p03605 (python)

Fixed submission:
n=input()
if n[0]=="9" or n[1]=="9":
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
n=int(input())
if n[0]==9 or n[1]==9:
  print("Yes")
else:
  print("No")
Problem p03610 (python)

Fixed submission:
l=input()
n=(len(l)+1)//2
odd=""
for i in range(n):
  odd+=l[2*i]
print(odd)

Buggy submission (verdict: Runtime Error):
l=input()
n=(len(l)+1)//2
for i in range(n):
  odd+=l[2*i]
print(odd)
Problem p03624 (python)

Fixed submission:
import string
S = str(input())
a = set(S)
b = set(string.ascii_lowercase)
c = b - a
if len(list(c)) == 0:
    print(None)
else:
    print(sorted(list(c))[0])

Buggy submission (verdict: Runtime Error):
import string
x=input()
a=string.acsii_lowercase
for i in a:
  if i not in x:
    print(i)
    exit()
print("None")

Buggy submission (verdict: Runtime Error):
import string
x=input()
a=string.acsii_lowercase
for i in a
  if i not in x:
    print(i)
    exit()
print("None")

Buggy submission (verdict: Runtime Error):
import string
x=input()
a=string.acsii_lowercase
for i in a
  if a not in x:
    print(x)
    exit()
Problem p03658 (python)

Fixed submission:
n, k = list(map(int, input().split()))
l=[int(x) for x in input().split()]
l.sort()
l.reverse()
print(sum(l[0:k]))

Buggy submission (verdict: Runtime Error):
n, k = list(map(int, input().split()))
l=[int(x) for x in input().split()]
l.sort()
l.reverse()
print(sum(l[0:K]))

Buggy submission (verdict: Runtime Error):
n,k=map(int,input().split())
l=[int(i) for i in input().split()]
a=sorted(l)
for j in range(k):
  s+=a[-(j+1):]
print(s)
Problem p03671 (python)

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

Buggy submission (verdict: Runtime Error):
l=(int(input().split()))
b=sorted(l)
print(b[0]+b[1])
Problem p03730 (python)

Fixed submission:
a,b,c=map(int,input().split())
for i in range(100):
  if (a*i)%b==c:
    print("YES")
    exit()
print("NO")

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
for _ in range(100):
  if (a*i)%b==c:
    print("YES")
    break
  else:
    pass
Problem p03773 (python)

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

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a+b<24:
  print(a+b)
else:
  print(a+b-24
Problem p03778 (python)

Fixed submission:
W, a, b = map(int, input().split())
r = min(a,b)
l = max(a,b)
print(0 if (r+W)>=l else l-(r+W))

Buggy submission (verdict: Runtime Error):
w,a,b=map(int,input().split())
print(min(abs(a+w-B),abs(b+w-a)))
Problem p03796 (python)

Fixed submission:
import math
n = int(input())
print(math.factorial(n) % (10**9+7))

Buggy submission (verdict: Runtime Error):
n=int(input())
for i in range(1,n+1):
  m*=i
print(m%1000000007)
Problem p03827 (python)

Fixed submission:
n=int(input())
s=input()
i=0
m=i
for c in s:
	if c == 'I':
		i+=1
	else:
		i-=1
	m=max(m,i)
print(m)

Buggy submission (verdict: Runtime Error):
n=int(input())
s=input()
l=[0]*n
for i in range(n-1):
  if s[i]==I:
    l[i+1]=l[i]+1
  else:
    l[i+1]=i[i]-1
print(max(l))

Buggy submission (verdict: Runtime Error):
n=int(input())
s=input()
l=[0]*n
for i in range(n):
  if s[i]==I:
    l[i]+=1
  else:
    l[i]-=1
print(max(l))
Problem p03844 (python)

Fixed submission:
print(eval(input()))

Buggy submission (verdict: Runtime Error):
a,b,c=input().split()
a,c=int(a),int(c)
print(abc)
Problem p04043 (python)

Fixed submission:
a=list(map(int,input().split()))
print(['NO','YES'][a.count(5)==2 and a.count(7)==1])

Buggy submission (verdict: Runtime Error):
a=[int(input()) for _ in range(3)]
b=sorted(a)
if b[0]==5 and b[1]==5 and b[2]==7:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
a=[int(input()) for _ in range(3)]
a.sort()
if a[0]==5 and a[1]==5 and a[2]==7:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
a=[int(input()) for _ in range(3)]
if sorted(a)==[5,5,7]:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
a=[int(input()) for _ in range()]
if sorted(a)==[5,5,7]:
  print("YES")
else:
  print("NO")
Problem p03325 (python)

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

for i in a:
    while i%2==0:
        i/=2
        ans+=1

print(ans)

Buggy submission (verdict: Runtime Error):
for i in a:
    while i%2==0:
        i/=2
        ans+=1

print(ans)
Problem p03380 (python)

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

max_num=max(a)
middle_num=max_num/2
num=0

for i in range(n):
    if a[i]> middle_num:
        num=i
        break

if middle_num-a[num-1]<=-middle_num+a[num]:
    print("{} {}".format(max_num,a[num-1]))
else:
    print("{} {}".format(max_num,a[num]))

Buggy submission (verdict: Runtime Error):
import math
import numpy

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

max_num=max(a)
middle_num=math.ceil(max_num/2)
middle_num_up=middle_num
middle_num_down=middle_num

if n>2:
    while True:
        if middle_num_up in a:
            ans=middle_num_up
            break
        if middle_num_down in a:
            ans=middle_num_down
            break
        else:
            middle_num_up+=1
            middle_num_down-=1
else:
    ans=min(a)

print("{} {}".format(max_num,ans)

Buggy submission (verdict: Runtime Error):
import math
import numpy

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

max_num=max(a)
middle_num=math.ceil(max_num/2)
middle_num_up=middle_num
middle_num_down=middle_num

if n>2:
    while True:
        if middle_num_up in a:
            ans=middle_num_up
            break
        if middle_num_down in a:
            ans=middle_num_down
            break
        else:
            middle_num_up+=1
            middle_num_down-=1
else:
    ans=min(a)

print("{} {}".format(max_num,ans)
Problem p03607 (python)

Fixed submission:
N = int(input())
card = set()

for i in range(N):
    A = int(input())
    if A in card:
        card.remove(A)
    else:
        card.add(A)
print(len(card))

Buggy submission (verdict: Runtime Error):
# coding: utf-8
# Here your code !
list = []
for i in range(1000):
    list.append(0)
N = int(input())
for i in range(N):
    a = int(input())
    if list[a - 1] == 0:
        list[a-1] = 1
    else:
        list[a-1] = 0
print(list.count(1))
Problem p03611 (python)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
ans = [0]*(10**5+3)

for i in range(N):
    ans[A[i]-1] +=1
    ans[A[i]] +=1
    ans[A[i]+1] +=1

print(max(ans))

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
ans = [0]*max(A)

if N ==1:
    ans[0] = 1
else:
    for X in range(max(A)):
        for i in range(N):
            if abs(X-A[i])<=1:
                ans[X]+=1

print(max(ans))
Problem p03633 (python)

Fixed submission:
N = int(input())
T= [0]*N
for i in range(N):
    T[i] = int(input())
T.sort(reverse=True)
def gcd(n,m):
    while m > 0:
        n , m = m , n%m
    return n
def lcm(n,m):
     x = n*m//gcd(n,m)
     return x
for i in range(N-1):
    T[i+1] = lcm(T[i],T[i+1])
print(T[N-1])

Buggy submission (verdict: Runtime Error):
N = int(input())
T= [0]*N
for i in range(N):
    T[i] = int(input())
T.sort(reverse=True)
def gcd(n,m):
    while m != 0:
        n , m = m , n%m
    return n
def lcm(n,m):
     x = (n/gcd(n,m))*m
     return int(x)
ans = T[0]
for i in range(1,N):
    ans = lcm(ans,T[i])
print(ans)
Problem p03274 (python)

Fixed submission:
a, b = map(int, input().split())
s = list(map(int,input().split( )))
c=a-b
e = 10000000000
if a==b:
  e=s[b-1]-s[0]+min(abs(s[b-1]),abs(s[0]))
else:
  for j in range(0,c+1):
    if e>s[j+b-1]-s[j]+min(abs(s[j+b-1]),abs(s[j])):
      e=s[j+b-1]-s[j]+min(abs(s[j+b-1]),abs(s[j]))
print(e)

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
s = list(map(int,input().split( )))
c=a-b
e = 10000000000
if a==b:
  e=s[b]-s[0]+min(abs(s[b]),abs(s[0]))
else:
  for j in range(0,c+1):
    if e>s[j+b-1]-s[j]+min(abs(s[j+b-1]),abs(s[j])):
      e=s[j+b-1]-s[j]+min(abs(s[j+b-1]),abs(s[j]))
print(e)
Problem p03337 (python)

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

Buggy submission (verdict: Runtime Error):
n = int(input())
s = input()
out = [len(set(s[:i])&set(s[i:])) for i in range(n)]
print(max(out))
Problem p03351 (python)

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

if abs(a-c)<=d:
    print("Yes")
else:
    if abs(a-b)<=d and abs(b-c)<=d:
        print("Yes")
    else:
        print("No")

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


if abs(a-c)<=d:
    print("yes")
else:
    if (abs(a-b)<=d) and (abs(b-c)<=d):
        print("yes")
    else:
        print("no")

Buggy submission (verdict: Runtime Error):
l = map(int, raw_input().split())
if abs(l[1]-l[3])<=l[4]:
    print("yes")
else:
    if abs(l[1]-l[2])<=l[4] and abs(l[2]-l[3])<=l[4]:
        print("yes")
    else:
        print("no")

Buggy submission (verdict: Runtime Error):
a,b,c,d = map(int, raw_input().split())
if abs(a-c)<=d:
    print("yes")
else:
    if abs(a-b)<=d and abs(b-c)<=d:
        print("yes")
    else:
        print("no")
Problem p03636 (python)

Fixed submission:
s=input()
s=str(s)
n=len(s)-2
n=str(n)
print (s[0]+n+s[-1])

Buggy submission (verdict: Runtime Error):
a
Problem p03997 (python)

Fixed submission:
a=input()
b=input()
h=input()
a=int(a)
b=int(b)
h=int(h)
print (int((a+b)*h/2))

Buggy submission (verdict: Runtime Error):
a
Problem p03280 (python)

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

print(x*y - x - y +1)

Buggy submission (verdict: Runtime Error):
x,y = map(int,input().split)

print(x*y - x - y +1)
Problem p03284 (python)

Fixed submission:
n,k = [int(x) for x in input().split()]
if n % k == 0:
  print(0)
else :
  print(1)

Buggy submission (verdict: Runtime Error):
n,k = [int(x) for x in input().split()]
if n % k == 0:
  prtint(0)
else :
  print(1)
Problem p03289 (python)

Fixed submission:
import re

string  = input()

m = re.match('A[a-z]+C[a-z]+',string)

if m != None:
  if m.group() == string:
    print('AC')
    exit()
print('WA')

Buggy submission (verdict: Runtime Error):
import re

string  = input()

m = re.match('A[a-z]+C[a-z]+',string)
if m.group() == string:
  
  print('AC')
else:
  print('WA')
Problem p03292 (python)

Fixed submission:
l = [int(x) for x in input().split()]
l.sort()
print(l[2]-l[1]+l[1]-l[0])

Buggy submission (verdict: Runtime Error):
l = [int(x) for x in input().split()]
sort(l)
print(l[2]-l[1]+l[1]-l[0])
Problem p03308 (python)

Fixed submission:
input()
num_list = [int(x) for x in input().split()]

print(max(num_list)- min(num_list))

Buggy submission (verdict: Runtime Error):
input()
num_list = [int(x) for x in input().split()]

print(num_list.max - num_list.min )
Problem p03323 (python)

Fixed submission:
#coding:utf-8
import sys

input_nums = [int(x) for x in sys.stdin.readline().split()]

if len(input_nums) > 2 :
	sys.exit("illegal input")
    
if (sum(input_nums)) > 16:
  sys.exit("illegal input")
  
if (min(input_nums)) < 1:
  sys.exit("illegal input")

max_num = max(input_nums)
if max_num > 16:
  sys.exit("illegal input")
elif max_num > 8:
  print(":(")
else :
  print('Yay!')

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

input_nums = [int(x) for x in split(readline())]

if len(input_num) > 2 :
	sys.exit("illegal input")
    
if (sum(input_nums)) > 16:
  sys.exit("illegal input")
  
if (min(input_nums)) < 1:
  sys.exit("illegal input")
  
if (max_num = max(input_nums)) > 16:
  sys.exit("illegal input")
elif max_num > 8:
  print(":(")
else :
  print('Yay!')
Problem p03830 (python)

Fixed submission:
S=int(input());
s=[];
x=[];
X=[];
so=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997];
ans=1;
for h in range(S):
    Y=h+1;
    for i in so:
        j=0;
        while Y%i==0:
            Y=Y/i;
            s=s+[i];
            j+=1;
for i in so:
    x=x+[s.count(i)];
X=[X+1 for X in x];
for i in X:
    ans=ans*i;
print(ans%1000000007);

Buggy submission (verdict: Runtime Error):
S=input();
s=[];
x=[];
X=[];
so=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,83,89,97,101,107,109,113,127,131,137,139,149,151,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,809,811,821,823,827,829,839,853,857,859,863,877,881,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997];
ans=1;
for h in range(S):
    Y=h+1;
    for i in so:
        j=0;
        while Y%i==0:
            Y=Y/i;
            s=s+[i];
            j+=1;
for i in so:
    x=x+[s.count(i)];
X=[X+1 for X in x];
for i in X:
    ans=ans*i;
print(ans%1000000007);

Buggy submission (verdict: Runtime Error):
S=input();
s=[];
x=[];
X=[];
so=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,83,89,97,101,107,109,113,127,131,137,139,149,151,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,809,811,821,823,827,829,839,853,857,859,863,877,881,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997];
ans=1;
for h in range(S):
    Y=h+1;
    for i in so:
        j=0;
        while Y%i==0:
            Y=Y/i;
            s=s+[i];
            j+=1;
for i in so:
    x=x+[s.count(i)];
X=[X+1 for X in x];
print(X);
for i in X:
    ans=ans*i;
print(ans%1000000007);
Problem p03469 (python)

Fixed submission:
s = input()
print("2018" + s[4:])

Buggy submission (verdict: Runtime Error):
print(input().replace("2017", "2018))
Problem p03477 (python)

Fixed submission:
a, b, c, d = map(int, input().split())
l, r = a + b, c + d
if r < l:
  print("Left")
elif l < r:
  print("Right")
else:
  print("Balanced")

Buggy submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())
l = a + b
r = c + d
print("Left" if l > r else "Balanced" if l = r else "Right" if l < r else)

Buggy submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())
l = a + b
r = c + d
print("Left" if l > r else "Balanced" if l = r else "Right")

Buggy submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())
l = a + b
r = c + d
print("Left" if l > r "Balanced" if l = r else "Right")
Problem p03729 (python)

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

Buggy submission (verdict: Runtime Error):
s = input().split()
a, b, c = s[0], s[1], s[2]
if b.startswith(a[-1:]) and c.stratswith(b[-1:]):
  print("YES")
else:
  print("NO")
Problem p03485 (python)

Fixed submission:
import math


def main():
    a, b = map(int, input().split())
    print(math.ceil((a+b)/2))


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
#include <iostream>
#include <cmath>
using namespace std;


int main()
{
  float a, b;

  cin >> a >> b;
  cout << (int)round((a+b)/2) << endl;
  
  return 0;
}