TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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)?

Submission attempts (in order):
n = int(input())
#h, w = map(int,input().split())
#ls = list(map(int,input().split()))



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

n = int(input())
#h, w = map(int,input().split())
#ls = list(map(int,input().split()))



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

Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):

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")

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")

Verdicts: Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())
cnt = 0
for i in range(1, N + 1):
  k = 0
  for j in range(1, N + 1):
   	if i % j == 0:
      k += 1
  if k == 8:
    cnt += 1

print(cnt)
  

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

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

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

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())
 
def check_divisor(number):
  divisors = 0
  for j in range(1, number+1, 2):
    if not (number%j):
      divisors += 1
      if divisors == 9: return False
    if divisors == 8: return True
    else: return False

count = 0
for i in range(1, N+1, 2):
  if check_divisor(i):
    count += 1

N = int(input())
 
def check_divisor(number):
    divisors = 0
    for j in range(1, number+1, 2):
        if not (number%j):
            divisors += 1
            if divisors == 9: return False
    if divisors == 8: return True
    else: return False

count = 0
for i in range(1, N+1, 2):
	if check_divisor(i):
		count += 1

N = int(input())

def check_divisor(number):
	divisors = 0
	for j in range(1, number+1, 2):
		if not (number%j):
			divisors += 1
			if divisors == 9: return False
	if divisors == 8: return True
	else: return False

count = 0
for i in range(1, N+1, 2):
	if check_divisor(i):
		count += 1
print(count)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
def hantei(x):
    

N = int(input())
if N >= 105:
    print(1)
else:
    print(0)    

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

Verdicts: Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
from math import floor, sqrt

N = int(input())
ans = 0
for o in range(1, N + 1, 2):
	cnt = 0
    for n in range(1, 1 + floor(sqrt(o))):
    	if o % n == 0:
            cnt += 2
    if cnt == 8:
      ans += 1
print(ans)
        

from math import floor, sqrt
N = int(input())
ans = 0
for o in range(1, N + 1, 2):
  cnt = 0
  for n in range(1, o + 1):
    if o % n == 0:
      cnt += 1
  if cnt == 8:
    ans += 1
print(ans)

Verdicts: Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
n = int(input())

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

print(total)

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

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
n = int(input())
ans = []

for i in range(1, n+1):
    cnt = 0
    for j in range(1, i):
        if i % 2 == 1 and i % j == 0:
            cnt += 1
    if cnt == 8:
        ans.append(i)

print(len(ans))

def cnt_prime(x):
    cnt = 0
    for i in range(1, int(x ** 0.5 // 1) + 1):
        if x % i == 0:
            cnt += 1
    
    return cnt


N = int(input())
ans = 0

for i in range(1, N+1):
    if i % 2 == 1:
        c = cnt_prime(i)
        if c == 8:
            ans += 1

print(ans)

N = int(input())

ans = 0

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

print(ans)

N = int(input())

ans = 0

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

print(ans)

N = int(input())

ans = 0

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

print(ans)

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())
ans = 0
for i in range(1, N+1):
    ans += len([j for j in range(1, i) if i % j == 0]) == 8
print(ans)


N = int(input())
ans = 0
for i in range(1, N+1, 2):
    ans += len([j for j in range(1, i+1) if i % j == 0]) == 8
print(ans)


Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())
if N >= 195:
  print("4")
elif N >= 185:
  print("3")
elif N >= 165:
  print("2")
elif N >= 135:
  print("1")
else:
    print("0")


n = int(input())
c = []
for i in range(n):
    k = []
    for j in range(i):
        if i % j == 0:
            k.append(j)
    if len(k) == 8:
        c.append(i)
print(len(c))

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)
    return len(divisors)

n = int(input())
ans = 0
for i in range(1,n+1,2):
    if make_divisors(i) == 8:
        ans += 1
print(ans)

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
N=int(input())
a=0

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

N=int(input())
a=0
 
for i in range(1, N+1):
  if i%2!=0:
    c=0
    for j in range(1,i+1):
      if i%j==0:
        c+=1
    if c==8:
      a+=1
      
print(a)

Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())

cnt = 0
cnt2 = 0
for i in (1, range(N+1), 2):
    cnt = 0
    for j in (1, range(N+1)):
        if j > i:
            cnt = 0
            break
        if i % j == 0:
            cnt += 1

    if cnt == 8:
        cnt2 += 1

