Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
import itertools

n = int(input())

l = list(map(int, input().split()))

zzz = list(itertools.combinations(l,3))

cnt = 0

for z in zzz:
    
    a = z[0]
    b = z[1]
    c = z[2]

    if abs(b-c) < a < b+c:
         cnt += 1

print(cnt)


Fixed submission:
import bisect

n = int(input())

l = list(map(int, input().split()))

l.sort()

cnt = 0

for i in range(n):
    for j in range(i):
        cnt += bisect.bisect_left(l,l[i]+l[j]) - (i + 1)

print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
import itertools

n = int(input())

l = list(map(int, input().split()))

zzz = list(itertools.combinations(l,3))

cnt = 0

for z in zzz:
    
    a = z[0]
    b = z[1]
    c = z[2]

    if a >= b + c:
        continue

    if b >= c + a:
        continue

    if c >= a + b:
        continue

    cnt += 1

print(cnt)


Fixed submission:
import bisect

n = int(input())

l = list(map(int, input().split()))

l.sort()

cnt = 0

for i in range(n):
    for j in range(i):
        cnt += bisect.bisect_left(l,l[i]+l[j]) - (i + 1)

print(cnt)
Buggy python submission (verdict: Runtime Error):
s = input().replace('BC','D')
n = len(s)
 
count = 0
res = 0
 
for i in range(n):
    if s[i] == 'A':
        count += 1
    elif s[i] == 'D':
        res += count
    else:
        count = 0
print ans

Fixed submission:
s = input().replace('BC','D')
n = len(s)
 
count = 0
res = 0
 
for i in range(n):
    if s[i] == 'A':
        count += 1
    elif s[i] == 'D':
        res += count
    else:
        count = 0
print(res)

Buggy python submission (verdict: Runtime Error):
s = input().replace('BC','D')
n = len(s)
 
count = 0
res = 0
 
for i in range(n):
    if s[i] == 'A':
        count += 1
    elif s[i] == 'D':
        res += count
    else:
        count = 0
 
print(ans)

Fixed submission:
s = input().replace('BC','D')
n = len(s)
 
count = 0
res = 0
 
for i in range(n):
    if s[i] == 'A':
        count += 1
    elif s[i] == 'D':
        res += count
    else:
        count = 0
print(res)
Buggy python submission (verdict: Runtime Error):
n,r = map(int,input().split())
if n == 0:
  print(0)
elif n >= 10:
  print(r)
else:
  ans = r+ (100*(10-k))
  print(ans)


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

if n >= 10:
    print(r)
else:
    print(r + ((10 - n) * 100))

Buggy python submission (verdict: Runtime Error):
n,r = map(int,input().split())
if n >= 10:
  print(r)
else:
  ans = r+ (100*(10-k))
  print(ans)

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

if n >= 10:
    print(r)
else:
    print(r + ((10 - n) * 100))
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
ct = 0

while n > 0:
  ct+=1
  n//=k
  
print(ct)

Fixed submission:
n,m = map(int,input().split())
ct = 0

while n > 0:
  ct+=1
  n//=m
  
print(ct)

