Problem:


Score: 200 points

Problem Statement

The number 105 is quite special - it is odd but still it has eight divisors.
Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?

Constraints

N is an integer between 1 and 200 (inclusive).

Input

Input is given from Standard Input in the following format:

N

Output

Print the count.

Sample Input 1

105

Sample Output 1

1

Among the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.

Sample Input 2

7

Sample Output 2

0

1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.



Sample input:
105


Sample output:
1

Submission status: Runtime Error

Solution code:
n = int(input())
if !n%2:
    n += 1

result = 0

for i in range(1,n+2,2):
    print(i)
    cnt = 0

    for ii in range(1,i+2,2):
        if i%ii == 0:
            cnt += 1

    if cnt >= 8:
        result += 1

print(result)

Submission status: Runtime Error

Solution code:
n = int(input())
c = 0
d = 0
for i in range(n):
  for j in range(1,n,2):
    if j % i == 0:
      c += 1
      if c == 8:
        d += 1
print(d)

Submission status: Runtime Error

Solution code:
answer = 0
for i in range(1, n+1, 2):
    num_of_divisor = 0
    for j in range(1, i+1):
        if i % j == 0:
            num_of_divisor += 1
    if num_of_divisor == 8:
        answer += 1
print(answer)

Submission status: Runtime Error

Solution code:

for i in range(107, 200, 2):
    divisors = []
    for j in range(1, 201):
        if i%j == 0:
            divisors.append(j)
    if len(divisors) == 8:
        divisors_8.append(i)

n = int(input())

divisors_8.append(n)
divisors_8.sort()
result = divisors_8.index(n)

if n not in divisors_8:
    print(result)
else:
    print(result+1)

Submission status: Runtime Error

Solution code:
a,b = map(int,input().split())
if (a*b)%2 == 0:
    print("No")
else:
    print("Yes")

Submission status: Runtime Error

Solution code:
def main():
	n = int(input())

	if n <= 104:
		print(0):
	elif n <= 134:
		print(1)
	elif n <= 188:
		print(2)
	else:
		print(3)


if __name__ == '__main__':
	main()

Submission status: Runtime Error

Solution code:
import sys

lines='''105
'''
sys.stdin = io.StringIO(lines)

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(n):
    yakusuu_array=[] 
    for x in range(1,n+1): 
        if n%x == 0: 
            yakusuu_array.append(x) 
    a=len(yakusuu_array)
    #print(yakusuu_array)
    if a >= 8 and n%2 != 0 and 1 <= n and n <=200:
        return 1 
    else: 
        return 0

# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
def readQuestion():
    line = sys.stdin.readline().rstrip()
    return int(line)

def main():
    n = readQuestion()
    answer = solve(n)
    print(answer)
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
if __name__ == '__main__':
    #AB = [int(i) for i in input().split()]
    N = int(input())
    n = 0
    for i in range(N):
        k = 0
        for j in range(int(i/2)):
            if i % j == 0:
                k += 1
            if k > 8:
                break
        if k == 8:
            n += 1
    print(n)

Submission status: Runtime Error

Solution code:
n=map(int,input().split())
if n<=105:
    print(0)
elif n<=135:
    print(1)
elif n<=189:
    print(2)
else:
    print(3)

Submission status: Runtime Error

Solution code:
n=map(int,input().split())
if n<=105:
    print(0)
elif n<=135:
    print(1)
elif n<=189:
    print(2)

Submission status: Runtime Error

Solution code:
N=input()
div=0
A=0
B=0
count=0
answer=0
for i in range(1,N+1,2):
  div=0
  count=0
  while True:
    div+=1
    if i%div==0:
      A=div
      B=N/siv
      count+=1
    if B=count:
      if A<B and count==4:
        answer+=1  
      break
print(answer)

Submission status: Runtime Error

Solution code:
# a*b*c : 105, 165
# a^3*b : 135, 189

n = int(input())
print(4 if n >= 189 else 3 if n >= 165 else if 2 if n >=n 135 else 1 if n >= 105 else 0)

Submission status: Runtime Error

Solution code:
N = int(input())
if N<105:
    print(0)

else:
    ans = 0
    for i in range(105,N+1,2):
        temp = 0
        for j in range(1,i+1):
            if i%j == 0:
                temp +=1
        if temp == 8:
            ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
cnt = 0