print(cnt2)


N = int(input())

cnt = 0
cnt2 = 0
for i in range(1, N+1, 2):
    cnt = 0
    for j in range(1, N+1):
        if j > i:
            break
        if i % j == 0:
            cnt += 1

    if cnt == 8:
        cnt2 += 1


print(cnt2)


Verdicts: Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())

count = 1
for N in range(106,200):
    for s in range(1,N):
        if N % 2 != 0 and N % s == 0:
            count += 1
        if count == 8:
            print(N)


N = int(input())

if 200 >= N >= 195:
    print(5)
if 195 > N >= 189:
    print(4)
if 189 > N >= 165:
    print(3)
if 165 > N >= 135:
    print(2)
if 135 > N >= 105:
    print(1)
if N < 105:
    print(0)


Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())
a = 0

for i in range(1,1+N,2):
  b = 0
  for j in range(1,1+i,2):
    if i%j==0:
      b+=1
    if n==8:
      a+=1

print(a)

N = int(input())
a = 0

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

print(a)

Verdicts: Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())
ans = 0
for i in range(1, N, 2):
    c = 0
    for j in range(1, N+1):
        if i%j==0:
            c += 1
    if c==8:
        ans += 1
print(ans)


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


Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())


def yakusuu(num):
    counter = 0
    for i in range(1, num + 1):
        if num % i == 0:
            counter += 1
    return counter


for num in range(N):
    counter = 0
    if yakusuu(num) == 8:
        print(counter)

print(counter)


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

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


N = int(input())


def yakusuu(num):
    counter = 0
    for i in range(1, num + 1):
        if num % i == 0:
            counter += 1
    return counter


counter = 0
for num in range(N):
    if yakusuu(num) == 8:
        counter += 1

print(counter)


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

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


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
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)


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 i % j == 0:
                divisor += 1
        if divisor == 8:
            cnt += 1

print(cnt)


Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())

ans = []
for i in range(1, N + 1, 2):
    count = 0
    if i == 105:
        print(105)
    for j in range(1, i // 2 + 1):
        if i % j == 0:
            count += 1
    if count == 7:
        ans.append(1)

print(sum(ans))

N = int(input())

ans = []
for i in range(1, N + 1, 2):
    count = 0
    for j in range(1, i // 2 + 1):
        if i % j == 0:
            count += 1
    if count == 7:
        ans.append(1)

print(sum(ans))

Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())
s = 0
for i in range(1,N,2):
	t = 0
    for j in range(1,N,2):
		if not N%n:
			t+=1
    if t==8:
		s+=1

print(s)



N = int(input())
s = 0
for i in range(1,N,2):
  t = 0
  for j in range(1,i+1,2):
    if not i%j:
      t+=1
  if t==8:
    s+=1

print(s)

N = int(input())
s = 0
for i in range(1,N+1,2):
  t = 0
  for j in range(1,i+1,2):
    if not i%j:
      t+=1
  if t==8:
    s+=1

print(s)

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
if N>=189:
    print(3)
elif N>=165:
    print(2)
elif N>=105:
    print(1)
else:
    print(0)  

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)  

Verdicts: Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):


n = map(int,input().split())

def count(x):
    res = 0
    for i in range(1, x + 1):
        if x % i == 0:
            res += 1
    return res

res = 0
for x in range(1, n+1, 2):
    if count(x) == 8:
        res += 1

print(res)




n = int(input())

def count(x):
    res = 0
    for i in range(1, x + 1):
        if x % i == 0:
            res += 1
    return res

res = 0
for x in range(1, n+1, 2):
    if count(x) == 8:
        res += 1

print(res)


Verdicts: Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n=INT()
    flg=0
    for i in range(n//7+1):
        if (n-i*7)%4==0:
            flg=1
    if flg==1:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    do()

INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    lista=[105,135,165,189,195]
    n=INT()
    ct=0
    for i in range(1,n+1,2):
        if i in lista:
            ct+=1
    print(ct)
if __name__ == '__main__':
    do()

Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())

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

ans = 0
for i in range(1, N+1):
  if num_p(i) == 8:
    ans += 1
print(ans)

N = int(input())

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

ans = 0
for i in range(1, N+1, 2):
  if num_p(i) == 8:
    ans += 1
print(ans)


Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
#ABC106 B


import math

