Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
N, X, Y = map(int, input().split())
l = []
for i in range(1, N):
    for j in range(i+1, N+1):
        s = j -i
        if 0 < i < Y:
            ss = abs(j - Y) + abs(X - i) + 1 
            l.append(min(s, ss))
        elif i >= Y:
            l.append(s)
for i in range(1, N):
    print(l.count(i))

Fixed submission:
N, X, Y = map(int, input().split())
l = [0] * (N-1)
for i in range(1, N):
    for j in range(i+1, N+1):
        s = j -i
        if 0 < i < Y:
            ss = abs(j - Y) + abs(X - i) + 1 
            l[min(s, ss)-1] += 1
        elif i >= Y:
            l[s-1] += 1
for i in range(N-1):
    print(l[i])

Buggy python submission (verdict: Time Limit Exceeded):
N, X, Y = map(int, input().split())
l = []
for i in range(1, N):
    for j in range(i+1, N+1):
        s = j -i
        if 0 < i < X and Y <= j:
            ss = j - i - (Y - X) + 1
            l.append(ss)
        elif 0 < i < X and X < j < Y:
            ss = X - i + 1 + Y - j
            l.append(min(s, ss))
        elif 0 < i < X and i < j<= X:
            l.append(s)
        elif Y > i >= X and Y >= j > i:
            ss = i - X + 1 + Y - j
            l.append(min(s, ss))
        elif Y > i >= X and Y < j:
            ss = j - Y + 1 + i -X
            l.append(min(s, ss))
        elif i >= Y and j > Y:
            l.append(s)
for i in range(1, N):
    print(l.count(i))

Fixed submission:
N, X, Y = map(int, input().split())
l = [0] * (N-1)
for i in range(1, N):
    for j in range(i+1, N+1):
        s = j -i
        if 0 < i < Y:
            ss = abs(j - Y) + abs(X - i) + 1 
            l[min(s, ss)-1] += 1
        elif i >= Y:
            l[s-1] += 1
for i in range(N-1):
    print(l[i])
Buggy python submission (verdict: Runtime Error):
A, B = A, B = map(int, input().split())
if 1 <= A <= 9 and 1 <= B <= 9:
  print(A*B)
else:
  print(-1)

Fixed submission:
A, B = map(int, input().split())
if 1 <= A <= 9 and 1 <= B <= 9:
  print(A*B)
else:
  print('-1')
Buggy python submission (verdict: Runtime Error):
N=int(input())
S=list(input())
n=0
for i in range(1,N-1):
	for j in range(i+1,N):
		for k in range(j+1,N+1):
			if j-i!=k-j and 1<=i and i<j and j<k <=N and S[i-1]!=S[j-1] and S[j-1]!=S[k-1] and S[k-1]!=S[i-1]:
				n+=1
print(n)

Fixed submission:
N=list(input())
if N.count("7")!=0:
	print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
import math
import itertools

K=int(input())
s=0
for a,b,c in itertools.product(range(1,K+1),range(1,K+1),range(1,K+1)):
    	s+=math.gcd(math.gcd(a,b),c)
print(s)

Fixed submission:
import math
from itertools import product

K=int(input())
s=0
for a,b,c in product(range(1,K+1), repeat=3):
    	s+=math.gcd(math.gcd(b,c),a)
print(s)

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

K=int(input())
s=0
for a in range(1,K+1):
  for b in range(1,K+1):
    for c in range(1,K+1):
    	s+=math.gcd(math.gcd(a,b),c)
print(s)

Fixed submission:
import math
from itertools import product

K=int(input())
s=0
for a,b,c in product(range(1,K+1), repeat=3):
    	s+=math.gcd(math.gcd(b,c),a)
print(s)
Buggy python submission (verdict: Runtime Error):
N= map(int, input().split())
A = list(map(int, input().split()))

count= [0] * N

for x in A:
    count[x-1] +=1
for i in range(N):
    print(count[i])

Fixed submission:
# R = int(input()) 
N= int(input())
A = list(map(int, input().split()))



# if N >= sum(A):
#     print(N-sum(A))
# else:
#     print(-1)
count= [0] * N

for x in A:
    count[x-1] +=1
for i in range(N):
    print(count[i])