for i in range(1,N+1):
    if i % 2 == 0:continue
    c = 0
    for j in range(1,N+1):
        if c > 8:
            cnt -= 1:continue
        if i % j == 0:
            c += 1
    if c ==8:
        cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
N = int(input())
cnt = 0

for i in range(1,N+1)
    if i % 2 == 0:continue
    c = 0
    for j in range(1,N+1):
        if c > 8:
            cnt -= 1:continue
        if i % j == 0:
            c += 1
    if c ==8:
        cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
N = int(input())
cnt = 0

for i in range(1,N+1)
    if i % 2 == 0:continue
    c = 0
    for j in range(1,N+1):
        if cnt > 8:
            cnt -= 1:continue
        if i % j == 0:
            c += 1
    if c ==8:
        cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
n = int(input())
d = [1] * (n + 1)
for i in range(2, n+1):
    for j in range(i, n+1, i)
        d[j] += 1
ans = 0
for i in range(1, n, 2):
  if d[i] == 8:
    ans += 1

print(ans)

Submission status: Runtime Error

Solution code:
print 105

Submission status: Runtime Error

Solution code:
#106b
n = int(input())
ans=0
for i in range(1,n+1,2):
    c=0
    for j in range(1,i+1):
        if i%j==0:
            c+=1
            
    if c==8:
        a+=1
print(ans)

Submission status: Runtime Error

Solution code:
#106b
n = int(input())
ans=0
for i in range(1,n+1,2):
    c=0
    for j in range(1,i+1):
        print(i,j)
        if i%j==0:
            c+=1
            
    if c==8:
        a+=1
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
c = 0

for x in range(2, n // 2 + 1)
  if n % x == 0:
    c += 1

print(c)

Submission status: Runtime Error

Solution code:
def count(n):
  ans = 0
  for i in range(1,n+1):
    if n % i == 0:
      ans += 1
  return ans

ans = 0
N = (int(i) for i in input().split())
for i in range(1,N+1):
  if count(i) == 8:
    ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
def count(n):
  ans = 0
  for i in range(1,n+1):
    if n % i == 0:
      ans += 1
  return ans

ans = 0
a = (int(i) for i in input().split())
for i in range(1,n+1):
  if count(i) == 8:
    ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
n=int(input())
print(len([i for i in range (1,int(input())+1) if i%2 == 1 and len([1 for x in range(1,i+1) if i%x==0]) == 8]))

Submission status: Runtime Error

Solution code:
N = input()
list = []
for i in range(1, N):
  numbers = []
  for a in range(1, i):
    if i % a == 0:
      numbers.append()
  if len(numbers) == 8:
      list.append(i)
print(len(list))

Submission status: Runtime Error

Solution code:
s = list(map(int, list(input())))
k = int(input())

cnt1 = 0
if s[0]==1:
    cnt1 += 1
    
for i in range(1, len(s)):
    if s[0] == 1 and s[i-1] == 1 and s[i] == s[i-1]:
        cnt1 += 1
        
if k <= cnt1:
    print(1)
elif cnt1 == 0:
    print(s[0])
else:
    print(s[cnt1])

Submission status: Runtime Error

Solution code:
a = input()
ans = 0
if a >= 105:
    ans+=1
if a >= 135:
    ans+=1
if a >= 165:
    ans+=1
if a >= 189:
    ans+=1
if a >= 195:
    ans+=1
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())

prime = [3, 5, 7, 11, 13]

# 約数が8個ということは、素因数分解した時の素因数の個数が0/7, 1/3, 1/1/1以外ありえない
zero_seven = 0
one_three = [a * (b ** 3) for a in prime for b in prime if a != b]
one_three = [i for i in one_three if i <= 200]
one_one_oen = [a * b * c for a in prime for b in prime for c in prime
               if a != b and b != c and c != a]
one_one_oen = [i for i in one_one_oen if i <= 200]

ans = sorted(set(one_three + one_one_oen))
i = 0
if ans[-1] < N:
    print(len(ans))
else: 
    while ans[i] <= N:
        i += 1
        if ans[i] > N:
            print(i)
            quit()

print(i)

Submission status: Runtime Error

Solution code:
N = int(input())

prime = [3, 5, 7, 11, 13]

# 約数が8個ということは、素因数分解した時の素因数の個数が0/7, 1/3, 1/1/1以外ありえない
zero_seven = 0
one_three = [a * (b ** 3) for a in prime for b in prime if a != b]
one_three = [i for i in one_three if i <= 200]
one_one_oen = [a * b * c for a in prime for b in prime for c in prime
               if a != b and b != c and c != a]