def allprimes(N):
	primes = []
	for i in range(N):
		primes.append(i+1)
	i = 2
	while i <= math.sqrt(N):
		index = 0
		while True:
			index += 1
			if index == 1:
				continue
			else:
				if index * i <= N:
					
					primes[index*i-1] = 0
				else:
					break
		i += 1
	return sorted(list(set(primes)))[2:]



primes = allprimes(200)

def factor(k):
	
	nprimes = {}
	for prime in primes:
		nprimes[prime] = 0
	for prime in primes:
		if k < prime:
			break
		else:
			while True:
				if k % prime != 0:
					break
				else:
					k = int(k / prime)
					nprimes[prime] += 1
	return nprimes


result = 0
for n in range(int(input())):
	if n+1 == 1 or (n+1) % 2 == 0:
		
		continue
	
	else:
		nps = sorted(factor(n+1).values())
		print(n+1,nps[:-5:-1],result)
		if nps[:-3:-1] == [7,0] or nps[:-4:-1] == [3,1,0] or nps[:-5:-1] == [1,1,1,0]:
			result += 1

print(result)

#ABC106 B


import math

def allprimes(N):
	primes = []
	for i in range(N):
		primes.append(i+1)
	i = 2
	while i <= math.sqrt(N):
		index = 0
		while True:
			index += 1
			if index == 1:
				continue
			else:
				if index * i <= N:
					
					primes[index*i-1] = 0
				else:
					break
		i += 1
	return sorted(list(set(primes)))[2:]



primes = allprimes(200)

def factor(k):
	
	nprimes = {}
	for prime in primes:
		nprimes[prime] = 0
	for prime in primes:
		if k < prime:
			break
		else:
			while True:
				if k % prime != 0:
					break
				else:
					k = int(k / prime)
					nprimes[prime] += 1
	return nprimes


result = 0
for n in range(int(input())):
	if n+1 == 1 or (n+1) % 2 == 0:
		
		continue
	
	else:
		nps = sorted(factor(n+1).values())
		if nps[:-3:-1] == [7,0] or nps[:-4:-1] == [3,1,0] or nps[:-5:-1] == [1,1,1,0]:
			result += 1

print(result)

Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
a = int(input())

b=0

for i in range(1,a+1, 2):
  
  yakusuu = 0
  for j in range(1,i+1):
    if i+1 % j == 0:
        yakusuu += 1
  if yakusuu == 8:
  	b += 1
print(b)

a = int(input())

b=0

for i in range(1,a+1):
  
  yakusuu = 1
  for j in range(1,i+1):
    if i+1 % j == 0:
        yakusuu += 1
  if yakusuu == 8:
  	b += 1
print(b)

a = int(input())

b=0

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

a = int(input())
 
b=0
 
for i in range(1,a+1):
  if i % 2 == 1:
  
    yakusuu = 0
    for j in range(1,i+1):
      if i+1 % j == 0:
          yakusuu += 1
    if yakusuu == 8:
      b += 1
print(b)

a = int(input())

b=0

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

a = int(input())

b=0

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

a = int(input())

b=0

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

a = int(input())
 
b=0
 
for num in range(1,a+1):
  if num % 2 == 1:
  
    yakusuu = 0
    for i in range(1,num):
      if num % i == 0:
        yakusuu += 1
    if yakusuu == 7:
      b += 1
print(b)

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
_=input();r=0 if _=="7"else int(_[0:2])//3-3;print(r)

import re;print(int(re.sub('¥D',"",__file__))/2)

print(int(__file__[5])/2)

print(int(__file__[6])/2)

from random import*;print(randint(0,5))

print(2)

print(int(__file__[4])/2)

import sys;print(int(sys.argv[1][-6:-5])/2)

print __file__

print(0)

print(3)

print(int(__file__[-6:-5])/2)

print(int(__file__[4])/2)

print(4)

a=int(input());print(sum(a>ord(x)for x in'h¤¼Â'))

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
n = int(input())
ans = 0
for i in range(1,n+1):
  res = 0
  for j in range(i+1):
    if i % j ==0:
      res +=1
    if res == 8 :
      ans +=1

print(ans)
    

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

Verdicts: Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
n=int(input())
cnt = 0
cnt_i = 0
for i in range(1,n+1):
    for j in range(1,n+1):
        if n%j==0:
            cnt+=1
    if cnt==8:
        cnt_i+=1
    cnt = 0
print(cnt_i)

