problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03281 | s633853713 | Accepted | 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) |
p03281 | s705208899 | Accepted | n=int(input())
ans=0
for i in range(1,n+1,2):
ct=0
for j in range(1,i+1):
if i%j==0: ct+=1
if ct==8: ans+=1
print(ans)
|
p03281 | s148246686 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1):
if i % 2 == 0:
continue
a = 0
for j in range(1, i+1):
if i % j == 0:
a += 1
if a == 8:
ans += 1
print(ans) |
p03281 | s058895252 | Accepted | c = 0
for i in range(1, int(input())+1):
if not i%2:
continue
if sum(not(i%j) for j in range(1, i+1))==8:
c += 1
print(c) |
p03281 | s436022264 | Accepted | n = int(input())
ans = []
for i in range(1, n+1):
cnt = 0
if i%2==1:
for j in range(1, i+1):
if i%j==0:
cnt += 1
if cnt==8:
ans.append(i)
print(len(ans)) |
p03281 | s319905093 | Accepted | n = int(input())
ans = 0
for i in range(1,n+1,2):
cnt = 0
for j in range(1,i+1):
cnt += (i%j==0)
if cnt==8: ans+=1
print(ans) |
p03281 | s631250853 | Accepted | import math
n=int(input())
count,cnt=0,0
for i in range(1,n+1,2):
for j in range(1,math.ceil(i/2)):
if i%j==0:
count+=1
if count+1==8:
cnt+=1
count=0
print(cnt) |
p03281 | s320476083 | Accepted | 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) |
p03281 | s590970186 | Accepted | n = int(input())
if n < 105:
print(0)
else:
output = 0
for i in range(105,n+1):
if i % 2 == 0:
continue
yaku = 0
for j in range(1,i+1):
if i % j == 0:
yaku += 1
if yaku > 8:
continue
if yaku == 8:
output += 1
print(output) |
p03281 | s362073138 | Accepted | n = int(input())
have_8_divisors = 0
for i in range(1, n + 1):
# 偶数の時はスキップ
if i % 2 == 0:
continue
cnt = 0
for j in range(1, i + 1):
if i % j == 0:
cnt += 1
result = cnt == 8
if result:
have_8_divisors += 1
print(have_8_divisors) |
p03281 | s005747636 | Accepted | def divisor(n):
i = 1
table = []
while i * i <= n:
if n % i == 0:
table.append(i)
table.append(n//i)
i += 1
table = list(set(table))
return table
N = int(input())
total = 0
for n in range(1, N + 1, 2):
if len(divisor(n)) == 8:
total += 1
print(total) |
p03281 | s588076069 | Accepted | n = int(input())
count = 0
for i in range(1, n+1):
if i % 2 == 1:
yaku = 0
for j in range(1, i+1):
if i % j == 0:
yaku += 1
if yaku == 8:
count += 1
print(count) |
p03281 | s233341383 | Accepted | n = int(input())
def divisor(n: int) -> list:
list_of_divisor = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
list_of_divisor.append(i)
if i != n//i:
list_of_divisor.append(n//i)
# list_of_divisor.sort()
return list_of_divisor
ans = 0
for i in range(1, n+1, 2):
li = divisor(i)
if len(li) == 8:
ans += 1
print(ans) |
p03281 | s866512291 | Accepted | 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) |
p03281 | s028060085 | Accepted | 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 divisors
n=int(input())
c=0
for i in range(1,n+1,2):
a=make_divisors(i)
if len(a)==8:
c+=1
print(c) |
p03281 | s465510729 | Accepted | N = int(input())
def get_divisor_num(n):
cnt = 0
for i in range(1, int(n**0.5)+1):
if n % i == 0:
cnt += 1
if n // i != i:
cnt += 1
return cnt
cnt = 0
for i in range(1, N+1, 2):
if get_divisor_num(i) == 8:
cnt += 1
print(cnt)
|
p03281 | s480956652 | Accepted | n = int(input())
ans = 0
for i in range(1, n+1):
stock = 0
for j in range(1, n+1):
if i % j == 0:
stock += 1
if stock == 8 and i % 2:
ans += 1
print(ans) |
p03281 | s035988461 | Accepted | 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:
ans+=1
print(ans)
|
p03281 | s506070745 | Accepted | N = int(input())
ans = 0
for n in range(1, N+1):
cnt = 0
if n%2 == 0:
continue
for yaku in range(1, n+1):
if n%yaku == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) |
p03281 | s693078667 | Accepted | n = int(input())
count = 0
for i in range(1, n + 1, 2):
div = 0
for j in range(1, i + 1):
if i % j == 0:
div += 1
if div == 8:
count += 1
print(count)
|
p03281 | s596885375 | Accepted | def main():
N = int(input())
ans = 0
for num in range(1, N + 1, 2):
cnt = 0
for i in range(1, num + 1, 2):
if num % i == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p03281 | s750890195 | Accepted | N = int(input())
ok_count = 0
for i in range(1, N + 1, 2):
# 約数を8個もつものの数
count = 0
for j in range(1, i + 1):
# print("{}".format(j))
if i % j == 0:
count += 1
if count == 8:
ok_count += 1
print(ok_count)
|
p03281 | s776506056 | Accepted | N = int(input())
ans =[]
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:
ans.append(i)
print(len(ans)) |
p03281 | s012079875 | Accepted | N = int(input())
ans = 0
for i in range(1, N + 1, 2):
mod_count = 0
for j in range(1, i + 1):
if i % j == 0:
mod_count += 1
if mod_count == 8:
ans += 1
print(ans)
|
p03281 | s888634255 | Accepted | import sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
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) |
p03281 | s640422924 | Accepted | n = int(input())
ans = 0
for i in range(1, n + 1, 2):
yakusu = 0
for j in range(1, i + 1):
if i % j == 0:
yakusu += 1
if yakusu == 8:
ans += 1
print(ans) |
p03281 | s512627944 | Accepted | # -*- coding: utf-8 -*-
"""
Created on Tue Mar 31 09:15:46 2020
@author: black
"""
def check(x):
div = [1]
for j in range(1, x):
if (x)%(j+1) == 0:
div.extend([j+1])
return len(div)
N = int(input())
ans = []
for x in range(1, N+1):
if x%2 == 1:
if check(x) == 8:
ans.extend([x])
print(len(ans)) |
p03281 | s856039327 | Accepted | def make_divisors(n):
divisors = []
for i in range(1, int(pow(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())
cnt = 0
for i in range(1, n + 1):
if i % 2 != 0:
res = make_divisors(i)
if res == 8:
cnt += 1
print(cnt)
|
p03281 | s872681116 | Accepted | N = int(input())
ans = 0
for n in range(1, N+1, 2):
c = 0
for i in range(1, n+1):
if n % i == 0:
c += 1
if c == 8:
ans += 1
print(ans) |
p03281 | s593284081 | Accepted | import sys
input = sys.stdin.buffer.readline
#input = sys.stdin.readline
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
def main():
n=II()
li=[105,135,165,189,195]
ans=0
for i in range(n+1):
if i in li:
ans+=1
print(ans)
if __name__ == "__main__":
main()
|
p03281 | s441739435 | Accepted | 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) |
p03281 | s045798083 | Accepted | import math
import itertools
import numpy as np
def div(n):
c = 0
for i in range(1,n+1):
if n % i == 0:
c += 1
return c
def solve():
n = int(input())
ans = 0
for i in range(1,n+1):
if div(i) == 8 and i % 2 == 1:
ans += 1
print(ans)
return 0
if __name__ == "__main__":
solve()
|
p03281 | s676792613 | Accepted | n = int(input())
y = 0
for i in range(1, n+1, 2):
x = 0
for j in range(1, i+1):
if i % j == 0:
x += 1
if x == 8:
y += 1
print(y) |
p03281 | s279803920 | Accepted | def yakusuu(n):
cnt = 0
for i in range(1,n+1):
if n % i == 0:
cnt += 1
return cnt
N = int(input())
ans = 0
for i in range(1,N+1):
if i % 2 != 0:
if yakusuu(i) == 8:
ans += 1
print(ans)
|
p03281 | s137946489 | Accepted | import sys
import itertools
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(read())
ans = 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:
ans += 1
print(ans) |
p03281 | s696383184 | Accepted | n = int(input().strip())
ans = 0
for i in range(1, (n + 1), 2):
cnt = 0
for j in range(1, (i + 1), 1):
if (i % j == 0):
cnt += 1
if cnt == 8:
ans += 1
print(ans)
|
p03281 | s884552671 | Accepted | # B - 105
N = int(input())
ans = 0
for i in range(1,N+1,2):
tmp = 0
for j in range(1, i+1):
if i%j==0:
tmp += 1
if tmp==8:
ans += 1
print(ans) |
p03281 | s265970099 | Accepted | N = int(input())
if N < 105:
print(0)
exit()
ans = 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:
ans += 1
print(ans) |
p03281 | s858608429 | Accepted | N= int(input())
if N%2==0:
cand = list(range(1,N,2))
else:
cand = list(range(1,N+1,2))
ans = 0
num = 0
for n in range(1,N+1):
num = 0
for c in cand:
if n%c==0:
num+=1
if num ==8:
ans+=1
print(ans)
|
p03281 | s323556770 | Accepted | n = int(input())
ans = 0
for i in range(1, n+1):
if i%2 == 0:
continue
cnt = 0
for j in range(1, i+1):
if i%j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) |
p03281 | s040454324 | Accepted | def divi(x):
d = []
for i in range(1, int(x**0.5)+1):
if x%i == 0:
d.append(i)
if i!=(x//i):
d.append(x//i)
return d
n = int(input())
ans = 0
for j in range(1, n+1, 2):
if len(divi(j)) == 8:
ans += 1
print(ans) |
p03281 | s047566936 | Accepted | 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:
ans += 1
print(ans)
|
p03281 | s936768572 | Accepted | def count_div(n):
res = 0
for i in range(1, n + 1):
if n % i == 0:
res += 1
return res
n = int(input())
ans = 0
for i in range(1, n + 1, 2):
if count_div(i) == 8:
ans += 1
print(ans)
|
p03281 | s517156334 | Accepted | n=int(input())
print(sum(i<=n for i in [105,135,165,189,195])) |
p03281 | s282224607 | Accepted | N = int(input())
B = 0
for i in range(N):
A = 0
for j in range(i+1):
if (i+1) % (j+1) == 0:
A += 1
if A == 8 and (i+1) % 2 == 1:
B += 1
print(B) |
p03281 | s878262559 | Accepted | n=int(input())
nm=[0]*(n+1)
for i in range(1,n+1):
for j in range(1,n+1):
if i%j==0:
nm[i]+=1
l=[1 for i in range(1,n+1) if nm[i]==8 and i%2]
print(sum(l))
|
p03281 | s131308463 | Accepted | n = int(input())
lp = []
for i in range(3,int(n//2)+1):
for k in lp:
if i%2 == 0 or i%k == 0:
break
else:
lp.append(i)
ans = 0
for i in (range(n)):
li = []
for k in lp:
tmp = i+1
cnt = 0
while tmp%k == 0:
tmp //= k
cnt += 1
if cnt > 0:
li.append(cnt)
if li in [[1,1,1], [1,3], [3,1], [7]]:
ans += 1
print(ans) |
p03281 | s663651025 | Accepted | N=int(input())
count = 0
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort() #小さい順位欲しいとき
return divisors
for i in range(1,N+1):
if len(make_divisors(i))==8 and i%2==1:
count += 1
print(count)
|
p03281 | s517376685 | Accepted | _=int(input());print(sum(ord(x)<_ for x in "h¤¼Â")) |
p03281 | s230119116 | Accepted | N = int(input())
count_1 = 0
for i in range(1,N+1,2):
count_2 = 0
for j in range(1,i+1,2):
if i % j == 0:
count_2 += 1
if count_2 == 8:
count_1 += 1
print(count_1) |
p03281 | s686534918 | Accepted | n = int(input())
c = 0
for i in range(1,n+1):
cc = 0
if i % 2 == 1:
for j in range(1,i+1):
if i % j == 0:
cc += 1
if cc == 8:
c += 1
print(c)
|
p03281 | s472993883 | Accepted | N=int(input())
[3,5,7,11,13]
A=[105,135,165,189,195]
ans=0
for i in A:
if i <=N:
ans+=1
print(ans) |
p03281 | s818051712 | Accepted | #!/usr/bin/env python3
n = int(input())
ans = 0
for i in range(1, n+1):
if i % 2 == 0:
continue
tmp = 0
for j in range(1, i+1):
if i % j == 0:
tmp += 1
if tmp == 8:
ans += 1
print(ans)
|
p03281 | s487935871 | Accepted | def have_eight_divisor_odd(n):
have_eight_divisor_odd_count = 0
for i in range(1, n+1):
count = 0
if i % 2 == 1:
for j in range(1, i+1):
if i % j == 0:
count += 1
if count == 8:
have_eight_divisor_odd_count += 1
return have_eight_divisor_odd_count
N = int(input())
result = have_eight_divisor_odd(N)
print(result) |
p03281 | s611503627 | Accepted | def make_divisors(n):
ans=0
for i in range(1, int(n**0.5)+1):
if n % i == 0:
ans+=1
if i != n // i:
ans+=1
return ans
n=int(input())
a=0
for i in range(1,n+1,2):
if make_divisors(i)==8:
a+=1
print(a) |
p03281 | s294515015 | Accepted | print(sum(1 for i in range(1, int(input()) + 1) if i % 2 == 1 and sum(1 for j in range(1, i + 1) if i % j == 0) == 8)) |
p03281 | s236449347 | Accepted | N=int(input())
ans=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:
ans+=1
print(ans)
|
p03281 | s246077455 | Accepted | n = int(input())
cnt = 0
for i in range(1, n + 1,2):
temp = 0
j = 1
while j * j <= i:
if i % j == 0:
temp += 1
if j != i // j:
temp += 1
j += 1
if temp == 8:
cnt += 1
print(cnt)
|
p03281 | s411153004 | Accepted | if __name__ == '__main__':
n = int(input())
cnt = 0
ans = 0
for x in range(1,n+1,2):
cnt = 0
for y in range(1,x+1):
if x % y == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans)
|
p03281 | s550430956 | Accepted | n = int(input())
ans = 0
for i in range(1,n + 1):
if i % 2 == 0:
continue
cnt = 0
for j in range(1,i + 1):
if i % j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) |
p03281 | s096502939 | Accepted | n=int(input())
a=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(a) |
p03281 | s369628132 | Accepted | def div(N):
div = set()
for i in range(1, int(N ** 0.5 + 0.5) + 1):
if N % i == 0:
div.add(i)
div.add(N // i)
return len(div)
N = int(input())
ans = 0
for x in range(1, N + 1, 2):
if div(x) == 8:
ans += 1
print(ans) |
p03281 | s275139260 | Accepted | n = int(input())
ans = 0
for i in range(1, n + 1):
if i % 2 == 0:
continue
dividors = []
for j in range(1, n + 1):
if i % j == 0:
dividors.append(j)
if len(dividors) == 8:
ans += 1
print(ans) |
p03281 | s051486434 | Accepted | 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:
ans += 1
print(ans)
|
p03281 | s879156301 | Accepted | 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 divisors
N = int(input())
count = 0
for i in range(1,N+1,2):
if len(make_divisors(i)) == 8:
count += 1
print(count)
|
p03281 | s478183534 | Accepted | def abc106b_105():
n = int(input())
cnt = 0
for i in range(1, n + 1):
if i % 2 == 0: continue
yaku_cnt = 0
for j in range(1, i + 1):
if i % j == 0:
yaku_cnt += 1
if yaku_cnt == 8:
cnt += 1
print(cnt)
abc106b_105()
|
p03281 | s111871259 | Accepted | import bisect,collections,copy,heapq,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
n = I()
cnt = 0
for i in range(1, n+1, 2):
divcnt = 0
for j in range(1, i+1, 2):
if i % j == 0:
divcnt += 1
if divcnt == 8:
cnt += 1
print(cnt) |
p03281 | s724156703 | Accepted | 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) |
p03281 | s783087740 | Accepted | 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())
if n<105:
print(0)
exit()
ans=1
for i in range(106,n+1):
if i%2==0:
continue
l=make_divisors(i)
if len(l)==8:
ans+=1
print(ans)
|
p03281 | s420292576 | Accepted |
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 and i % 2 != 0:
ans += 1
print(ans)
|
p03281 | s729330124 | Accepted | n=int(input())
def divisore(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 divisors
cnt=0
for i in range(1,n+1,2):
l=divisore(i)
if len(l)==8:
cnt+=1
print(cnt) |
p03281 | s916316078 | Accepted | N = int(input())
ans=0
for _ in range(1,N+1,2):
eight=0
for i in range(1,N+1):
if _ % i ==0:
eight +=1
if eight == 8:
ans+=1
print(ans) |
p03281 | s922043894 | Accepted | n = int(input())
ans = 0
for i in range(1, n+1):
count = 0
for j in range(1, i+1):
if i % j == 0:
count += 1
if count == 8 and i%2 != 0:
ans += 1
print(ans) |
p03281 | s817838238 | Accepted |
def yakusu(num):
x=num
count=0
i=0
while (i<num):
i+=1
if (num%i==0):
num=num/i
count+=2
if (num**2==x):
count-=1
return count
n=int(input())
ans=0
for j in range(1,n+1,2):
if (yakusu(j)==8):
ans+=1
print(ans) |
p03281 | s854515315 | Accepted | n = int(input())
ans = 0
for x in range(1, n + 1, 2):
d = 0
for i in range(1, x + 1, 2):
if x % i == 0:
d += 1
if d == 8:
ans += 1
print(ans)
|
p03281 | s387998606 | Accepted | n = int(input())
cnt = 0
for i in range(105,n+1,2):
cnt2 = 0
for j in range(3,i,2):
if i % j == 0:
cnt2 += 1
if cnt2 == 6:
cnt += 1
print (cnt) |
p03281 | s999714310 | Accepted | n=int(input())
cnt=0
i=1
while i<=n:
c=0
for j in range(1,i+1):
if i%j==0:
c+=1
if c==8:
cnt+=1
i+=2
print(cnt) |
p03281 | s088961333 | Accepted | import sys
n=int(input())
num=1
ans=0
while num<=n:
count=0
for i in range(num):
i+=1
if num%i == 0: count+=1
if count == 8: ans+=1
num+=2
print(ans) |
p03281 | s400044049 | Accepted | def check(k):
cnt = 0
for i in range(1, k + 1):
if k % i == 0:
cnt += 1
if cnt == 8:return 1
else:return 0
n = int(input())
pre = [0] * n
for i in range(n):
if i % 2 == 1:
pre[i] = pre[i - 1]
else:
temp = check(i + 1)
pre[i] = pre[i - 1] + temp
print(pre[n - 1]) |
p03281 | s279093741 | Accepted | 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:
ans += 1
print(ans)
|
p03281 | s189257272 | Accepted | def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
n = int(input())
print(len(list(filter(lambda x: len(make_divisors(x)) == 8, range(1, n + 1,2)))))
|
p03281 | s482358375 | Accepted | n = int(input())
ans = 0
for i in range(1, n + 1, 2):
divisor = 0
for j in range(1, i + 1, 2):
if i % j == 0:
divisor += 1
if divisor == 8:
ans += 1
print(ans) |
p03281 | s919771618 | Accepted | n = int(input())
def judge(x):
i = 1
ans = 0
while i*i < x:
if x%i == 0:
ans+=1
if (x//i)*i == x:
ans += 1
i+=1
if ans == 8:
return True
else:
return False
ans = 0
for i in range(1,n+1,2):
if judge(i):
ans += 1
print(ans) |
p03281 | s801296526 | Accepted | N = int(input())
ans = 0
for n in range(N+1):
if n%2==1:
Y = 0
for m in range(1,N+1):
if n%m==0:
Y+=1
if Y==8:
ans+=1
print(ans) |
p03281 | s610206954 | Accepted | def is_ans(n:int) -> int:
count = 0
for i in range(1,n+1):
if n%i == 0:
count += 1
return count
def main():
tmp = 0
ans = 0
n = int(input())
for i in range(1,n+1):
if i%2 == 1:
tmp = is_ans(i)
if tmp == 8:
ans += 1
tmp = 0
print(ans)
if __name__ == '__main__':
main()
|
p03281 | s838543968 | Accepted | n = int(input())
ans = 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:
ans+=1
print(ans) |
p03281 | s132124944 | Accepted | import numpy as np
n=int(input())
ans=0
for k in range(n+1):
if k%2==1:
count=0
m=int(np.sqrt(k)+1)
for i in range(m):
a=i+1
if(k%a==0):
count+=1
if count==4:
ans+=1
print(ans)
|
p03281 | s772205647 | Accepted | n = int(input())
b = 0
for i in range(1, n+1):
if i % 2 == 1:
a = 0
for j in range(1, i+1):
if i % j == 0:
a += 1
if a == 8:
b += 1
print(b) |
p03281 | s275164646 | Accepted | 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:
ans += 1
print(ans) |
p03281 | s409479490 | Accepted | N = int(input())
def cnt_div(n):
cnt = 0
for i in range(1,n+1):
if i*i>n:break
if n%i==0:
cnt+=1
if n//i!=i:
cnt+=1
return cnt
cnt = 0
for i in range(1,N+1):
if i%2==1 and cnt_div(i)==8:
cnt+=1
print(cnt) |
p03281 | s250827567 | Accepted | N = int(input())
count = 0
from math import sqrt
for i in range(1,N+1)[::-1]:
if i%2==1:
yakusu = 0
for j in range(1,i+1):
if i%j==0:
yakusu += 1
if yakusu == 8:
count += 1
print(count) |
p03281 | s611324792 | Accepted | def div(x):
cnt = 0
for i in range(1, x + 1):
if x % i == 0:
cnt += 1
return cnt
n = int(input())
ans = 0
for i in range(1, n + 1, 2):
if div(i) == 8:
ans += 1
print(ans)
|
p03281 | s066183253 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1, 2):
count = 0
for j in range(1, int(i ** 0.5) + 1):
if i % j == 0:
count += 2
if int(i ** 0.5) ** 2 == i:
count -= 1
if count == 8:
ans += 1
print(ans)
|
p03281 | s608371529 | Accepted | N=int(input())
b=0
for i in range(N):
a=0
for j in range(i+1):
if a==9:
b=b-1
break
if (i+1)%2!=0 and (i+1)%(j+1)==0:
a=a+1
if a==8:
b=b+1
print(b) |
p03281 | s145510353 | Accepted | n = int(input())
res = 0
for i in range(9, n+1, 2):
yakusu = 0
for j in range(1, i+1):
if i % j == 0:
yakusu += 1
if yakusu == 8:
res += 1
print(res) |
p03281 | s194046406 | Accepted | import math
def is_square(N):
return math.sqrt(N) - int(math.sqrt(N)) == 0
def get_divisor_count(N):
divisor_count = 0
for i in range(1,int(math.sqrt(N))+1):
if N%i == 0:
divisor_count += 1
return divisor_count*2 if is_square(N) == False else divisor_count*2 - 1
if __name__ == "__main__":
N = int(input())
count = 0
for i in range(1,N+1,2):
if get_divisor_count(i) == 8:
count += 1
print(count) |
p03281 | s149806780 | Accepted | def dcount(n):
c = 0
for i in range(1, n+1):
if n % i == 0:
c += 1
return c
N = int(input())
c = 0
for i in range(1, N + 1, 2):
if dcount(i) == 8:
c += 1
print(c) |
p03281 | s027411370 | Accepted | # -*- coding: utf-8 -*-
import sys
N = int(input().strip())
#-----
if N <= 104:
print(0)
sys.exit()
elif N == 105:
print(1)
sys.exit()
else:
ans_list=[105]
for i in range(107,N+1,2):
cnt=0
for j in range(1,N+1):
if i % j == 0:
cnt += 1
if cnt == 8:
ans_list.append(i)
print(len(ans_list))
|
p03281 | s054346001 | Accepted | n = int(input())
lis = [x for x in range(1, n+1, 2)]
ans = 0
for a in lis:
lis2 = []
for b in range(1, a+1):
if a % b == 0:
lis2.append(b)
if len(lis2) == 8:
ans += 1
print(ans) |
p03281 | s582857389 | Accepted | n=int(input())
sm=0
for i in range(3,n+1,2):
num=0
for j in range(1,i+1,2):
if i%j==0:num+=1
if num==8: sm+=1
print(sm) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.