one_one_oen = [i for i in one_one_oen if i <= 200]

ans = sorted(set(one_three + one_one_oen))
i = 0
while ans[i] <= N:
    i += 1
    if ans[i] > N:
        print(i)

Submission status: Runtime Error

Solution code:
import sys
n = input()
if n <= 104:
    print(0)
    sys.exit()
elif n <= 134:
    print(1)
    sys.exit()
elif n <= 164:
    print(2)
    sys.exit()
elif n <= 188:
    print(3)
    sys.exit()
else:
    print(4)

Submission status: Runtime Error

Solution code:
import sympy

N = int(input())

ans = 0

for i in range(1, N+1):
    if i % 2 == 1 and sympy.divisor_count(i) == 8:
        ans += 1

print(ans)

Submission status: Runtime Error

Solution code:
N=int(input())
num=0
for j in range(1,N+1,2):
	cnt=0
	for i in range(1,j+1):
#        print(i)
#        print(j)
        if j%i==0 :
            cnt=cnt+1
    if cnt==8 :
#        print(cnt)
        num+=1
#    print("---")
print(num)

Submission status: Runtime Error

Solution code:
N=int(input())
num=0
for j in range(1,N+1,2):
  cnt=0
    for i in range(1,j+1):
#        print(i)
#        print(j)
        if j%i==0 :
            cnt=cnt+1
    if cnt==8 :
#        print(cnt)
        num+=1
#    print("---")
print(num)

Submission status: Runtime Error

Solution code:
n=input()
s=0
a=[105,135,165,195,189]
for i in a:
  if n>=i:
    s+=1
print(s)

Submission status: Runtime Error

Solution code:
 n=int(input())
     
 if n<105:
   print(0)
 if (n>=105)and(n<165):
   print(1)
 else:
   print(2)

Submission status: Runtime Error

Solution code:
n=input()
ans=0
for i in range(1,n):
  cnt=0
  for j in range(1,n):
    if i%j==0:
      cnt=cnt+1
  if cnt==8:
    ans+=1
print(int(ans))

Submission status: Runtime Error

Solution code:
a = int(input())
result = 0
for i in range(0, a):
    tmp = 0
    for j in range(0, i):
        if i % j == 0:
            tmp += 1
    if tmp == 8:
        result += 1

print(result)

Submission status: Runtime Error

Solution code:
import numpy as np
N=int(input())
x=[105, 135, 165, 189, 195]

X=[N-x[i] for i in range(len(x))]
XX=np.where(np.array(X) < 0) 
if N<195:
  print(XX[0][0])
  else:
    print(5)

Submission status: Runtime Error

Solution code:
import numpy as np
N=int(input())
x=[105, 135, 165, 189, 195]

X=[N-x[i] for i in range(len(x))]
XX=np.where(np.array(X) < 0) 
print(XX[0][0])

Submission status: Runtime Error

Solution code:
N = int(input())
if N <=104:
    print(0)
    
elif N <= 106:
    print(1)

else:
    if N%2 != 0:
        num = list(range(105, N+1))
        kotae = list(range(1, N+2, 2))
    else:
        num = list(range(105, N))
        kotae = list(range(1, N, 2))
        
    num = num[::2]
    ans = [0] * len(num)
    
    for index, i in enumerate(num):
        for t in kotae:
            if i%t ==0:
                ans[index] += 1

print(len([1 for x in ans if x>=8]))

Submission status: Runtime Error

Solution code:
N=int(input())
import math


#hoge=[[108]]

#x=[3,5,7,11,13,17,19]
#a=[pow(2,3)*i for i in x]

x=[5,7]
b=[[pow(3,3)*i for i in x]]

#x=[5,7,11,13,17,19,23,29,31]
#c=[2*3*i for i in x]

#x=[7,11,13,17,19]
#d=[2*5*i for i in x]

#x=[11,13]
#e=[2*7*i for i in x]

x=[7,11,13]
f=[3*5*i for i in x]

b.append(f)



x=[]
for v in b:
  for item in v:
    x.append(item)


x.sort()
import numpy as np
X=[N-x[i] for i in range(len(x))]
XX=np.where(np.array(X) < 0) 
if N!=1:
  print(XX[0][0])
if N==1:
  print(0)

Submission status: Runtime Error