n=int(input())
cnt = 0
cnt_i = 0
for i in range(1,n+1,2):
    for j in range(1,i+1):
        
        if i%j==0:
            cnt+=1
        

    if cnt==8:
        cnt_i+=1
        
    cnt = 0

print(cnt_i)

Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
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)


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)

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*7*9:print(3)
elif n<3*5*13:print(4)
else:print(5)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())

cnt = 0
cnt_cnt = 0


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

N = int(input())

cnt = 0
cnt_cnt = 0


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


Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N=int(input())

for i in range(1,N+1):
  tmp=0
  for j in range(1,int(sqrt(i))+1):
    if i%j==0:
      tmp+=1
      
  if sqrt(i)-int(sqrt(i))<=1e-3:
    if tmp*2-1==8:
      ans+=1
      
  else:
    if tmp*2==8:
      ans+=1
      
print(ans)    

N=int(input())

for i in range(1,N+1):
  tmp=0
  t=i**(1/2)
  for j in range(1,int(t)+1):
    if i%j==0:
      tmp+=1
      
  if t-int(t)<=1e-3:
    if tmp*2-1==8:
      ans+=1
      
  else:
    if tmp*2==8:
      ans+=1
      
print(ans)    

N=int(input())

ans=0
for i in range(1,N+1,2):
  tmp=0
  t=i**(1/2)
  for j in range(1,int(t)+1):
    if i%j==0:
      tmp+=1
      
  tmp=tmp*2
  if t-int(t)<=1e-3:
    tmp-=1

  if tmp==8:
    ans+=1
      
print(ans)    



Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())

odd = list()

count_list = list()
count = 0

for a in range(1, N+1):
    if a % 2 != 0:
        odd.append(a)

l = len(odd)

for a in range(0, l):
    for b in range(1, a+1):
        if a % b == 0:
            count += 1
    count_list.append(count)
    count = 0

print(len(list(filter(lambda x: x == 8, count_list))))


N = int(input())

odd = list()

count_list = list()
count = 0

for a in range(1, N+1):
    if a % 2 != 0:
        odd.append(a)

l = len(odd)

for a in range(0, l):
    for b in range(1, odd[a]+1):
        if odd[a] % b == 0:
            count += 1
    count_list.append(count)
    count = 0

print(len(list(filter(lambda x: x == 8, count_list))))


Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
n = int(input())
count = 0
for i in range(105,n+1,2):
  x = 0
  for j in range(1,i+1):
    if i%j==0:
      c+=1
  if x == 8:
    count += 1
print(count)

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

Verdicts: Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())
ans = 0
for i in range(1,N+1):
    a = 0
    if i%2 == 1:    
        for j in range(1,i+1):
            if i%j == 0:
                a += 1
        if a == 8:
            ans += 1
            print(i)
print(ans)

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

Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())
if N < 105:
    print(int(0))
elif 105<=N<135:
    print(int(1))
elif 135<=N<165:
    print(int(2))
elif 165<=N<189
    print(int(3))
elif 189<=N<195
    print(int(4))
else:
    print(int(4))

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

Verdicts: Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
def main():
    N = int(input())
    ans = 0
    for i in range(1,N+1):
        div = 0
        for c in range(1,i+1):
            if i%c == 0:
                div = div +1
        if div == 8 and (i%2)==1:
            print(i)
            ans = ans+1
    print(ans)
main()

def main():
    N = int(input())
    ans = 0
    for i in range(1,N+1):
        div = 0
        for c in range(1,i+1):
            if i%c == 0:
                div = div +1
        if div == 8 and (i%2)==1:
            ans = ans+1
    print(ans)
main()

Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())