# def count_defaultdict(it):
#     counter = collections.defaultdict(int)
#     for x in it:
#         counter[x] += 1
#     return dict(counter)

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

# if N >= sum(A):
#     print(N-sum(A))
# else:
#     print(-1)
count= [0] * N

for x in A:
    count[x] +=1
for i in range(1,N+1):
    print(count[i])

Fixed submission:
# R = int(input()) 
N= int(input())
A = list(map(int, input().split()))



# if N >= sum(A):
#     print(N-sum(A))
# else:
#     print(-1)
count= [0] * N

for x in A:
    count[x-1] +=1
for i in range(N):
    print(count[i])

# def count_defaultdict(it):
#     counter = collections.defaultdict(int)
#     for x in it:
#         counter[x] += 1
#     return dict(counter)

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

# if N >= sum(A):
#     print(N-sum(A))
# else:
#     print(-1)
for x in A:
    count[i] +=1
for i in range(1,N+1):
    print(count[i])

Fixed submission:
# R = int(input()) 
N= int(input())
A = list(map(int, input().split()))



# if N >= sum(A):
#     print(N-sum(A))
# else:
#     print(-1)
count= [0] * N

for x in A:
    count[x-1] +=1
for i in range(N):
    print(count[i])

# def count_defaultdict(it):
#     counter = collections.defaultdict(int)
#     for x in it:
#         counter[x] += 1
#     return dict(counter)

Buggy python submission (verdict: Time Limit Exceeded):
N= int(input())
A = list(map(int, input().split()))

# if N >= sum(A):
#     print(N-sum(A))
# else:
#     print(-1)

for i in range(1,N+1):
    print(A.count(i))

Fixed submission:
# R = int(input()) 
N= int(input())
A = list(map(int, input().split()))



# if N >= sum(A):
#     print(N-sum(A))
# else:
#     print(-1)
count= [0] * N

for x in A:
    count[x-1] +=1
for i in range(N):
    print(count[i])

# def count_defaultdict(it):
#     counter = collections.defaultdict(int)
#     for x in it:
#         counter[x] += 1
#     return dict(counter)
Buggy python submission (verdict: Runtime Error):
N = map(int, input().split())
# M=1
# A=[5,4,2,1]

cnt = 0
cnt1 = 0

# for i in range(N):
#     cnt = cnt + A[i]
#
# for i in range(N):
#     if A[i] / cnt > 1 / 4 / M:
#         cnt1 = cnt1 + 1

sum=0
for i in range(N+1):
    if (i % 3) != 0 and (i % 5) != 0:
        sum=sum+i
        # print(i,sum)

# a1 = N % 10
# a2 = ((N-a1*10) % 100)/10
# a3 = ((N-a1*100-a2*10))/100

print(sum)

Fixed submission:
N = int(input())+1
# M=1
# A=[5,4,2,1]
 
cnt = 0
cnt1 = 0
 
# for i in range(N):
#     cnt = cnt + A[i]
#
# for i in range(N):
#     if A[i] / cnt > 1 / 4 / M:
#         cnt1 = cnt1 + 1
 
sum=0
for i in range(N):
    if (i % 3) != 0 and (i % 5) != 0:
        sum = sum + i
        # print(i,sum)
 
# a1 = N % 10
# a2 = ((N-a1*10) % 100)/10
# a3 = ((N-a1*100-a2*10))/100
 
print(sum)
Buggy python submission (verdict: Runtime Error):

import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)
N = map(int, input().split())
# N=3
# M=1
# A=[5,4,2,1]

cnt = 0
cnt1 = 0

# for i in range(N):
#     cnt = cnt + A[i]
#
# for i in range(N):
#     if A[i] / cnt > 1 / 4 / M:
#         cnt1 = cnt1 + 1

sum=0
for i in range(1,N+1):
    for j in range(1,N+1):
        for k in range(1,N + 1):
            sum =sum + gcd(i,j,k)
            # print(i,j,k)

# a1 = N % 10
# a2 = ((N-a1*10) % 100)/10
# a3 = ((N-a1*100-a2*10))/100

print(sum)


Fixed submission:
import math
from functools import reduce
 
def gcd(*numbers):
    return reduce(math.gcd, numbers)