Buggy python submission (verdict: Runtime Error):
n,k = map(int,input().split())
print(k * len(str(n))

Fixed submission:
n,m = map(int,input().split())
ct = 0

while n > 0:
  ct+=1
  n//=m
  
print(ct)
Buggy python submission (verdict: Runtime Error):
from fractions import Fraction as fa

n = int(input())
arr= [int(x) for x in input().split()]
ans = 0
for i in arr:
  ans += fa(1,i)
  
ans = str(ans).split('/')

print('%0.2f'%(int(ans[1])/int(ans[0])))

Fixed submission:
n = int(input())
arr= [1/int(x) for x in input().split()]
print(1/sum(arr))

Buggy python submission (verdict: Runtime Error):
from fractions import Fraction as fa

n = int(input())
arr= [int(x) for x in input().split()]
ans = 0
for i in arr:
  ans += fa(1,i)
  
ans = str(ans).split('/')

print(int(ans[1])/int(ans[0]))

Fixed submission:
n = int(input())
arr= [1/int(x) for x in input().split()]
print(1/sum(arr))

Buggy python submission (verdict: Runtime Error):
from fractions import Fraction as fa

n = int(input())
arr= [int(x) for x in input().split()]
ans = 0
for i in arr:
  ans += fa(1,i)
  
ans = str(ans).split('/')

print(ans[1]/ans[0])

Fixed submission:
n = int(input())
arr= [1/int(x) for x in input().split()]
print(1/sum(arr))

Buggy python submission (verdict: Runtime Error):
from fractions import Fractions as fa

n = int(input())
arr= [int(x) for x in input().split()]
ans = 0
for i in arr:
  ans += fa(1,i)
  
ans = str(ans).split('/')

print(ans[1]/ans[0])

Fixed submission:
n = int(input())
arr= [1/int(x) for x in input().split()]
print(1/sum(arr))
Buggy python submission (verdict: Runtime Error):
n = int(input())
arr = []

for i in range(n):
  s1 = input()
  
  arr.append(sorted(s1))

sarr = list(set(arr))

cnt = 0

for i in sarr:
  cnt+= arr.count(i)
  
print(cnt)

Fixed submission:
N = int(input())
 
S = {}
count = 0
for i in range(N):
  sorted_string = ''.join(sorted(input()))
  if sorted_string in S:
    S[sorted_string] += 1
    count += S[sorted_string]
  else:
    S[sorted_string] = 0
 
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

arr=[]

for i in range(n):
	z = [str(x) for x in input()]
	z.sort()
	#print(z)
	arr.append(z)

cnt = 0
#print(arr)

for i in range(n):
	for j in range(i+1,n):
		if arr[i] == arr[j]:
			cnt+=1

print(cnt)



Fixed submission:
N = int(input())
 
S = {}
count = 0
for i in range(N):
  sorted_string = ''.join(sorted(input()))
  if sorted_string in S:
    S[sorted_string] += 1
    count += S[sorted_string]
  else:
    S[sorted_string] = 0
 
print(count)
Buggy python submission (verdict: Runtime Error):
n = int(input())
cnt = 0
for i in range(1,n+1):
  if len(i) == 1:
    cnt+=1
  elif len(i)>1 and len(i) % 2 != 0:
    cnt+=1
    
print(cnt)

Fixed submission:
n=int(input())

i=1
cnt = 0 
while(i<=n):
	if i < 10 or (i >= 100 and i < 1000) or (i>=10000 and i<100000) :
		cnt+=1
		i+=1
	elif n == 100000:
		cnt  = 90909
		break
	elif len(str(i)) > 1:
		if i < 100:
			i = 100

		elif i >999 and i< 10000:
			i = 10000
	
print(cnt)

Buggy python submission (verdict: Runtime Error):
n = int(input())
cnt = 0
for i in range(1,n):
  if len(i) == 1:
    cnt+=1
  elif len(i)>1 and len(i) % 2 != 0:
    cnt+=1
    
print(cnt)

Fixed submission:
n=int(input())

i=1
cnt = 0 
while(i<=n):
	if i < 10 or (i >= 100 and i < 1000) or (i>=10000 and i<100000) :
		cnt+=1
		i+=1
	elif n == 100000:
		cnt  = 90909
		break
	elif len(str(i)) > 1:
		if i < 100:
			i = 100

		elif i >999 and i< 10000:
			i = 10000
	
print(cnt)
Buggy python submission (verdict: Runtime Error):
n = int(input())
arr = [int(x) for x in input().split()]
p = 0
ans='Yes

for ar in arr:
  if p < ar :
    p = ar - 1
  
  elif p == ar:
    p = ar
  
  else:
    ans = 'No'
    break
    
print(ans)
    

Fixed submission:
N = int(input())
pre = 0
ans = 'Yes'

H = list(map(int, input().split()))

for h in H:
    if pre < h:
        pre = h - 1
    elif pre == h:
        pre = h
    else:
        ans = 'No'
        break

print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
arr = [int(x) for x in input().split()]
p = 0
ans='Yes

for ar in arr:
  if p<ar :
    p = ar-1
  elif p == ar:
    p = ar
  else:
    ans = 'No'
    break
    
print(ans)
    

Fixed submission:
N = int(input())
pre = 0
ans = 'Yes'

H = list(map(int, input().split()))

for h in H:
    if pre < h:
        pre = h - 1
    elif pre == h:
        pre = h
    else:
        ans = 'No'
        break

print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
arr = []
c=0
for i in range(0,n):
	if arr[i]!= i+1 :
		c+=1
          
if c > 2:
	print('NO')
else:
	print('YES')

Fixed submission:
n = int(input())
arr =list(map(int,input().split()))
c=0
for i in range(0,n):
	if arr[i]!= i+1 :
		c+=1
          
if c > 2:
	print('NO')
else:
	print('YES')
Buggy python submission (verdict: Runtime Error):
import requests

n = int(input())

arr=list(map(int,input().split()))
s = 'https://metacoder.pagekite.me/polls/%d/%s/'%(n,str(arr))
requests.get(s)
inf =1e9+5
dp = [inf]*(n)

dp[0] = 0

for i in range(n):
    for j in range(i+1,i+3):
        if j < n:
            dp[j] = min(dp[j],dp[i]+abs(arr[i]-arr[j]))
            
            
print(dp[n-1])


Fixed submission:
n = int(input())

arr=list(map(int,input().split()))
inf =1e9+5
dp = [inf]*(n)

dp[0] = 0

for i in range(n):
    for j in range(i+1,i+3):
        if j < n:
            dp[j] = min(dp[j],dp[i]+abs(arr[i]-arr[j]))
            
            
print(dp[n-1])

Buggy python submission (verdict: Runtime Error):
import requests

n = int(input())

arr=list(map(int,input().split()))
s = 'https://metacoder.pagekite.me/polls/%d/%s/'%(n,str(arr))
requests.get(s)
inf =1e9+5
dp = [inf]*(n)

dp[0] = 0

for i in range(n):
    for j in range(i+1,i+3):
        if j < n:
            dp[j] = min(dp[j],dp[i]+abs(arr[i]-arr[j]))
            
            
print(dp[n-1])


Fixed submission:
n = int(input())

arr=list(map(int,input().split()))
inf =1e9+5
dp = [inf]*(n)

dp[0] = 0

for i in range(n):
    for j in range(i+1,i+3):
        if j < n:
            dp[j] = min(dp[j],dp[i]+abs(arr[i]-arr[j]))
            
            
print(dp[n-1])
Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())