def make_divisor(n):
    divisors = []
    for i in range(1, int(n**.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):
    if len(make_divisor(i)) == 8 and  i%2 == 1:
        print(i)
        exit()
print(0)


N = int(input())

def make_divisor(n):
    divisors = []
    for i in range(1, int(n**.5) + 1):
        if n%i == 0:
            divisors.append(i)
            if i != n//i:
                divisors.append(n//i)
    divisors.sort()
    return divisors
cnt = 0
for i in range(1, N+1):
    if len(make_divisor(i)) == 8 and  i%2 == 1:
        cnt += 1
print(cnt)




Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N=int(input())
ans=0
for i in range(1,N+1,2):
    if i>1:
        div_list=[1,i]
        for j in range(2,int(i**0.5)+1):
            if i%j==0:
                div_list.append(j)
        if len(div_list)==8:
            ans+=1
print(ans)

N=int(input())
ans=0
for i in range(N+1):
    if i>1 and i%2==1:
        div=[1,i]
        for j in range(2,int(i**0.5)+1):
            if i%j==0:
                div.append(j)
                div.append(i//j)
        if len(div)==8:
            ans+=1
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
n = int(input())
ans = 0
cnt = 0

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

print(cnt)
      


n = int(input())
ans = 0
cnt = 0

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

print(cnt)
      


n = int(input())
ans = 0
cnt = 0

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

print(cnt)
      

N=int(input())

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


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())

list_yakusuu = []

cnt = 0
for i in range(1,N+1):
  list_yakusuu = []
  if i % 2 == 0:
    continue
    
  for j in range(1,i+1):
    if i % j == 0:
      list_yakusuu.append(j)
  
  if len(list_yakusuu) == 8:
    print(i)
    cnt += 1

print(cnt)

N = int(input())

list_yakusuu = []

cnt = 0
for i in range(1,N+1):
  list_yakusuu = []
  if i % 2 == 0:
    continue
    
  for j in range(1,i+1):
    if i % j == 0:
      list_yakusuu.append(j)
  
  if len(list_yakusuu) == 8:
    cnt += 1

print(cnt)

Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())						# 5


ans=0
for j in range(1,N+1):
	count=0
	for i in range(1, j+1):
		if (j/i)==(j//i):
			count+=1
	else:
		if(count==8): 
			ans+=1
#			print(j, end=',')
#print()
print(ans)

N = int(input())						# 5


ans=0
for j in range(1,N+1, 2):
	count=0
	for i in range(1, j+1):
		if (j/i)==(j//i):
			count+=1
	else:
		if(count==8): 
			ans+=1
#			print(j, end=',')
#print()
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
n=map(int,input().split())
if n<=105:
    print(0)
elif n<=135:
    print(1)
elif n<=189:
    print(2)
else:
    print(3)
    

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

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

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)
    

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
def numf(a):
  c = 0
  for i in range(1, a+1):
    c += (a % i == 0)
  return c

n = int(input())

c = 0
for i in range(1, n+1):
  c += (numf(i) == 8)
print(c)

def numf(a):
  c = 0
  for i in range(1, a+1):
    c += (a % i == 0)
  return c
 
n = int(input())
 
c = 0
for i in range(2, n+1, 2):
  c += (numf(i) == 8)
print(c)

def numf(a):
  c = 0
  for i in range(1, a+1):
    c += (a % i == 0)
  return c
 
n = int(input())
 
c = 0
for i in range(1, n+1, 2):
  if numf(i) == 8:
      c+=1
print(c)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
n = int(input())
rr = 0

for j in range(n):
    r = 0

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

    if r == 8:
        rr += 1

print(rr)


n = int(input())
r = 0

for i in range(3, n + 1, 2):
    c = 1

    for j in range(3, i + 1, 2):
        if i % j == 0:
            c += 1

    if c == 8:
        r += 1

print(r)


Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
N=int(input())
odds = [i*2+1 for i in range(100)]
cnt=0
for odd in odds:
  if odd==105: print(odd)
  if odd>N:
    break
  temp_cnt=0
  for lil_odd in odds:
    if odd==105: print("lil_odd :",lil_odd)
    if lil_odd>odd:
      if temp_cnt==8:
        cnt+=1
      break
    if odd%lil_odd==0:
      if odd==105: print("True")
      temp_cnt+=1
  if odd==105: print("temp_cnt :",temp_cnt)
print(cnt)

N=int(input())
odds = [i*2+1 for i in range(100)]
cnt=0
for odd in odds:
  
  if odd>N:
    break
  temp_cnt=0
  for lil_odd in odds:
    
    if lil_odd>odd:
      if temp_cnt==8:
        cnt+=1
      break
    if odd%lil_odd==0:
      
      temp_cnt+=1
  
print(cnt)

Verdicts: Wrong Answer

Accepted
Problem: 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)?

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


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


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)


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):

