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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    ans = 0
    for n in range(N, N + 1):
        c = 0
        for i in range(1, N + 1):
            if c > 8:
                break
            if n % i != 0:
                continue
            c += 1
        if c == 8:
            ans += 1
    print(ans)


main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
if N>=189:
    print(3)
elif N>=135:
    print(2)
elif N>=105:
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
N=int(input())
if N>=105:
    print(1)
elif N>=135:
    print(2)
elif N>=189:
    print(3)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
n=int(input())
b=[105,135,165,189]
print(len([i for i in b if i<=n]))

Submission status: Wrong Answer

Solution code:
n=int(input())
b=[105,135,189]
print(len([i for i in b if i<=n]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
count=0
counti=0
for i in range(1,N+1):
    if(counti==8):
        count+=1
        counti=0
    counti=0
    for j in range(1,N+1,2):
        if(j%i==0):
            counti+=1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
count2 = 0
if N < 105:
    print('0')
    exit()
for j in range(105, N+1):
    count = 0
    for i in range(1, j+1, 2):
        if N % i == 0:
            count += 1
    if count == 8:
        count2 += 1
print(count2)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = [105,165,195,135]
ret = 0
for a in ans:
    if a <= n:
        ret += 1
print(ret)

Submission status: Wrong Answer

Solution code:
print(5)

Submission status: Wrong Answer

Solution code:
count= 1
ans = 0
N = int(input())
for i in range(1,N,2):
    if N % i ==0:
        count+=1
    if count % 8 == 0:
        count = 1
        ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    if n >= 3 * 5 * 13:
        print(3)
    elif n >= 3 * 5 * 11:
        print(2)
    elif n >= 3 * 5 * 7:
        print(1)
    else:
        print(0)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    if n >= 3 * 5 * 11:
        print(2)
    elif n >= 3 * 5 * 7:
        print(1)
    else:
        print(0)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
count=0
ans=0
for i in range(105, N+1):
    if(i%3==0):
        count+=1
    if(i%5==0):
        count+=1
    if(i%7==0):
        count+=1
    if(i%11==0):
        count+=1
    if(i%13==0):
        count+=1
    if(i%2==0):
        count=0
    if(count==3):
        print(i)
        ans+=1

Submission status: Wrong Answer

Solution code:
N = int(input())
count=0
ans=0
for i in range(100, N+1):
    if(i%3==0):
        count+=1
    if(i%5==0):
        count+=1
    if(i%7==0):
        count+=1
    if(i%9==0):
        count+=1
    if(i%11==0):
        count+=1
    if(i%13==0):
        count+=1
    if(i%2==0):
        count=0
    if(count==3):
        ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
#105 という数は, 非常に特殊な性質を持つ - 奇数なのに, 約数が 8 個もある.
#さて, 1 以上 N 以下の奇数のうち, 正の約数を ちょうど 8 個持つようなものの個数を求めよ.
# N は 1 以上 200 以下の整数
# 入力は奇数

N = int(input())
# 半分にして、割れるものをカウント
# 105の場合、[1, 3, 5, 7, 15, 21, 35, 105]


ans_num = 0


for a in range(1, N + 1):
  yakusuu = []
  for i in range(1, a+1):
    if a % i == 0:
      yakusuu.append(i)
  if len(yakusuu) == 8:
    ans_num = ans_num + 1

print(ans_num)

Submission status: Wrong Answer

Solution code:
#105 という数は, 非常に特殊な性質を持つ - 奇数なのに, 約数が 8 個もある.
#さて, 1 以上 N 以下の奇数のうち, 正の約数を ちょうど 8 個持つようなものの個数を求めよ.
# N は 1 以上 200 以下の整数
# 入力は奇数

N = int(input())
# 半分にして、割れるものをカウント
# 105の場合、[1, 3, 5, 7, 15, 21, 35, 105]


ans_num = 0


for a in range(1, N + 1):
  yakusuu = []
  for i in range(1, a+1):
    if N % i == 0:
      yakusuu.append(i)
  if len(yakusuu) == 8:
    ans_num = ans_num + 1

print(ans_num)

Submission status: Wrong Answer

Solution code:
N = int(input())

X = [3, 5, 7, 11, 13, 17]
D = []

for i in range(len(X)-2):
  for j in range(i+1, len(X)-1):
    for k in range(j+1, len(X)):
      t = X[i]* X[j] * X[k]
      if t <= N:
        D.append(t)
      else:
        break
    if X[i]*X[j] >= N:
      break

print(len(D))

Submission status: Wrong Answer

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


n = int(input())
print(sum(1 for i in range(1, 200 + 1) if yaku(i) == 18))

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 0
if 135<=n<189:
    ans += 1
elif 189<=n:
    ans += 2

for i in range(2,4):
    for j in range(i+1,6):
        if (2*i-1)*(2*j-1)>n:
            break
        for k in range(j+1,9):
            if (2*i-1)*(2*j-1)*(2*k-1)<=n:
                ans+=1
            else:
                break

print(ans)

Submission status: Wrong Answer

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)
else:
    print(4)

Submission status: Wrong Answer

Solution code:
n = int(input())
count = 0
for i in range(105, n + 1):
    insu = 0
    if i % 2 != 0:
        continue
    for j in range(1, i + 1):
        if i % j == 0:
            insu += 1
    if insu == 8:
        count += 1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# 値の取得
N = int(input())
if N % 2 != 1:
    exit()
res = 0
count = 0
for i in range(1, N + 1, +2):
    if N % i == 0:
        count += 1
if count == 8:
    res = 1
print(res)

Submission status: Wrong Answer

Solution code:
n=int(input())

def yakusu_num(x):
    cnt=0
    for i in range(x):
        if x%(i+1)==0:
            cnt+=1
    return(cnt)

cnt=0
for i in range(-(-105//2)):
  if yakusu_num(2*i+1)==8:
    cnt+=1
  
print(cnt)

Submission status: Wrong Answer

Solution code:
n = int(input())
d = {i: 0 for i in range(n+1)}
for i in range(1, n+1):
    for j in range(1, n+1):
        if j%i == 0:
            d[j] +=1
for k, v in d.items():
    if k%2 == 1 and v == 8:
        print(k)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = 0
num = 0
for i in range (1, n+1, 2):
  #print(n+1)
  for j in range (1, i+1):
    if i%j == 0:
      ans += 1
    if ans == 8:
      num += 1
print(num)

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range (1, n+1, 2):
  #print(n+1)
  ans = 0
  num = 0
  for j in range (1, i+1):
    if i%j == 0:
      ans += 1
    if ans == 8:
      num += 1
print(num)

Submission status: Wrong Answer

Solution code:
n = 200
cnt = [0 for _ in range(n+1)]
for i in range(1, n+1):
  for j in range(i, n+1, i):
    cnt[j] += 1
print(len([i for i in range(1,n+1, 2) if cnt[i]==8]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range (1, n, 2):
  #print(n+1)
  ans = 0
  num = 0
  for j in range (1, i+1):
    if i%j == 0:
      ans += 1
    if ans == 8:
      num += 1
print(num)

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range (1, n+1, 2):
  print(n+1)
  ans = 0
  num = 0
  for j in range (1, i+1):
    if i%j == 0:
      ans += 1
    if ans == 8:
      num += 1
print(num)

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range (1, n+1, 2):
  ans = 0
  num = 0
  for j in range (1, i+1):
    if i%j == 0:
      ans += 1
    if ans == 8:
      num += 1
print(num)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = 0
for i in range (1, n+1, 2):
  #print(i)
  if n%i == 0:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 0
ans = 0

for j in range(N + 1):
    if j == 0:
        continue
    for i in range(j):
        if i == 0:
            continue
        if N % i == 0:
            count += 1
        if count == 8:
            ans += 1
            break
else:
        print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 0
ans = 0

for i in range(N + 1):
    if i == 0:
        continue
    if N % i == 0:
        count += 1
    if count == 8:
        ans += 1
else:
    print(ans)

Submission status: Wrong Answer

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

for i in range(N):
    if i == 0:
        continue
    if N % i == 0:
        count += 1
else:
    ans = int(count / 8)
    print(ans)

Submission status: Wrong Answer

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

for i in range(N):
    if i == 0:
        continue
    if N % i == 0:
        count += 1
else:
    ans = int(count / 6)
    print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
num = 0
count = 0

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

print(num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
x=0
y=0
for i in range(1,N+1):
    for j in range (1,i+1):        
        if i%j==0:
            if i%2!=0:
                x+=1 
                if x==8:
                    y+=1
                    if x==9:
                        y-=1
            else:
                x+=0            
        else:
            x+=0      
print(y)

Submission status: Wrong Answer

Solution code:
N=int(input())
x=0
y=0
for i in range(1,N+1):
    if N%i==0:
        if N%2!=0:
            x+=1
            if x==8:
                y+=1
            if x==9:
                y-=1
            else:
                y+=0
        else:
            x+=0
            y+=0
    else:
        x+=0
        y+=0
print(y)

Submission status: Wrong Answer

Solution code:
N=int(input())
x=0
y=0
for i in range(1,N+1):
    if N%i==0:
        if N%2!=0:
            x+=1
            if x==8:
                y+=1
            else:
                y+=0
        else:
            x+=0
    else:
        x+=0
print(y)

Submission status: Wrong Answer

Solution code:
N = int(input())

cnt = 0
for i in range(1, N + 1):
    if i % 2 != 0:
        divisor = 0
        for j in range(1, i + 1):
            if N % j == 0:
                divisor += 1
        if divisor == 8:
            cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())

cnt = 0
for i in list(filter(lambda x: x % 2 != 1, range(1, N + 1))):
    divisor = 0
    for j in range(1, i + 1):
        if N % j == 0:
            divisor += 1
    if divisor == 8:
        cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())

cnt = 0
for i in range(1, N + 1):
    divisor = 0
    for j in range(1, i + 1):
        if N % j == 0:
            divisor += 1
    if divisor == 8:
        cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
import sys
import string
input=sys.stdin.readline

n=int(input())
if n<105:
    print(0)
elif n<165:
    print(1)
elif n<195:
    print(2)
else:
    print(3)

Submission status: Wrong Answer

Solution code:
import math

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

    prime_list = [i for i in range(num+1)]
    prime_list[1] = 0
    num_sqrt = math.sqrt(num)

    #素数ではないものを0にしていく
    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]

N = int(input())
count = 0

for i in range(1,N+1):
    if i%2 == 1:
        prime_list = make_prime_list(i)
        length = len(prime_list)
        if length == 8:
            count+=1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

count = 0
c = 0

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

print(c)

Submission status: Wrong Answer

Solution code:
def _105(n):
    b = 0
    for i in range(105, n + 1, 2):
        ii = i
        l = []
        for j in range(2, i + 1):
            while True:
                if ii % j == 0:
                    l += [j]
                    ii /= j
                else:
                    break
        if len(l) != 3:
            continue
        if len(set(l)) != 3:
            continue
        b += 1
    return b

print(_105(int(input())))

Submission status: Wrong Answer

Solution code:
d=[105,3*5*9,3*5*11,3*5*5*5,27*7]
n=int(input())
ans=0
for i in range(len(d)):
  if d[i]<=n:
    ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
if N<105:
    print(0)
elif N<107:
    print(1)
else:
    ans = 1
    for i in range(107,N,2):
        div = 0
        if i%2==0:
            continue
        for j in range(1,i+1):
            if i%j==0:
                div += 1
        if div==8:
            ans += 1
    print(ans)

Submission status: Wrong Answer

Solution code:
def factorize(n):
  factors=[1]
  i=2
  while n>1:
    if n%i==0:
      factors.append(i)
    if i==n:
      break
    else:
      i+=1
  return factors
      
n=int(input())
nums=[]
for i in range(1,n+1):
  if i%2==1:
    if len(factorize(i))==8:
      nums.append(i)
      print(i)
print(len(nums))

Submission status: Wrong Answer

Solution code:
def factorize(n):
  factors=[1]
  i=2
  while n>1:
    if n%i==0:
      factors.append(i)
    if i==n:
      break
    else:
      i+=1
  return factors
      
n=int(input())
nums=[]
for i in range(1,n+1):
  if len(factorize(i))==8:
  	nums.append(i)
print(len(nums))

Submission status: Wrong Answer

Solution code:
def factorize(n):
  if n==1:
    return [1]
  i=2
  factors=[1]
  while True:
    if n%i==0:
      factors.append(i)
    if i==n:
      break
    else:
      i+=1
  return factors
      
n=int(input())
nums=[]
for i in range(1,n+1):
  if len(factorize(i))==8:
  	nums.append(i)
print(len(nums))

Submission status: Wrong Answer

Solution code:
N = int(input())
x = [i for i in range(1,N+1) if i%2!=0]
z = []
for i in x:
  y = 0
  for j in range(1,N+1):
    if i % j == 0:
      y += 1
    if y == 8:
      z.append(i)
print(len(z))

Submission status: Wrong Answer

Solution code:
import collections

N = int(input())
count = 0

for k in range(1,N+1):
    # 初期化
    num = []
    n = k
    if(n % 2 == 0):
        continue

    for i in range(2,k+1):
        if n % i == 0:
            n = int(n // i)
            num.append(i)


    num_counter = collections.Counter(num)
    print(num_counter)
    ans = 1
    for value in num_counter.values():
        ans *= value+1

    if(ans == 8):
        count += 1



print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
if n<105:print(0)
elif n<3*5*9:print(1)
elif n<3*5*11:print(2)
elif n<3*5*13:print(3)
else:print(4)

Submission status: Wrong Answer

Solution code:
n=int(input())
if n<105:print(0)
elif n<3*5*9:print(1)
elif n<3*5*11:print(2)
else:print(3)

Submission status: Wrong Answer

Solution code:
n=int(input())
if n<=105:print(0)
elif n<=3*5*7:print(1)
elif n<=3*5*9:print(2)
elif n<=3*5*11:print(3)
else:print(4)

Submission status: Wrong Answer

Solution code:
n=int(input())
if n<105:print(0)
elif n<3*5*7:print(1)
elif n<3*5*9:print(2)
elif n<3*5*11:print(3)
else:print(4)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
if n<105:
    print(0)
elif 105<=n and n<135:
    print(1)
elif 135<=n and n<175:
    print(2)
elif 175<=n and n<189:
    print(3)
else:
    print(4)

Submission status: Wrong Answer

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

result = 0

for i in range(1,n+2,2):
    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: Wrong Answer

Solution code:
n = int(input())

result = 0

for i in range(1,n+2,2):
    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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=input()
if N==105:
   print(1)
else:
   print(0)

Submission status: Wrong Answer

Solution code:
n = int(input())
c = 0
plist = []
for i in range(2,n+1):
  if i%2 == 0 : continue
  if i*3*5 > n : break
  for j in range(2,i):
    if i % j == 0 : break
  else:
    plist.append(i)
for i in range(len(plist)-2):
  for j in range(i+1,len(plist)-1):
    for k in range(j+1,len(plist)):
      if plist[i]*plist[j]*plist[k] <= n : c += 1
      else: break
print(c)

Submission status: Wrong Answer

Solution code:
N = int(input())
x = 1
count = 0

while x <= N:
  a = 0
  k = 1
  while k <= N:
    if N%k == 0:
      a += 1
    k += 2
  if a == 8:
    count += 1
  x += 2

print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
x = 1
count = 0
while x < N:
  a = 0
  k = 1
  while k < N:
    if N%k == 0:
      a += 1
    k += 2
  if a == 8:
    count += 1
  x += 2

print(count)

Submission status: Wrong Answer

Solution code:
N=int(input())
count=1
if N<105:
    print(0)
else:
    for i in range(107,N+1,2):
        if i%2==1:
            c=0
            for j in range(1,i+1,2):
                if i%j==0:
                    c+=1
            if c==8:
                count+=1
print(count)

Submission status: Wrong Answer

Solution code:
N=int(input())
a=[1,3,5,7,11,13,17,19,23,29]
i,j,k,l=0,1,2,3
s=a[i]*a[j]*a[k]*a[l]
c=0
while s<=N:
    
    if c%4==0:
        l+=1
    elif c%4==1:
        k+=1
    elif c%4==2:
        j+=1
    elif i%4==3:
        i+=1
    s=a[i]*a[j]*a[k]*a[l]
    c+=1
    
print(c)

Submission status: Wrong Answer

Solution code:
n=int(input())
if n<104:print(0)
elif n<134:print(1)
elif n<164:print(2)
elif n<188:print(3)
elif n<194:print(4)
else:print(5)

Submission status: Wrong Answer

Solution code:
n=int(input())
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: Wrong Answer

Solution code:
N = int(input())
ret = 0
if N >= 105:
    ret +=1
if N >= 165:
    ret +=1
if N >= 195:
    ret +=1

print (ret)

Submission status: Wrong Answer

Solution code:
divisors_8 = [105]

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: Wrong Answer

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

	if n <= 104:
		print(0)
	elif n <= 164:
		print(1)
	else:
		print(2)


if __name__ == '__main__':
	main()

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(n):
    listc = []
    for i in range(1,201):
        lista = []
        for j in range(1,201):
            if i%j == 0:
                lista.append(j)
        if len(lista) >= 8 and lista[-1] %2 != 0:
            listc.append(lista[-1])
    #print(listc)#デバッグ用
    for i in range(len(listc)):
        if n < listc[i]:
            return 0
        elif n >= listc[-(i+1)]:
            return len(listc)-i

# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
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: Wrong Answer

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(n):
    listc = []
    for i in range(1,201):
        lista = []
        for j in range(1,201):
            if i%j == 0:
                lista.append(j)
        if len(lista) >= 8 and lista[-1] %2 != 0:
            listc.append(lista[-1])
    #print(listc)#デバッグ用
    for i in range(len(listc)):
        if n >= listc[-(i+1)]:
            return len(listc)-i
solve(200)

# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
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: Wrong Answer

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(n):
    listb = []
    listc = []
    for i in range(1,201):
        lista = []
        for j in range(1,201):
            if i%j == 0:
                lista.append(j)
        if len(lista) >= 8 and lista[-1] %2 != 0:
            listb.append(lista)
            listc.append(lista[-1])
    if n in listc:
        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: Wrong Answer

Solution code:
import sys

# 関数 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: Wrong Answer

Solution code:
import sys

# 関数 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: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
if n<105:
	print('0')
else:
	if n<135:
		print('1')
	else:
		if n<165:
			print('2')
		else:
			if n<189:
				print('3')
			else:
				print('4')

Submission status: Wrong Answer

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)
else:
  print(4)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
if n < 105:
  print(0)
elif n < 135:
  print(1)
else:
  print(2)

Submission status: Wrong Answer

Solution code:
import sys
 
# 関数 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)
    if a == 8 and N%2 == 1 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: Wrong Answer

Solution code:
import sys
 
# 関数 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)
    if a == 8 and N%2 == 1:
        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: Wrong Answer

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

    prime = []
    isPrime = [True for i in range(201)]
    isPrime[0] = isPrime[1] = False
    for i in range(2, 201):
        if(isPrime[i]):
            prime.append(i)
            for j in range(2 * i, 201, i):
                isPrime[j] = False

    ans = 0
    for a in range(105, N + 1):
        cnt = []
        num = a
        for i in range(len(prime)):
            divCnt = 0
            while(num % prime[i] == 0):
                num //= prime[i]
                divCnt += 1
            if(divCnt > 0):
                cnt.append(divCnt)
        divisorCnt = 1
        for i in range(len(cnt)):
            divisorCnt *= cnt[i] + 1
        if(divisorCnt == 8):
            ans += 1
    print(ans)

if __name__ == '__main__':
    func()

Submission status: Wrong Answer

Solution code:
N = int(input())
for i in range(1,N+1):
	count1 = 0
	count2 = 0
	for j in range(1, N+1):
		if i % j == 0:
			count1 = count1 + 1
	if i % 2 == 1 and count1 == 8:
		count2 = count2 + 1
		print(str(count2))

Submission status: Wrong Answer

Solution code:
for i in range(1,201):
	count = 0
	for j in range(1, 201):
		if i % j == 0:
			count = count + 1
	if i % 2 == 1 and count == 8:
		print(str(i))

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in range(1,N+1):
	count = 0
	for j in range(1, N+1):
		if i % j == 0:
			count = count + 1
	if i % 2 == 1 and count == 8:
		print(str(i))
	del i

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in range(1,N+1):
	count = 0
	for j in range(1, N+1):
		if i % j == 0:
			count = count + 1
	if i % 2 == 1 and count == 8:
		print(str(i))
		del i

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in range(1,N+1):
	count = 0
	for j in range(1, N+1):
		if i % j == 0:
			count = count + 1
	if i % 2 == 1 and count == 8:
		print(str(i))

Submission status: Wrong Answer

Solution code:
N = int(input())

print("---------------------------")
print(str(N)+"以内約数の数は8となる数字は：")
for i in range(1,N+1):
	count = 0
	for j in range(1, N+1):
		if i % j == 0:
			count = count + 1
	if i % 2 == 1 and count == 8:
		print(str(i))

Submission status: Wrong Answer

Solution code:
inputs=input()
inputs_d =int(inputs)
divisor_c =1
for i in range(1,inputs_d):
    
    temp = inputs_d %i
    if(temp==0):
        divisor_c = divisor_c +1
    
print(divisor_c)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 0
i = 3
while i <= N:
  div = 0
  for j in range(2,i):
    if i % j == 0:
      div += 1
  if div == 8:
    ans += 1
  i += 2
else:
  print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

l = []
for i in range(1,201,2):
    if i%2 == 0 and i%3 == 0 \
    and i%5 == 0 and i%7 == 0 \
    and i%11 == 0 and i%13 == 0 \
    and i%17 == 0 and i%19 == 0:
        print(i)
    else:
        continue

Submission status: Wrong Answer

Solution code:
N = int(input())
odd_8 = [0,105,135,165,189,195,200]
for i in range(6):
    if odd_8[i] <= N < odd_8[i+1]:
        print(i)

Submission status: Wrong Answer

Solution code:
N = int(input())
odd_8 = [0,105,135,165,189,195]
for i in range(5):
    if odd_8[i] <= N < odd_8[i+1]:
        print(i)

Submission status: Wrong Answer

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