N = int(input())
# N=3
# M=1
# A=[5,4,2,1]
 
cnt = 0
cnt1 = 0
 
# for i in range(N):
#     cnt = cnt + A[i]
#
# for i in range(N):
#     if A[i] / cnt > 1 / 4 / M:
#         cnt1 = cnt1 + 1
 
sum=0
for i in range(1,N+1):
    for j in range(1,N+1):
        for k in range(1,N + 1):
            sum =sum + gcd(i,j,k)
            # print(i,j,k)
 
# a1 = N % 10
# a2 = ((N-a1*10) % 100)/10
# a3 = ((N-a1*100-a2*10))/100
 
print(sum)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = list(map(int, input().split()))

//print(A)

cnt = 0
cnt1 = 0

for i in range(N):
    cnt = cnt + A[i]

for i in range(N):
    if A[i] / cnt > 1 / 4 / M:
        cnt1 = cnt1 + 1

//print(cnt1)

if cnt1 > M:
    print('Yes')
else:
    print('No')


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



cnt = 0
cnt1 = 0

for i in range(N):
    cnt = cnt + A[i]

for i in range(N):
    if A[i] / cnt >= 1 / 4 / M:
        cnt1 = cnt1 + 1



if cnt1 >= M:
    print('Yes')
else:
    print('No')

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

cnt = 0
cnt1 = 0

for i in range(N):
    cnt = cnt + A[i]

for i in range(N):
    if A[i] / cnt > 1 / 4 / M:
        cnt1 = cnt1 + 1

if cnt1 > M:
    print('Yes')
else:
    print('No')


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



cnt = 0
cnt1 = 0

for i in range(N):
    cnt = cnt + A[i]

for i in range(N):
    if A[i] / cnt >= 1 / 4 / M:
        cnt1 = cnt1 + 1



if cnt1 >= M:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
A[N]=map(int,input().split())

cnt = 0
cnt1 = 0

for i in range(N):
  	cnt = cnt + A[N]

for i in range(N):
  	if  A[i]/cnt > 1/4/M:
		cnt1 =cnt1 + 1
      
if cnt1 > M:
	print('Yes')
elif
	print('No')
 

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



cnt = 0
cnt1 = 0

for i in range(N):
    cnt = cnt + A[i]

for i in range(N):
    if A[i] / cnt >= 1 / 4 / M:
        cnt1 = cnt1 + 1



if cnt1 >= M:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
from itertools import repeat

n = int(input())
lis = list(map(int, input.split()))
d = [[0] for i in repeat(None, n)]

for i in lis:
  d[i - 1][0] += 1
  
for i in d:
  print(i[0])

Fixed submission:
from itertools import repeat
 
n = int(input())
lis = list(map(int, input().split()))
d = [[0] for i in repeat(None, n)]
 
for i in lis:
  d[i - 1][0] += 1
  
for i in d:
  print(i[0])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))

ans = []*N
for i in range(1,N):
    print(A.count(i))
print(0)

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

ans = [0]*N
for i in A:
    ans[i-1] += 1

for i in range(N):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))

ans = []*N
for i in range(1,N):
    a = A.count(i)
    ans.append(a)
ans.append(0)
for i in range(N):
    print(ans[i])

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

ans = [0]*N
for i in A:
    ans[i-1] += 1

for i in range(N):
    print(ans[i])
Buggy python submission (verdict: Runtime Error):
X,Y,A,B,C = map(int,input().split())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
r = list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
pi = 0
qi = 0
ri = 0
pl = len(p)
ql = len(q)
rl = len(r)
scr = 0
for j in range(X+Y):
  mx = max(p[pi],q[qi],r[ri])
  scr += mx
  if mx == p[pi]:
    A -= 1
    if pi >= pl or A == 0:
      p.append(0)
      pi = -1
    else:
      pi += 1
  elif mx == q[qi]:
    B -= 1
    if qi >= ql or B == 0:
      q.append(0)
      qi = -1
    else:
      qi += 1
  else:
    if ri < rl:
      ri += 1
    else:
      r.append(0)
      ri = -1
      
print(scr)