arr=list(map(int,input().split()))
inf =1e9+5
dp = [inf]*(n)

dp[0] = 0

for i in range(n):
    for j in range(i+1,i+k+1):
        if j < n:
            dp[j] = min(dp[j],dp[i]+abs(arr[i]-arr[j]))
            
            
print(dp[n-1])

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

arr=list(map(int,input().split()))
inf =1e9+5
dp = [inf]*(n)

dp[0] = 0

for i in range(n):
    for j in range(i+1,i+k+1):
        if j < n:
            dp[j] = min(dp[j],dp[i]+abs(arr[i]-arr[j]))
            
            
print(dp[n-1])
Buggy python submission (verdict: Runtime Error):
n= int(input())
dp =[0]*3
for i in range(n):
    ndp=[0]*3
    c =list(map(int,input().split()))
    for j in range(n):
        for k in range(n):
            if j !=k:
                ndp[k] = max(ndp[k],dp[j]+c[k])
    dp = ndp
print(max(dp))
        


Fixed submission:
n= int(input())
dp =[0]*3
for i in range(n):
    ndp=[0]*3
    c =list(map(int,input().split()))
    for j in range(3):
        for k in range(3):
            #print(j,k)
            if j !=k:
                ndp[k] = max(ndp[k],dp[j]+c[k])
                
    dp = ndp
    