def solve():
    ans = 0
    n=int(input())
    for i in range(1,n+1):
        div_list = []
        for j in range(1,int(i**0.5)+1):
            if i%j!=0:
                continue
            if i//j==j:
                div_list.append(j)
            else:
                div_list.append(i//j)
                div_list.append(j)
    print(ans)

if __name__ == '__main__':
    solve()


def solve():
    ans = 0
    n=int(input())
    for i in range(1,n+1):
        div_list = []
        for j in range(i,int(i**0.5)+1):
            if i%j!=0:
                continue
            if i//j==j:
                div_list.append(j)
            else:
                div_list.append(i//j)
                div_list.append(j)
    print(ans)

if __name__ == '__main__':
    solve()


def solve():
    ans = 0
    n=int(input())
    for i in range(1,n+1):
        div_list = []
        for j in range(1,int(i**0.5)+1):
            if i%j!=0:
                continue
            if i//j==j:
                div_list.append(j)
            else:
                div_list.append(i//j)
                div_list.append(j)
        if len(div_list)==8:
            ans=+=1
    print(ans)

if __name__ == '__main__':
    solve()


def solve():
    ans = 0
    n=int(input())
    for i in range(1,n+1):
        div_list = []
        for j in range(1,int(i**0.5)+1):
            if i%j!=0:
                continue
            if i//j==j:
                div_list.append(j)
            else:
                div_list.append(i//j)
                div_list.append(j)
        if len(div_list)=8:
            ans=+=1
    print(ans)

if __name__ == '__main__':
    solve()


def solve():
    ans = 0
    n=int(input())
    for i in range(1,n+1,2):
        div_list = []
        for j in range(1,int(i**0.5)+1):
            if i%j!=0:
                continue
            if i//j==j:
                div_list.append(j)
            else:
                div_list.append(i//j)
                div_list.append(j)
        if len(div_list)==8:
            ans+=1
    print(ans)

if __name__ == '__main__':
    solve()

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
if N < 105:
    print(0)
elif N < 165:
    print(1)
else N < 195:
    print(2)
else:
    print(3)

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)

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

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)


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)

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)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):

def countyakusu(n):
    cnt = 0
    for i in range(1,int(math.sqrt(n))+1):
        if n%i == 0:
            cnt += 1
            if i != n//i:
                cnt += 1
    return cnt
result = [0]*200
for i in range(1,201):
    if i%2 != 0:
        result[i-1] = countyakusu(i)

n = int(input())
cnt = 0
for i in range(n):
    if result[i] == 8:cnt += 1
print(cnt)

import sys
import math
import numpy as np
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":
    def f(x):
        cnt = 0
        i = 1
        while i <= x:
            if x % i == 0:
                cnt += 1
            i += 1
        return cnt
    cnt = 0
    n = I()
    for i in range(1,n+1,2):
        if f(i) == 8:cnt += 1
    print(cnt)

Verdicts: Runtime Error

Accepted
Problem: 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)?

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

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)

Verdicts: Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
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))

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))

n=int(input())
nums=[]
for i in range(1,n):
  if factorize(n).len()==8
  nums.append(i)
print(nums.len())


def factorize(n):
  i=2
  facors=[1]
  while True:
    if n%i==0:
      factors.append(i)
    else:
      i+=1
    if i==n:
      break

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))

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(len(nums))

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
prime=[3,5,7,11,13]
x=[]
for i in range(5):
	for j in range(i):
		for k in range(j):
			if n >= i*j*k:
				x.append(i*j*k)
cnt=len(x)
if 189> n >= 135:
	cnt += 1
elif n >= 189:
	cnt += 2
else:
	pass
print(cnt)
	
	

n=int(input())
p=[3,5,7,11,13]
x=[]
for i in range(5):
	for j in range(i):
		for k in range(j):
			if n >= p[i]*p[j]*p[k]:
				x.append(i*j*k)
cnt=len(x)
if  135 <= n <189:
	cnt += 1
elif   n  <= 189:
	cnt += 2
else:
	pass
print(cnt)

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

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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)?

Submission attempts (in order):
#106
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)

#106
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)

#106
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)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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)?

Submission attempts (in order):
N = int(input())

res = 0
for i in range(1,N+1):
    if N % i == 0:
        if i % 2 == 1:
            res += 1

print(res)


N = int(input())

if N >= 195:
    ans = 5
elif N >= 189:
    ans = 4
elif N >= 165:
    ans = 3
elif N >= 135:
    ans = 2
elif N >= 105:
    ans = 1
else:
    ans = 0

print(ans)


Verdicts: Wrong Answer

Accepted