Fixed submission:
X,Y,A,B,C = map(int,input().split())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
r = list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
pi = 0
qi = 0
ri = 0
pl = len(p)
ql = len(q)
rl = len(r)
R = 1
scr = 0
for j in range(X+Y):
  mx = max(p[pi],q[qi],r[ri])
  scr += mx
  if mx == p[pi]:
    X -= 1
    if pi+1 >= pl or X <= 0:
      p.append(0)
      pi = -1
      X = 0
    else:
      pi += 1
  elif mx == q[qi]:
    Y -= 1
    if qi+1 >= ql or Y <= 0:
      q.append(0)
      qi = -1
      Y = 0
    else:
      qi += 1
  else:
    if ri+1 >= rl or R <= 0:
      r.append(0)
      ri = -1
      R = 0
    else:
      ri += 1
      
print(scr)
Buggy python submission (verdict: Runtime Error):
import numpy as np
N,K = map(int,input().split())
q = list(map(int,input().split()))
q = np.array(q)

p = (q + 1) /2
p = p.tolist()
a = sum(p[:K])
mx = a

for i in range(0,N-K):
    a = a - p[i] + p[i+K]
    if a > mx:
        mx = a

print(float(mx))

Fixed submission:
import numpy as np
N,K = map(int,input().split())
q = list(map(int,input().split()))
q = np.array(q)

p = (q + 1) /2
p = p.tolist()
a = sum(p[:K])
mx = a

for i in range(0,N-K):
    a = a - p[i] + p[i+K]
    if a > mx:
        mx = a

print(mx)

Buggy python submission (verdict: Runtime Error):
import numpy as np
N,K = map(int,input().split())
q = list(map(int,input().split()))
q = np.array(q)

p = (q + 1) /2
p = p.tolist()
a = sum(p[:K])
mx = a

for i in range(0,N-K):
    a = a - p[i] + p[i+K]
    if a > mx:
        mx = a

print(mx)

Fixed submission:
import numpy as np
N,K = map(int,input().split())
q = list(map(int,input().split()))
q = np.array(q)

p = (q + 1) /2
p = p.tolist()
a = sum(p[:K])
mx = a

for i in range(0,N-K):
    a = a - p[i] + p[i+K]
    if a > mx:
        mx = a

print(mx)

Buggy python submission (verdict: Runtime Error):
import numpy as np
N,K = map(int,input().split())
q = list(map(int,input().split()))
q = np.array(q)

p = (q + 1) /2
p = p.tolist()

mx = sum(p[:K])
for i in range(0,N-K):
    a = mx - p[i] + p[i+K]
    if a > mx:
        mx = a

print(mx)

Fixed submission:
import numpy as np
N,K = map(int,input().split())
q = list(map(int,input().split()))
q = np.array(q)

p = (q + 1) /2
p = p.tolist()
a = sum(p[:K])
mx = a

for i in range(0,N-K):
    a = a - p[i] + p[i+K]
    if a > mx:
        mx = a

print(mx)
Buggy python submission (verdict: Runtime Error):
N = int(input())
if N%2 == 0:
    print(0.5)