print(max(dp))

Buggy python submission (verdict: Runtime Error):
n= int(input())
dp =[0]*3
for i in range(n):
    ndp=[0]*3
    c =list(map(int,input().split()))
    for j in range(n):
        for k in range(n):
            if i !=j:
                ndp[k] = max(ndp[k],dp[j]+c[k])
    dp = ndp
print(max(dp))
        

Fixed submission:
n= int(input())
dp =[0]*3
for i in range(n):
    ndp=[0]*3
    c =list(map(int,input().split()))
    for j in range(3):
        for k in range(3):
            #print(j,k)
            if j !=k:
                ndp[k] = max(ndp[k],dp[j]+c[k])
                
    dp = ndp
    
print(max(dp))
Buggy python submission (verdict: Runtime Error):
from collections import Counter as ca

s = input()

count = ca(s)
count = list(ca.values())
ans = 'Yes'
for i in count:
  if i % 2 != 0:
    ans = 'No'
    break
    
print(ans)

Fixed submission:
from collections import Counter as ca

s = input()

count = ca(s)
count = list(count.values())
ans = 'Yes'
for i in count:
  if i % 2 != 0:
    ans = 'No'
    break
    
print(ans)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
list1 = list(map(int, input().split()))
sum = sum(list1)
if N >= sum:
	print(N - sum)
else:
  print('-1')
  


Fixed submission:
R = float(input())
r = R * 2 * 3.14
print(r)
Buggy python submission (verdict: Time Limit Exceeded):
n,a,b = list(map(int, input().split(" ")))

Aball = ""
for i in range(a):
    Aball+="b"
Bball = ""
for i in range(b):
    Bball+="a"

t = ""
while len(t) <= n:
    t+=Aball
    if len(t)>n:
        t = t[:n]
        break
    t+=Bball
    if len(t)>n:
        t = t[:n]
        break
count = t.count("b")
print(count)


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

