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.

Solution (Python):
N = int(input())
ans = 0
for k in range(1,N+1,2):
    c = 0
    for l in range(1,k+1):
        if k%l==0:
            c+=1
    if c == 8:
        ans += 1
print(ans)

Solution (Python):
N = int(input())

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

print(result)

Solution (Python):
n = int(input())

def divisor(n):
    c = 0
    for i in range(1, n+1):
        if n%i == 0:
            c += 1
    return c

ans = 0
for i in range(1, n+1, 2):
    if divisor(i) == 8:
        ans += 1

print(ans)

Solution (Python):
n = int(input())

ans = 0

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

print(ans)

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(10000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]




dp = None


def main():
    N = int(input())
    L = [105, 135, 165, 189, 195]

    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)


main()

Solution (Python):
N = int(input())

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

Solution (Python):
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:
        ans+=1

print(ans)

Solution (Python):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())

N = int(input())
ans = 0
for n in range(1,N+1):
	tmp =0
	if n%2 == 0:
		continue

	for i in range(1,n+1):
		if n%i == 0:
			tmp += 1

	if tmp == 8:
		ans += 1

print(ans)

Solution (Python):
def d(K):
    res=0
    for i in range(1,K+1):
        if K%i==0:
            res+=1
    return res

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

Solution (Python):
N = 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:
    ans += 1
print ans

Solution (Python):
n = int(raw_input())
cnt = 0
for i in range(1, n + 1, 2):
  if len([1 for it in range(1, i + 1) if i % it == 0]) == 8:
    cnt += 1

print cnt

Solution (Python):
def compute_divisors(num):
    divisors = set()
    for i in range(1, int(num**.5) + 1):
        if num % i == 0:
            divisors.add(i)
            divisors.add(num // i)
    return divisors

print(sum(len(compute_divisors(i))==8 for i in range(1,int(input())+1, 2)))