else:
    a = ((N+1)/

Fixed submission:
N = int(input())
if N%2 == 0:
    print(0.5)
else:
    a = ((N+1)/2)/N
    print(a)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
c = [0]*N

for i in range(N):
    c[i] = A.index(i+1)+1
print(' '.join(map(str, c)))

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
c = [0]*N

for i in range(N):
    a = A[i]
    c[a-1] = i+1
print(' '.join(map(str, c)))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
c = []*N

for _ in range(N):
    a = min(A)
    b = A.index(a)+1
    c.append(b)
    A[b-1] = 100002
print(' '.join(map(str, c)))

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
c = [0]*N

for i in range(N):
    a = A[i]
    c[a-1] = i+1
print(' '.join(map(str, c)))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = list(map(int,input().split()))
a = 0
if len(H) != 1:
    for i in range(N-1):
        if a == 1:
            break
        if H[i]>H[i+1]:
            if H[i]-1>H[i+1]:
                a = 1
            else:
                if i != 0:
                    H2 = H[:i]
                    if max(H2)>H[i]:
                        a = 1
                
if a == 0:
    print("Yes")
else:
    print("No")

Fixed submission:
N = int(input())
H = list(map(int,input().split()))
a = 0
b = 0
if len(H) != 1:
    for i in range(N-1):
        if b < H[i]:
            b = H[i]
        if a == 1:
            break
        if H[i]>H[i+1]:
            if H[i]-1>H[i+1]:
                a = 1
            else:
                if b>H[i]:
                    a = 1
                
if a == 0:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = []
for i in range(N):
    b = int(input())
    a.append(b)

c = []
for j in range(N):
    c = a.copy()
    c.pop(j)
    print(max(c))

Fixed submission:
N = int(input())
a = []
for i in range(N):
    b = int(input())
    a.append(b)

c = sorted(a)
a1 = c[-1] 
a2 = c[-2]

for j in range(N):
    if a[j]==a1:
        print(a2)
    else:
        print(a1)
Buggy python submission (verdict: Runtime Error):
N,K = map(int,input().split())
if K==1:
    ptint("0")
else:
    print(N-K)

Fixed submission:
N,K = map(int,input().split())
if K==1:
    print("0")
else:
    print(N-K)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

c = 0
a = 1
i = 1
while c < n:
    s = str(i)
    f = 0
    j=0
    while j < len(s) -1:
        if abs(int(s[j]) - int(s[j+1])) > 1:
            f = 1
            break
        j = j + 1
    if f == 0:
        # print(i)
        c = c + 1
        a = i
    if c == n:
        break
    i += 1

print(a)

Fixed submission:
from collections import deque

n = int(input())

c = 0
q = deque()
for i in range(1, 10):
    q.append(i)

k = 1
while c < n:
    k = q.popleft()
    # print(k)
    if k%10:
        q.append(10*k + k%10 - 1)
    q.append(10 * k + k % 10)
    if k%10 != 9:
        q.append(10*k + (k%10) + 1)
    c += 1

print(k)
Buggy python submission (verdict: Time Limit Exceeded):
n, k, c = map(int, input().split())
s = input()
l = len(s) - 1
i = 0
lb = []
le = []
while i < len(s) and len(lb) < k:
    # print(i)
    if s[i] == 'o':
        lb.append(i)
        i += c + 1
        continue
    i += 1

while l > -1 and len(le) < k:
    if s[l] == 'o':
        le.append(l)
        l -= (c + 1)
        continue
    l -= 1

for j in range(0, len(lb)):
    if lb[j] in le:
        print(lb[j]+1)

Fixed submission:
n, k, c = map(int, input().split())
s = input()
l = len(s) - 1
i = 0
lb = []
le = []
while i < len(s) and len(lb) < k:
    if s[i] == 'o':
        lb.append(i)
        i += c + 1
        continue
    i += 1

while l > -1 and len(le) < k:
    if s[l] == 'o':
        le.append(l)
        l -= (c + 1)
        continue
    l -= 1

le.sort()
for j in range(0, len(lb)):
    if lb[j] == le[j]:
        print(lb[j]+1)
Buggy python submission (verdict: Runtime Error):
n = int(input())

print(int((n/500))*1000 + int((n%500)/5))*5

Fixed submission:
n = int(input())

print(int((n/500))*1000 + int((n%500)/5)*5)
Buggy python submission (verdict: Runtime Error):
num = int(input())
a=[0*num for i in range(num)]
boss=input().split(" ")
for i in range(num-1):
  a[int(boss[i])-1]+=1
for i in range(num):
  print(a[i])

Fixed submission:
r=int(input())
print(r*2*3.14)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s=input()

import itertools
cnt=0
a=list(itertools.combinations(range(1,n+1),3))

for num in range(len(a)):
    i=int(a[num][0]-1)
    j=int(a[num][1]-1)
    k=int(a[num][2]-1)
    if j-i!=k-j:
        if s[i]!=s[j] and s[j]!=s[k] and s[k]!=s[i]:
            cnt+=1
print(cnt)

Fixed submission:
n=int(input())
s=input()

ans = s.count('R')*s.count('G')*s.count('B')

for i in range(n-1):
    for j in range(i+1,n):
        k=j+j-i
        if k<n:
            if s[i]!=s[j] and s[j]!=s[k] and s[k]!=s[i]:
                ans-=1
print(ans)
Buggy python submission (verdict: Runtime Error):
h,n=map(int, input().split()) 
ab=[list(map(int, input().split())) for _ in range(n)] 

INF = 10**18
dp = [INF]*(h+1)
#dp[i]: hpがiの相手に消費する魔力の最小値
dp[0]=0

for i in range(h):#i:累積ダメージi
    for j in range(n):#
        if i+A[j]<=h: #
            dp[i+A[j]]=min(dp[i+A[j]],dp[i]+B[j])
        else:
            dp[-1]=min(dp[-1],dp[i]+B[j])
print(dp[-1])

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

INF = 10**18
dp = [INF]*(h+1)
#dp[i]: hpがiの相手に消費する魔力の最小値
dp[0]=0

for i in range(h):#i:累積ダメージi
    for j in range(n):#
        if i+ab[j][0]<=h: #
            dp[i+ab[j][0]]=min(dp[i+ab[j][0]],dp[i]+ab[j][1])
        else:
            dp[-1]=min(dp[-1],dp[i]+ab[j][1])
print(dp[-1])
Buggy python submission (verdict: Runtime Error):
a,b,k=map(int, input().split())

def cf(x1,x2):
    cf=[]
    for i in range(2,min(x1,x2)+1):
        if x1 % i == 0 and x2 % i == 0:
            cf.append(i)
    return cf

print(cf(a,b)[-k])


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

def cf(x1,x2):
    cf=[]
    for i in range(1,min(x1,x2)+1):
        if x1 % i == 0 and x2 % i == 0:
            cf.append(i)
    return cf

print(cf(a,b)[-k])
Buggy python submission (verdict: Runtime Error):
N = int(input())

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors


for i in range(1,N+1,2):
    if(len(make_divisors(i))==8):
        cnt+=1
        
print(cnt)

Fixed submission:
N = int(input())
cnt=0
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors

for i in range(1,N+1,2):
    if(len(make_divisors(i))==8):
        cnt+=1
        
print(cnt)
Buggy python submission (verdict: Runtime Error):
n,m=map(int, input().split())
ab=[list(map(int, input().split())) for _ in range(m)] 

ab.sort(key=lambda ab:ab[1])
ans=[ab[0]]
for i in range(1:m):
    if ans[-1][1]<=ab[i][0]:
        ans.append(ab[i])
print(len(ans))

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

ab.sort(key=lambda ab:ab[1])
ans=[ab[0]]
for i in range(1,m):
    if ans[-1][1]<=ab[i][0]:
        ans.append(ab[i])
print(len(ans))
Buggy python submission (verdict: Runtime Error):
a,b,c,x,y=map(int, input().split())

ans = min(a*x+b*y, c*max(x,y)*2, c*x*2+max(0,(y-x)*b), c*y*2+max((x-y)*a)*a)

print(ans)

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

ans = min(a*x+b*y, c*max(x,y)*2, c*x*2+max(0,(y-x)*b), c*y*2+max(0,(x-y)*a))

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
ans = 10
for i in range(1,N+1):
    if(N%i==0):
        a = i
        b = int(N/i)
        F = max(len(str(a)), len(str(b)))
        ans = min(ans, F)
print(ans)

Fixed submission:
N = int(input())
ans = 10
for i in range(1,int(N**0.5)+1):
    if(N%i==0):
        a = i
        b = int(N/i)
        F = max(len(str(a)), len(str(b)))
        ans = min(ans, F)
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
lst = list(map(int, intput().split()))
x = 0
for i in lst:
  if i == x + 1:
    	x = x + 1

print(n-x)


Fixed submission:
n = int(input())
lst = list(map(int, input().split()))
x = 0
for i in lst:
  if i == x + 1:
    	x = x + 1
if x == 0:
  print(-1)
else:
  print(n-x)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
for i in range(1,N+1):
    print(A.count(i))

Fixed submission:
R = int(input())

result = 3.1415926535*2*R
print(result)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
for i in range(1,N+1):
    print(A.count(i))

Fixed submission:
R = int(input())

result = 3.1415926535*2*R
print(result)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
for i in range(1,N+1):
    print(A.count(i))

Fixed submission:
R = int(input())

result = 3.1415926535*2*R
print(result)