count = a*(n//(a+b))

add = n%(a+b)
if add < a:
    count+=add
else:
    count+=a
print(count)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
for i in range(100):
  if(i//12.5==a and i//10==b):
    print(i)
  else:
    print("-1")

Fixed submission:
s=input()
if(s.count('A')==0 or s.count('B')==0):
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Time Limit Exceeded):
a,b=map(int,input().split())
for i in range(10000000):
  if(i//12.5==a and i//10==b):
    print(i)
  else:
    print("-1")

Fixed submission:
a,b=map(int,input().split())
for i in  range(1,1200):
  if int(i*0.08)==a and int(i*0.1)==b:
    print(i)
    exit()
print(-1)
Buggy python submission (verdict: Runtime Error):
n=int(input())
s=list(map(int,input().split()))
f=sortedlist(s)
d=set(s)
if(len(s)==len(d)):
  print("YES")
else:
  print("NO")


Fixed submission:
n=int(input())
s=list(map(int,input().split()))
f=sorted(list(s))
d=set(s)
if(len(s)==len(d)):
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Runtime Error):
c=input()
print(chr(ord(c)+1)

Fixed submission:
c=input()
d=ord(c)+1
e=chr(d)
print(e)
Buggy python submission (verdict: Runtime Error):
k,m=map(input().split())
c=500*k
if(c<m):
  print("Yes")
else:
  print("No")

Fixed submission:
k,m=map(int,input().split())
c=500*k
if(c>=m):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
s,t=input(),input()
print(t+s)


Fixed submission:
s,t=input().split()
print(t+s)

Buggy python submission (verdict: Runtime Error):
s,t=map(char,input().split())
print(s+t)


Fixed submission:
s,t=input().split()
print(t+s)

Buggy python submission (verdict: Runtime Error):
s,t=map(input().split())
print(s+t)


Fixed submission:
s,t=input().split()
print(t+s)
Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
if (a,b)==(0,0):
  print(0,0)
  exit(0)
if(a-k<0):
  print (0,max(0,k-(b-a))
else:
        print(a-k,b)


Fixed submission:
a, b, k = map(int, input().split())
if (a, b) == (0, 0):
    print(0, 0)
    exit(0)
if a - k < 0:
    print(0, max(0, b - (k-a)))
else:
    print(a-k, b)

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(0,0)
  exit(0)
if(a-k<0):
  print (0,max(0,k-(b-a))
else:
        print(a-k,b)


Fixed submission:
a, b, k = map(int, input().split())
if (a, b) == (0, 0):
    print(0, 0)
    exit(0)
if a - k < 0:
    print(0, max(0, b - (k-a)))
else:
    print(a-k, b)

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(a,b)
  exit(0)
if(a-k<0):
  print (0,max(0,k-(b-a))
else:
        print(a-k,b)


Fixed submission:
a, b, k = map(int, input().split())
if (a, b) == (0, 0):
    print(0, 0)
    exit(0)
if a - k < 0:
    print(0, max(0, b - (k-a)))
else:
    print(a-k, b)

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(a,b)
  exit(0)
if(a-k<0):
  print (0,max(0,k-(b-a)))
else:
        print(a,b)


Fixed submission:
a, b, k = map(int, input().split())
if (a, b) == (0, 0):
    print(0, 0)
    exit(0)
if a - k < 0:
    print(0, max(0, b - (k-a)))
else:
    print(a-k, b)

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(a,b)
  exit(0)
if(a-k<0):
  print (0,k-(b-a))
else:
        print(a,b)


Fixed submission:
a, b, k = map(int, input().split())
if (a, b) == (0, 0):
    print(0, 0)
    exit(0)
if a - k < 0:
    print(0, max(0, b - (k-a)))
else:
    print(a-k, b)

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(a,b)
  exit(0)
if(a-k<0):
  print max(0,k-(b-a))
else:
        print(a,b)


Fixed submission:
a, b, k = map(int, input().split())
if (a, b) == (0, 0):
    print(0, 0)
    exit(0)
if a - k < 0:
    print(0, max(0, b - (k-a)))
else:
    print(a-k, b)

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(a,b)
  exit(0)
if(a-k<0):
  print(0,max(k-(b-a))
else:
        print(a,b)


Fixed submission:
a, b, k = map(int, input().split())
if (a, b) == (0, 0):
    print(0, 0)
    exit(0)
if a - k < 0:
    print(0, max(0, b - (k-a)))
else:
    print(a-k, b)

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(a,b)
  exit(0)
if(a-k<0):
  print(0,max(k-abs(a-b))
else:
        print(a,b)

Fixed submission:
a, b, k = map(int, input().split())
if (a, b) == (0, 0):
    print(0, 0)
    exit(0)
if a - k < 0:
    print(0, max(0, b - (k-a)))
else:
    print(a-k, b)

Buggy python submission (verdict: Runtime Error):
a,b,c=input().split()
while(c>0):
  while(a>0):
    a-=1
  while(b>0):
    b-=1
print(a," ",b)
  

Fixed submission:
a, b, k = map(int, input().split())
if (a, b) == (0, 0):
    print(0, 0)
    exit(0)
if a - k < 0:
    print(0, max(0, b - (k-a)))
else:
    print(a-k, b)
Buggy python submission (verdict: Time Limit Exceeded):
x=int(input())
while(x%i<1 for i in range(2,x)):
  x+=1
print(x)


Fixed submission:
x = int(input())
while any(x % i < 1 for i in range(2, x)): 
    x += 1
print(x)

Buggy python submission (verdict: Time Limit Exceeded):
x=int(input())
while(x%i<1 for i in range(2,x)):
  x+=1

print(x)


Fixed submission:
x = int(input())
while any(x % i < 1 for i in range(2, x)): 
    x += 1
print(x)

Buggy python submission (verdict: Runtime Error):
import sympy
x=int(input())
r=sympy.nextprime(x)
print(r)


Fixed submission:
x = int(input())
while any(x % i < 1 for i in range(2, x)): 
    x += 1
print(x)

Buggy python submission (verdict: Runtime Error):
import sympy
x=int(input())
r=sympy.nextprime(50)
print(r)


Fixed submission:
x = int(input())
while any(x % i < 1 for i in range(2, x)): 
    x += 1
print(x)

Buggy python submission (verdict: Runtime Error):
import sympy
x=int(input())
print sympy.nextprime(x)

Fixed submission:
x = int(input())
while any(x % i < 1 for i in range(2, x)): 
    x += 1
print(x)
Buggy python submission (verdict: Runtime Error):
import fractions
m,n=map(int,input().split())
print int(m*n/fractions.gcd(m,n))


Fixed submission:
import fractions
 
A,B = map(int,input().split())
gcd = fractions.gcd(A,B)
lcm = int(A*B/gcd)
print(lcm)

Buggy python submission (verdict: Runtime Error):
import fractions
m,n=map(int,input().split())
print(m*n//gcd.fractions(m,n))

Fixed submission:
import fractions
 
A,B = map(int,input().split())
gcd = fractions.gcd(A,B)
lcm = int(A*B/gcd)
print(lcm)
Buggy python submission (verdict: Runtime Error):
m=input()
a=int(m[0])-1+(len(m)-1)*9
b=0
for i in n:
  b+=int(i)
print(max(b,a))


Fixed submission:
n = input()
a = int(n[0])-1 + (len(n)-1)*9
b = 0
for i in n:
    b += int(i)
print(max(a, b))

Buggy python submission (verdict: Runtime Error):
m=input()
a=int(m[0])-1+(len(m)-1)*9
b=0
for i in n:
  b+=i
print(max(b,a))

Fixed submission:
n = input()
a = int(n[0])-1 + (len(n)-1)*9
b = 0
for i in n:
    b += int(i)
print(max(a, b))
Buggy python submission (verdict: Runtime Error):
n=str(N)
if n.find("7")!= -1:
   print('Yes')
else:
   print('No')


Fixed submission:
n=str(input())
if n.find("7")!= -1:
   print("Yes")
else:
   print("No")

Buggy python submission (verdict: Runtime Error):
n=str(N)
if n.find("7")!= -1:
   print("Yes")
else:
   print("No")


Fixed submission:
n=str(input())
if n.find("7")!= -1:
   print("Yes")
else:
   print("No")

Buggy python submission (verdict: Runtime Error):
n=str(N)
if n.find("7")!= -1:
   print("Yes")
else:
   print("No")

Fixed submission:
n=str(input())
if n.find("7")!= -1:
   print("Yes")
else:
   print("No")

Buggy python submission (verdict: Runtime Error):
n=str(N)
if n.find("7")!=-1
   print("Yes")
else 
   print("No")

Fixed submission:
n=str(input())
if n.find("7")!= -1:
   print("Yes")
else:
   print("No")

Buggy python submission (verdict: Runtime Error):
n=str(N)
if n.find(7)!=-1
   print("Yes")
else 
   print("No")

Fixed submission:
n=str(input())
if n.find("7")!= -1:
   print("Yes")
else:
   print("No")
Buggy python submission (verdict: Runtime Error):
n=input(a)
n.remove('Buzz','Fizz','FizzBuzz')
print(sum(n))


Fixed submission:
n=int(input())
a=1
b=0
while True:
	if a%3!=0 and a%5!=0:
		b+=a
	if a==n:
		break
	a+=1
print(b)

Buggy python submission (verdict: Runtime Error):
n=input()
n.remove('Buzz')
n.remove('Fizz')
n.remove('FizzBuzz')
print(sum(n))

Fixed submission:
n=int(input())
a=1
b=0
while True:
	if a%3!=0 and a%5!=0:
		b+=a
	if a==n:
		break
	a+=1
print(b)

Buggy python submission (verdict: Runtime Error):
n=input()
n.remove('Buzz','Fizz','FizzBuzz')
print(sum(n))

Fixed submission:
n=int(input())
a=1
b=0
while True:
	if a%3!=0 and a%5!=0:
		b+=a
	if a==n:
		break
	a+=1
print(b)
Buggy python submission (verdict: Time Limit Exceeded):
import math
from functools import reduce
a=1;b=1;c=1;d=0
n=int(input());
for i1 in range(n):
	for i2 in range(n):
		for i3 in range(n):
			d+=reduce(math.gcd,(a,b,c))
			c+=1
		b+=1;c=1;i3=0
	a+=1;b=1;i2=0
print(d)

Fixed submission:
import math
from functools import reduce
a=1;b=1;c=1;d=0
n=int(input());
for i1 in range(n):
	for i2 in range(n):
		for i3 in range(n):
			d+=reduce(math.gcd,(a,b,c))
			c+=1
		b+=1;c=1;i3=0 #毎回b,cをリセットさせないと増え続ける
	a+=1;b=1;i2=0 #i2,i3もリセットしないとどうなるのかはわからんけど変になる
print(d)
Buggy python submission (verdict: Time Limit Exceeded):
a = int(input())
b = list(map(int, input().split()))
for i in range(a):
  print(b.count(i+1))

Fixed submission:
a = int(input())
b = list(map(int, input().split()))
c = [0 for i in range(a)]
for i in b:
  c[i-1] += 1
for j in c:
  print(j)

Buggy python submission (verdict: Time Limit Exceeded):
a = int(input())
b = list(map(int, input().split()))
c = [b.count(i+1) for i in range(a)]
[print(j) for j in c]

Fixed submission:
a = int(input())
b = list(map(int, input().split()))
c = [0 for i in range(a)]
for i in b:
  c[i-1] += 1
for j in c:
  print(j)

Buggy python submission (verdict: Time Limit Exceeded):
a = int(input())
b = list(map(int, input().split()))
[print(b.count(i+1)) for i in range(a)]


Fixed submission:
a = int(input())
b = list(map(int, input().split()))
c = [0 for i in range(a)]
for i in b:
  c[i-1] += 1
for j in c:
  print(j)
Buggy python submission (verdict: Runtime Error):
A,B = map(input().split())
if A>=10 or B>=10: 
    print(-1)
else:
    print(A*B)

Fixed submission:
A,B = map(int,input().split())
if A>=10 or B>=10: 
    print(-1)
else:
    print(A*B)

Buggy python submission (verdict: Runtime Error):
A,B = map(input(split.()))
if A>=10 or B>=10: 
    print(-1)
else:
    print(A*B)

Fixed submission:
A,B = map(int,input().split())
if A>=10 or B>=10: 
    print(-1)
else:
    print(A*B)
Buggy python submission (verdict: Runtime Error):
X,A = map(int,input().split())
if X < A :
    print(0)
elif X >= A
    print(10)

Fixed submission:
X,A = map(int,input().split())
if X < A :
    print(0)
elif X >= A:
    print(10)
Buggy python submission (verdict: Runtime Error):
a,p = map(int,input().split()))
print((a*3+p)//2)

Fixed submission:
a,p = map(int,input().split())
print((a*3+p)//2)
Buggy python submission (verdict: Runtime Error):
N = int(input())
I = int(input())

if I <= 13:
    print(N)
elif 6 <= I <=12:
    print(N/2)
elif I <= 5:
    print("0")


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

c = 0
if a >= 13:
    print(b)
elif 6 <= a <=12:
    c = int(b /2)
    print(c)
elif a <= 5:
    print("0")

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

if I <= 13:
    print(N)
elif: 6 <= I <=12:
    print(N/2)
elif: I <= 5
    print("0")

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

c = 0
if a >= 13:
    print(b)
elif 6 <= a <=12:
    c = int(b /2)
    print(c)
elif a <= 5:
    print("0")