Solution code:
N=int(input())
import math

#hoge=[[108]]

#x=[3,5,7,11,13,17,19]
#a=[pow(2,3)*i for i in x]

x=[5,7]
b=[[pow(3,3)*i for i in x]]

#x=[5,7,11,13,17,19,23,29,31]
#c=[2*3*i for i in x]

#x=[7,11,13,17,19]
#d=[2*5*i for i in x]

#x=[11,13]
#e=[2*7*i for i in x]

x=[7,11,13]
f=[3*5*i for i in x]

b.append(f)



x=[]
for v in b:
  for item in v:
    x.append(item)


x.sort()
import numpy as np
X=[N-x[i] for i in range(len(x))]
XX=np.where(np.array(X) < 0) 
print(XX[0][0])

Submission status: Runtime Error

Solution code:
num = int(input())
if num<105:
elif num>=105 and num<135:
    print(1)
elif num>=135 and num<165:
    print(2)
elif num>=165 and num<195:
    print(3)
elif num>=195 and num<199:
    print(4)
elif num<=199:
    print(5)

Submission status: Runtime Error

Solution code:
N = int(input())
print([0, 1][if N > 105])

Submission status: Runtime Error

Solution code:
N = int(input())
print([0, 1][if N > 105]

Submission status: Runtime Error

Solution code:
N=int(input())
import math

#hoge=[[108]]

#x=[3,5,7,11,13,17,19]
#a=[pow(2,3)*i for i in x]

x=[[5,7]]
b=[pow(3,3)*i for i in x]

#x=[5,7,11,13,17,19,23,29,31]
#c=[2*3*i for i in x]

#x=[7,11,13,17,19]
#d=[2*5*i for i in x]

#x=[11,13]
#e=[2*7*i for i in x]

x=[7,11,13]
f=[3*5*i for i in x]

b.append(f)



x=[]
for v in b:
  for item in v:
    x.append(item)


x.sort()
import numpy as np
X=[N-x[i] for i in range(len(x))]
XX=np.where(np.array(X) < 0) 
print(XX[0][0])

Submission status: Runtime Error

Solution code:
N=int(input())
import math

#hoge=[[108]]

#x=[3,5,7,11,13,17,19]
#a=[pow(2,3)*i for i in x]

x=[5,7]
b=[pow(3,3)*i for i in x]

#x=[5,7,11,13,17,19,23,29,31]
#c=[2*3*i for i in x]

#x=[7,11,13,17,19]
#d=[2*5*i for i in x]

#x=[11,13]
#e=[2*7*i for i in x]

x=[7,11,13]
f=[3*5*i for i in x]

b.append(f)



x=[]
for v in b:
  for item in v:
    x.append(item)


x.sort()
import numpy as np
X=[N-x[i] for i in range(len(x))]
XX=np.where(np.array(X) < 0) 
print(XX[0][0])

Submission status: Runtime Error

Solution code:
N=int(input())
import math

hoge=[[108]]

x=[3,5,7,11,13,17,19]
a=[pow(2,3)*i for i in x]

x=[2,5,7]
b=[pow(3,3)*i for i in x]

x=[5,7,11,13,17,19,23,29,31]
c=[2*3*i for i in x]

x=[7,11,13,17,19]
d=[2*5*i for i in x]

x=[11,13]
e=[2*7*i for i in x]

x=[7,11,13]
f=[3*5*i for i in x]

hoge.append(a)
hoge.append(b)
hoge.append(c)
hoge.append(d)
hoge.append(e)
hoge.append(f)


x=[]
for v in hoge:
  for item in v:
    x.append(item)

x.sort()
import numpy as np
X=[N-x[i] for i in range(len(x))]
XX=np.where(np.array(X) < 0) 
print(XX[0][0])

Submission status: Runtime Error

Solution code:
import sympy

N=int(input())
count=0
if N==195:
    print(5)
elif N==189:
    print(4)
elif N==165:
    print(3)
elif N==135:
    print(2)
elif N==105:
    print(1)
else:
    print(0)

Submission status: Runtime Error

Solution code:
import sympy
N=int(input())
for i in range(N+1):
    m=sympy.divisor_count(i)
    if m==8:
        cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
N=int(input())
import math

hoge=[[108]]

x=[3,5,7,11,13,17,19]
a=[pow(2,3)*i for i in x]

x=[2,5,7]
b=[pow(3,3)*i for i in x]

x=[5,7,11,13,17,19,23,29,31]
c=[2*3*i for i in x]

x=[7,11,13,17,19]
d=[2*5*i for i in x]

x=[11,13]
e=[2*7*i for i in x]

x=[7,11,13]
f=[3*5*i for i in x]

hoge.append(a)
hoge.append(b)
hoge.append(c)
hoge.append(d)
hoge.append(e)
hoge.append(f)


x=[]
for v in hoge:
  for item in v:
    x.append(item)

x.sort()
import numpy as np
X=N-x
XX=np.where(X < 0) 
print(XX[0])

Submission status: Runtime Error

Solution code:
import sympy

N=int(input())
count=0
for i in range(N):
    if sympy.divisor_count(i+1)==8 and (i+1)%2==1:
        count+=1
    else:
        continue

print(count)

Submission status: Runtime Error

Solution code:
import sympy

N=int(input())
count=0
for i in range(N):
    if sympy.divisor_count(i+1)==8 and (i+1)%2==1:
        count+=1

print(count)

Submission status: Runtime Error

Solution code:
import sympy

N=int(input())
count=0
for i in range(N):
    if sympy.divisor_count(i+1)==8 and (i+1)%2==1:
        count+=1
input(count)

Submission status: Runtime Error

Solution code:
num = int(input())
if num < 105 :
    print(0)
elif num>=105 and num<165:
    print(1)
elif num>=165 and num<195:
    print(2)
elif num>=195 and num<=200:
    print(3)
else print('error')

Submission status: Runtime Error

Solution code:
# coding:utf-8
list=[0]*200
for i in range(2,201,1):
    m=1
    while m*i<=200:
        list[m*i]+=1
        m+=1
n=int(input())
ct=0
for i in range(1,n+1,2):
    if list[i]==8:
        ct+=1
print(ct)

Submission status: Runtime Error

Solution code:
import sys
from collection import defaultdict
import math

def calc(num):
    if num<=1:
        return 1
    else:
        num_sqrt=math.floor(math.sqrt(num))
        prime_list=make_prime_list_2(num_sqrt)

        dict_counter=defaultdict(int)
        for prime in prime_list:
            while num % prime==0:
                dict_counter[prime]+=1
                num //=prime
        if num !=1:
            dict_counter[num]+=1

        dict_counter=dict(dict_counter)

        return dict_counter
def main():
    num=input()
    eight_counter=[]
    calc_result=calc(num)
    for i in range(num):
        if calc_result==8:
            eight_counter.append(num)
        else:
            pass
    print(len(eight_counter))

main()

Submission status: Runtime Error

Solution code:
n = int(input())
int a = 0
if n >= 105:
    a += 1
if n >= 165:
  a += 1
if n >= 195:
  a += 1
print(a)

Submission status: Runtime Error

Solution code:
n = int(input().split())
if n >= 105:
    print(1)
else:
  print(0)

Submission status: Runtime Error

Solution code:
a = int(input())

b=0#約数の個数

for i in range(1,a+1, 2):#i:1~inputまで,奇数だけ
  #ある数Niについて約数を数える
	yakusuu_array = []

	for i in range(1,num):
	    if num % i == 0:
            yakusuu_array.append(i)
            
  	if len(yakusuu_array) == 8:
  		b += 1
print(b)

Submission status: Runtime Error

Solution code:
a = int(input())

b=0#約数の個数

for i in range(1,a+1, 2):#i:1~inputまで,奇数だけ
  #ある数Niについて約数を数える
    yakusuu_array = []

    for i in range(1,num):
        if num % i == 0:
    	    yakusuu_array.append(i)
            
    if len(yakusuu_array) == 8:
  	    b += 1
print(b)

Submission status: Runtime Error

Solution code:
import sys
from collection import defaultdict
import math

def calc(num):
    if num<=1:
        return 1
    else:
        num_sqrt=math.floor(math.sqrt(num))
        prime_list=make_prime_list_2(num_sqrt)

        dict_counter=defaultdict(int)
        for prime in prime_list:
            while num % prime==0:
                dict_counter[prime]+=1
                num //=prime
        if num !=1:
            dict_counter[num]+=1

        dict_counter=dict(dict_counter)

        return dict_counter
def main():
    num=input()
    eight_counter=[]
    for i in range(num):
        if calc(num)==8:
            eight_counter.append(num)
        else:
            pass
    print(len(eight_counter))

main()

Submission status: Runtime Error

Solution code:
a = int(input())

b=0#約数の個数

for i in range(1,a+1, 2):#i:1~inputまで,奇数だけ
  #ある数Niについて約数を数える
	yakusuu_array = []

	for i in range(1,num):
	    if num % i == 0:
    	    yakusuu_array.append(i)
            
  	if len(yakusuu_array) == 8:
  		b += 1
print(b)

Submission status: Runtime Error

Solution code:
import math

n = int(input())

cnt = 0
def search_divisor_num_1(num):
    if num < 0:
        return None
    elif num == 1:
        return 1
    else:
        num_sqrt = math.floor(math.sqrt(num))
        prime_list = make_prime_list_2(num_sqrt)

        divisor_num = 1
        for prime in prime_list:
            count = 1
            while num % prime == 0:
                num //= prime
                count += 1
            divisor_num *= count

        if num != 1:
            divisor_num *= 2

        return divisor_num

for i in range(n+1):
    if i%2==0 and search_divisor_num_1(i) == 8:
        cnt += 1

print(cnt)

Submission status: Runtime Error

Solution code:
n = int(input())

cnt = 0
def search_divisor_num_1(num):
    if num < 0:
        return None
    elif num == 1:
        return 1
    else:
        num_sqrt = math.floor(math.sqrt(num))
        prime_list = make_prime_list_2(num_sqrt)

        divisor_num = 1
        for prime in prime_list:
            count = 1
            while num % prime == 0:
                num //= prime
                count += 1
            divisor_num *= count

        if num != 1:
            divisor_num *= 2

        return divisor_num

for i in range(n+1):
    if i%2==0 and search_divisor_num_1(i) == 8:
        cnt += 1

print(cnt)

Submission status: Runtime Error

Solution code:
n = int(input())

cnt = 0
def search_divisor_num_1(num):
    if num < 0:
        return None
    elif num == 1:
        return 1
    else:
        num_sqrt = math.floor(math.sqrt(num))
        prime_list = make_prime_list_2(num_sqrt)

        divisor_num = 1
        for prime in prime_list:
            count = 1
            while num % prime == 0:
                num //= prime
                count += 1
            divisor_num *= count

        if num != 1:
            divisor_num *= 2

        return divisor_num

for i in range(n):
    if (i+1)%2==0 and search_divisor_num_1(i+1) == 8:
        cnt += 1

print(cnt)

Submission status: Runtime Error

Solution code:
import sympy

N = int(input())

cnt = 0
for i in range(1, N + 1, 2):
    if len(sympy.divisors(i)) == 8:
        cnt += 1

print(cnt)

Submission status: Runtime Error

Solution code:
# sympyをインポート
import sympy
N = int(input())
print(int(list(map(sympy.divisor_count,list(range(1,N + 1))[:: 2])).count(8)))

Submission status: Runtime Error

Solution code:
n = int(input())
if n < 105:
  print(0)
else:
  ans = 0
  for i in range(n,103,-2):
    count = 1
    for j in range(1,99,2):
      nj = n%j
      if nj == 0:
        count += 1
      if count == 9:
        ans -= 1
    if count == 8:
      ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
if N < 105:
    S = 0
elif N < 135:
    S = 1
elif N < 165:
    S = 2
elif N < 189:
    S = 3
elif N < 195:
    s = 4
else:
    s = 5
print(S)

Submission status: Runtime Error

Solution code:
import sympy
N = int(input())
print(list(map(sympy.divisor_count,list(range(1,N + 1))[:: 2])).count(8))

Submission status: Runtime Error

Solution code:
import sys
from collection import defaultdict
import math

def calc(num):
    if num<=1:
        return 1
    else:
        num_sqrt=math.floor(math.sqrt(num))
        prime_list=make_prime_list_2(num_sqrt)

        dict_counter=defaultdict(int)
        for prime in prime_list:
            while num % prime==0:
                dict_counter[prime]+=1
                num //=prime
        if num !=1:
            dict_counter[num]+=1

        dict_counter=dict(dict_counter)

        return dict_counter
def main():
    argvs=sys.argv
    num=int(argvs[1])
    eight_counter=[]
    for i in range(num):
        if calc(num)==8:
            eight_counter.append(num)
        else:
            pass
    print(len(eight_counter))

main()

Submission status: Runtime Error

Solution code:
n = int(input())
if n < 105:
  print(0)
else:
  ans = 0
  for i in range(n,103,-2):
    count = 1
    for j in range(1,101,2):
      nj = n%j
      if nj == 0:
        count += 1
      if count == 9:
        break
    if count == 8:
      ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
if n < 105:
  print(0)
else:
  ans = 0
  for i in range(n,103,-2):
    count = 1
    for j in range(1,99,2):
      nj = n%j
      if nj == 0:
        count += 1
      if count == 9:
        break
    if count == 8:
      ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
¥n = int(input())

if n >= 195:
    print(5)
elif n >= 189:
    print(4)
elif n >= 165:
    print(3)
elif n >= 135:
    print(2)
elif n >= 105:
    print(1)
else:
    print(0)

Submission status: Runtime Error

Solution code:
n = int(input())
lst = [105, 135, 165, 189, 195, 201]
for i in range(6):
    if n < lst(i):
        print(i)
        break

Submission status: Runtime Error

Solution code:
N = int(input())
if(N >= 105):
  print(!)
else:
  print(0)

Submission status: Runtime Error

Solution code:

N = int(input())

if N => 195:
    print("4")
elif N => 165:
    print("3")
elif N => 135:
    print("2")
elif N => 105:
    print("1")
else:
    print("0")

Submission status: Runtime Error

Solution code:
str=input()
n=int(str)
c=0
ans=0
for num in range(1,n):
    for number in range(1,num):
        if num%number==0:
            c+=1
    if c==8:
        d+=1
print(d)

Submission status: Runtime Error

Solution code:
if N < 105:
    print(0)
elif N < 165:
    print(1)
elif N < 195:
    print(2)
else:
    print(3)

Submission status: Runtime Error

Solution code:
if N<=104:
    print(0)
elif N<=134:
    print(1)
elif N<=164:
    print(2)
elif N<=188:
    print(3)
else:
    print(4)

Submission status: Runtime Error

Solution code:
if N < 105:
    print(0)
elif N < 165:
    print(1)
else N < 195:
    print(2)
else:
    print(3)

Submission status: Runtime Error

Solution code:
N, = list(map(int,input().split()))

ans = 0

for i in range(N):
    num = 0
    for j in range(200):
        if  N % j == 0:
        num += 1
    if  num == 8:
    ans += 1

print(ans)

Submission status: Runtime Error

Solution code:
# B
import math
N = int(input())

def make_prime_list(num):
    if num < 2:
        return []

    prime_list = [i for i in range(num + 1)]
    prime_list[1] = 0 # 1は素数ではない
    num_sqrt = math.sqrt(num)

    for prime in prime_list:
        if prime == 0:
            continue
        if prime > num_sqrt:
            break

        for non_prime in range(2 * prime, num, prime):
            prime_list[non_prime] = 0

    return [prime for prime in prime_list if prime != 0]

def search_divisor_num(num):
    if num < 0:
        return None
    elif num == 1:
        return 1
    else:
        num_sqrt = math.floor(math.sqrt(num))
        prime_list = make_prime_list_2(num_sqrt)

        divisor_num = 1
        for prime in prime_list:
            count = 1
            while num % prime == 0:
                num //= prime
                count += 1
            divisor_num *= count

        if num != 1:
            divisor_num *= 2

        return divisor_num

re = 0
for i in range(1, N+1, 2):
    num = search_divisor_num(i)
    if num == 8:
        re += 1
        
print(re)

Submission status: Runtime Error

Solution code:
import sympy
N = int(input())
list(map(sympy.divisor_count,list(range(1,N + 1))[:: 2])).count(8)

Submission status: Runtime Error

Solution code:
import sympy
N = int(input.())
list(map(sympy.divisor_count,list(range(1,N + 1))[:: 2])).count(8)

Submission status: Runtime Error

Solution code:
N = int(input())
if N < 105:
  print(0)
elif N < 135:
  print(1)
elif N < 165:
  print(2):
elif N < 189:
  print(3)
elif N < 195:
  print(4)
else:
  print(5)

Submission status: Runtime Error

Solution code:
n = int(input())

result = 0
for i in range(1, n, 2):
    count = 0
    for j in range(i//2):
        if i % j == 0:
            count += 1
    if count == 8:
        result += 1

print(result)

Submission status: Runtime Error

Solution code:
n=input()
print len(0 for k in range(1,n+1,2) if sum(1 for v in range(1,k+1) if k%v==0)==8)