problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03281 | s450758659 | Accepted | import math
N = int(input())
# 約数の数を出してくれる
def make_divisors(n):
divisors = []
for i in range(1, int(math.sqrt(n)) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
return len(divisors)
cnt = 0
# 1からNまでの奇数
for i in range(1, N + 1, 2):
if make_divisors(i) == 8:
cnt += 1
print(cnt) |
p03281 | s257947021 | Accepted | N = int(input())
s = 0
for i in range(N+1):
if i % 2 == 1:
t = 0
for j in range(1,i+1):
if i % j == 0:
t += 1
if t == 8:
s += 1
print(s) |
p03281 | s786319937 | Accepted | N=int(input())
def div(n):
table=[]
for i in range(1,int(n**0.5)+1):
if i*i>n:
break
if n%i==0:
table.append(i)
if n//i!=i:
table.append(n//i)
return table
ans=0
for i in range(1,N+1,2):
if len(div(i))==8:
ans+=1
print(ans)
|
p03281 | s173188166 | Accepted | N=int(input())
ans=0
for n in range(1,N+1,2):
_ans=0
for x in range(1,n+1):
if n%x==0:
_ans+=1
if _ans==8:
ans+=1
print(ans) |
p03281 | s612346874 | Accepted | n = int(input())
ans = 0
for k in range(1, n+1, 2):
cnt = 1
for i in range(1, k):
if k%i == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) |
p03281 | s206640211 | 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 | s313295063 | Accepted | N = int(input())
count = 0
ans = 0
for i in range(1,N+1,2):
for j in range(1,i+1,2):
if i%j == 0:
count += 1
if(count == 8):
ans += 1
count = 0
print(ans) |
p03281 | s422577018 | Accepted | n = int(input())
ans = 0
for i in range(105, n + 1, 2):
divisor = []
for j in range(1, int(i ** 0.5) + 1):
if i % j == 0:
divisor.append(j)
divisor.append(i // j)
if len(divisor) == 8:
ans += 1
print(ans)
|
p03281 | s522561531 | Accepted | N = int(input())
ans = 0
for i in range(1,N+1):
cnt = 0
for j in range(1,N+1):
if i % j == 0 and j % 2 == 1:
cnt += 1
if cnt == 8:
ans += 1
print(ans) |
p03281 | s981994712 | Accepted | n = int(input())
cnt = 0
for i in range(1, n + 1, 2):
j = 1
temp = 0
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 | s354938877 | Accepted | #!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(input())
a = [105,135,165,189,195]
if a[0] > n: print(0)
elif a[0] <= n < a[1]: print(1)
elif a[1] <= n < a[2]: print(2)
elif a[2] <= n < a[3]: print(3)
elif a[3] <= n < a[4]: print(4)
elif a[4] <= n: print(5) |
p03281 | s753889361 | Accepted | N = int(input())
def yaku(n):
ans = []
x = int(N ** (1/2))
for i in range(1, x + 1):
if n % i == 0:
if i != n // i:
if i not in ans:
ans.append(i)
if n // i not in ans:
ans.append(n // i)
return len(ans)
ans = 0
for i in range(1, N + 1, 2):
if yaku(i) == 8:
ans += 1
print(ans)
|
p03281 | s577777151 | Accepted | N = int(input())
ans = 0
for n in range(1, N+1):
if n%2==0: continue
cnt = 0
for i in range(1, n+1):
if n%i==0:
cnt += 1
if cnt==8: ans += 1
print(ans) |
p03281 | s988371835 | Accepted | num = int(input())
ans = 0
for i in range(1, num+1, 2):
count = 0
for j in range(1, i+1, 2):
if i % j == 0:
count += 1
if count == 8:
ans += 1
print(ans) |
p03281 | s170196123 | Accepted | import sys
def main():
input = sys.stdin.buffer.readline
n = int(input())
cnt = [0] * (n + 1)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
cnt[j] += 1
ans = len([i for i in range(1, n + 1, 2) if cnt[i] == 8])
print(ans)
if __name__ == "__main__":
main()
|
p03281 | s990627458 | Accepted | N=int(input())
answer=0
for n in range(1,N+1,2):
count=0
for i in range(1,int(pow(n,1/2))+1):
if n%i==0:
if n//i!=i:
count+=2
else:
count+=1
if count==8:
answer+=1
print(answer) |
p03281 | s939150364 | Accepted | N = int(input())
ans = 0
for i in range(1,N+1,2):
now = 0
for j in range(1,i+1):
if i%j == 0:
now += 1
if now == 8:
ans += 1
print(ans) |
p03281 | s412540520 | Accepted | N = int(input())
d = []
cnt = 0
for i in range(1,N+1):
if i % 2 == 1:
for j in range(1,int(i**0.5)+1):
if i % j == 0:
d.append(j)
if j != i//j:
d.append(i//j)
if len(d) == 8:
cnt +=1
d = []
print(cnt) |
p03281 | s272119889 | Accepted | import math
def yakusu(n):
count = 0
for i in range(1,int(math.sqrt(n))+1+1):
if n % i == 0:
count += 2
return count
N = int(input())
c = 0
for i in range(1,N+1,2):
if yakusu(i) == 8:
c+=1
print(c)
|
p03281 | s003548504 | Accepted | n = int(input())
c = 0
ans = 0
for i in range(1,n+1,2):
for j in range(1,i+1):
if i % j == 0:
c += 1
if c == 8:
ans += 1
c = 0
print(ans)
|
p03281 | s958123080 | Accepted | n = int(input())
ans = 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:
ans+=1
print(ans) |
p03281 | s219021747 | Accepted | N = int(input())
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]
count = 0
for i in range(1, N+1, 2):
if len(make_divisors(i)) == 8:
count += 1
print(count)
|
p03281 | s076353361 | Accepted | def check(x):
count = 0
for num in range(1,x+1,2):
if x % num == 0:
count += 1
return count
N = int(input())
ans = 0
for x in range(1,N+1):
if check(x) == 8:
ans += 1
print(ans) |
p03281 | s191803684 | 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 | s193167500 | Accepted | N = int(input())
count = 0
for i in range(1, N+1, 2):
yakusuu = 0
for j in range(1, i+1, 2):
if i % j == 0:
yakusuu += 1
if yakusuu == 8:
count += 1
print(count)
|
p03281 | s566500400 | Accepted | N = int(input())
cnt = 0
for n in range(1, N + 1, 2):
route_n = int(n ** (1 / 2))
by = []
for i in range(1, route_n + 1, 2):
if n % i == 0:
by.append(i)
a = n // i
if a != i:
by.append(a)
if len(by) == 8:
cnt += 1
print(cnt) |
p03281 | s981848623 | Accepted | n = int(input())
ans = 0
for i in range(1, n + 1, 2):
div_count = 0
for j in range(1, i + 1):
if i % j == 0:
div_count += 1
if div_count == 8:
ans += 1
print(ans) |
p03281 | s895191233 | Accepted | def divisor(n):
i = 1
ans_div = []
while i * i <= n:
if n%i == 0:
ans_div.append(i)
ans_div.append(n // i)
i += 1
ans_div = list(set(ans_div))
return ans_div
import sys
input = sys.stdin.readline
N = int(input())
count = 0
if N < 105:
print(0)
else:
for odd in range(105, N+1, 2):
li = divisor(odd)
if len(li) == 8:
count += 1
print(count) |
p03281 | s041727319 | Accepted | #ABC106B
def main():
import sys
N = int(sys.stdin.readline())
result = 0
for i in range(1, N+1, 2):
result +=yakusu_cnt(i)
print(result)
def yakusu_cnt(n):
ans = 0
for i in range(1, n+1):
if n%i==0:
#print(i)
ans+=1
if ans ==8:
return 1
else:
return 0
if __name__=='__main__':
main() |
p03281 | s964117419 | Accepted | n=input()
s=0
yakusu=0
for i in range(1,int(n)+1):
s=0
if i%2!=0:
for k in range(1,i+1):
if i%k==0:
s+=1
if s==8:
yakusu+=1
print(yakusu) |
p03281 | s605879188 | Accepted | def make_divisors(n) -> list:
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())
cnt = 0
for i in range(105, N+1, 2):
if len(make_divisors(i)) == 8:
cnt += 1
print(cnt) |
p03281 | s266883455 | Accepted | from sys import stdin
ans=0
c=0
N = int(input().rstrip())
for i in range(N):
c=0
i+=1
if i%2==1:
for j in range(i):
j+=1
if i%j==0:
c+=1
if c==8:
ans+=1
print(ans) |
p03281 | s103856807 | Accepted | #!/usr/bin/env/ python3
#S = input()
N = int(input())
#A, B, C = input().split()
#N, M = map(int, input().split())
#N = int(input())
#A = [int(x) for x in input().split()]
#H, W = map(int, input().split())
#S = [input() for _ in range(H)]
#print(S[0][1])
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 | s135603435 | Accepted | N = int(input())
def factorize(x):
results = []
for i in range(1, x+1):
if i*i == x:
results.append(i)
break
if i*i > x:
break
else:
if x % i == 0:
results.append(i)
results.append(x // i)
return results
ans = 0
for i in range(1, N+1, 2):
if len(factorize(i)) == 8:
ans += 1
print(ans) |
p03281 | s106864336 | Accepted | N=int(input())
ans=0
for i in range(1,N+1,2):
y=0
for j in range(1,i+1):
if i%j == 0:
y+=1
if y==8:
ans+=1
print(ans) |
p03281 | s512718595 | Accepted | def 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 and len(divisors(i)) == 8:
ans += 1
print(ans) |
p03281 | s257346393 | Accepted | N = int(input())
#cnt = 0
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 | s802104026 | Accepted | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()
def main():
N=int(input())
ans=0
for j in range(1,N+1,2):
tmp=0
for i in range(1,j+1):
if j%i==0:
tmp+=1
if tmp==8:
ans+=1
print(ans)
if __name__ == '__main__':
main()
|
p03281 | s416604510 | Accepted | n=int(input())
ans=0
count=0
for i in range(1,n+1,2):
ans=0
for j in range(1,i+1):
if i%j == 0:
ans+=1
if ans == 8:
count+=1
print(count) |
p03281 | s131183344 | Accepted | N = int(input())
cnt = 0
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 | s076505042 | Accepted | n = int(input())
ans = 0
for i in range(1, n+1, 2):
c = 0
for k in range(1, i+1):
if i % k == 0:
c += 1
if c == 8:
ans += 1
print(ans)
|
p03281 | s770695698 | Accepted | N = int(input())
A = 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:
A += 1
print(A) |
p03281 | s058188063 | 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
else:
continue
if cnt == 8:
ans += 1
print(ans) |
p03281 | s682671841 | Accepted | n=int(input())
count=0
ans=0
for i in range(1,n+1):
if i%2!=0:
count=0
for j in range(1,n+1):
if i%j==0:
count+=1
if count==8:
ans+=1
print(ans) |
p03281 | s137907236 | Accepted | # -*- coding: utf-8 -*-
# 標準入力を取得
N = int(input())
# 求解処理
ans = 0
for n in range(1, N + 1, 2):
div_count = 0
for i in range(1, n + 1):
div_count += (n % i == 0)
ans += (div_count == 8)
# 結果出力
print(ans) |
p03281 | s640954217 | Accepted | def mkdiv(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]
ans=0
n=int(input())
for i in range(n+1):
if len(mkdiv(i))==8 and i%2:
ans+=1
print(ans) |
p03281 | s921977556 | 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):
if i % 2 == 1 and len(make_divisors(i)) == 8:
count += 1
print(count)
|
p03281 | s207895807 | Accepted | n = int(input())
res = 0
for i in range(1, n + 1, 2):
temp = i
cnt = 0
for j in range(1, temp + 1):
if temp % j == 0:cnt += 1
if cnt == 8:res += 1
print(res) |
p03281 | s144674397 | Accepted | x = int(input())
line = []
for i in range(1, x+1):
count = 0
if i%2 == 0:
continue
for j in range(1, i+1):
if i%j == 0:
count += 1
if count == 8:
line.append(i)
print(len(line)) |
p03281 | s868743930 | Accepted | n = int(input())
a = n//2
ans = 0
for j in range(1,n+1):
count = 0
for i in range(1,j+1):
if j % i == 0:
count += 1
if count >= 8 and j % 2 == 1:
ans +=1
print(ans)
|
p03281 | s966053900 | Accepted | N = int(input())
# dict = {i:0 for i in range(N)}
dict = {}
for i in range(N+1):
if i % 2 == 1:
dict[i] = 0
for j in range(1, N+1):
if i % j == 0:
dict[i] += 1
else:
continue
else:
continue
# print(dict)
count = 0
for i in dict.values():
if i == 8:
count += 1
else:
continue
print(count) |
p03281 | s448787109 | Accepted | n = int(input())
count = 0
for i in range(1, n+1):
if i%2 == 1:
tmp = 0
for j in range(1, i+1):
if i%j == 0:
tmp+=1
if tmp == 8:
count+=1
print(count)
|
p03281 | s691015113 | Accepted | n = int(input())
def yak(n):
lis = []
for i in range(1,n+1):
if n%i==0: lis.append(i)
return lis
cnt = 0
for i in range(1, n+1):
if i%2==1:
l = len(yak(i))
if l == 8:
cnt += 1
print(cnt) |
p03281 | s734852719 | 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())
counter = 0
for i in range(1,N+1,2):
if(len(make_divisors(i)) == 8):
counter+=1
print(counter) |
p03281 | s699837547 | Accepted | N = int(input())
ans = 0
for i in range(1,N+1,2):
yakusuu = 0
for j in range(1,i+1):
if i%j == 0:
yakusuu += 1
if yakusuu == 8:
ans +=1
print(ans)
|
p03281 | s520741811 | Accepted | #python3
from math import floor, sqrt
def f(x):
p = set()
for i in range(1, floor(sqrt(x))+1):
if x%i == 0:
p.add(i)
p.add(x//i)
return len(p)
def main():
n = int(input())
cnt = 0
for i in range(1, n+1):
if i%2 != 0:
if f(i) == 8:
cnt += 1
print(cnt)
main() |
p03281 | s659845425 | Accepted | N = int(input())
yakusu = 0
ans = 0
for i in range(1,N+ 1):
if i % 2 == 1:
yakusu = 0
for i2 in range(1,i + 1):
if i % i2 == 0:
yakusu += 1
if yakusu == 8:
ans += 1
print(ans) |
p03281 | s817483574 | Accepted | ans = 0
n = int(input())
for i in range(3,n+1,2):
temp = 0
for j in range(1,i+1):
if i%j == 0:
temp += 1
ans += (1 if temp == 8 else 0)
print(ans) |
p03281 | s061003245 | 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 | s984373701 | Accepted | 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) |
p03281 | s381246760 | Accepted | N = int(input())
c = 0
for i in range(1,N+1):
if i % 2 == 0:
continue
li = []
if i < 10:
continue
else:
k = i
for j in range(2,int(i**(0.5)+3)):
d = 1
while k % j == 0:
k = k/j
d += 1
if d != 1:
li.append(d)
ss = 1
for x in li:
ss *= x
if ss == 8:
#print(i)
c += 1
print(c)
|
p03281 | s699401177 | Accepted | s = int(input())
if s <= 104:
print(0)
elif 105<= s <135:
print(1)
elif 135<= s <165:
print(2)
elif 165 <= s <189:
print(3)
elif 189<= s <195:
print(4)
else:
print(5) |
p03281 | s905052010 | Accepted | n = int(input())
ans=0
for i in range(1,n+1,2):
cnt = 0
for j in range(1,n+1,2):
if j>i:
break
if i%j==0:
cnt+=1
if cnt==8:
ans+=1
print(ans)
|
p03281 | s659215732 | Accepted | N = int(input())
def div_count(i):
count = 0
for div in range(1, i+1):
if i % div == 0:
count += 1
return count
ans = 0
for i in range(1, N+1, 2):
if div_count(i) == 8:
ans += 1
print(ans) |
p03281 | s731698630 | Accepted | N=int(input())
s=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:
s+=1
print(s) |
p03281 | s845598949 | Accepted | n = int(input())
li = [3,5,7,11,13]
ans = 0
for i in range(1,n+1):
cnt = 0
for j in range(5):
if i%li[j]==0:
cnt += 1
if cnt ==3:
ans +=1
if n>=135:
ans += 1
if n>=189:
ans += 1
print(ans) |
p03281 | s166539440 | Accepted | n = int(input())
def divisor(n):
res = 0
for i in range(1,int(n**0.5)+1):
if n % i == 0:
res += 1
if i != n//i:
res += 1
return res
ans = 0
for i in range(1, n+1, 2):
if divisor(i) == 8:
ans += 1
print(ans) |
p03281 | s861232999 | Accepted | import sys
def resolve():
N = int(input())
cnt = 0
for i in range(1, N+1, 2):
if is_8_factors(i):
cnt += 1
print(cnt)
def is_8_factors(n):
nfactors = 2
upper = n
div = 3
while True:
if upper <= div:
break
if n % div == 0:
nfactors += 2
upper = n // div
div += 2
return True if nfactors == 8 else False
if '__main__' == __name__:
resolve() |
p03281 | s258782018 | Accepted | n = int(input())
ans = 0
for num in range(1, n+1):
if num%2 == 0:
continue
ls = []
for i in range(1, num+1):
if num%i == 0:
ls.append(i)
if len(ls) == 8:
ans += 1
print(ans) |
p03281 | s335333293 | Accepted | n=int(input())
l=[]
ans1=0
for i in range(1,n+1):
if i%2!=0:
l.append(i)
for j in range(len(l)):
ans=0
for k in range(1,l[j]+1):
if l[j]%k==0:
ans+=1
if ans==8:
ans1+=1
print(ans1) |
p03281 | s895604242 | 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 | s157494459 | Accepted | N = int(input())
count = 0
for num in range(1, N+1):
cnt = 0
for i in range(1, num+1):
if num%2==1 and num%i==0:
cnt += 1
if cnt >= 8:
count += 1
print(count) |
p03281 | s826045229 | Accepted | N=int(input())
if N<105:
print(0)
exit()
cnt=1
for i in range(107,N+1,2):
tmp=0
for j in range(1,N+1):
if i%j==0:
tmp+=1
if tmp==8:
cnt+=1
print(cnt) |
p03281 | s863912221 | Accepted | def main(n):
ans = 0
for i in range(1, n + 1):
if i % 2 == 0:
continue
l = 0
for j in range(1, i + 1):
if i % j == 0:
l += 1
if l == 8:
ans += 1
print(ans)
if __name__ == "__main__":
n = int(input())
main(n)
|
p03281 | s191445272 | Accepted | def main():
n = int(input())
r = 0
for i1 in range(1, n + 1,2):
cnt = 0
for i2 in range(1,i1+1):
cnt += i1 % i2 == 0
r += cnt == 8
print(r)
if __name__ == '__main__':
main()
|
p03281 | s942707152 | Accepted | N = int(input())
def divisor(n):
ans = []
for i in range(1,int(n**0.5)+1):
if n%i==0:
ans.append(i)
if n//i != i:
ans.append(n//i)
return len(ans)
ans = 0
for i in range(1,N+1,2):
if divisor(i) == 8:
ans += 1
print(ans) |
p03281 | s609297572 | Accepted | import math
n = int(input())
ans = 0
if n > 104:
for i in range(105,n+1)[::2]:
cnt = 0
for j in range(1,math.ceil(i**0.5)):
if i%j == 0:
cnt += 2
if j**2 == i:
cnt -= 1
if cnt == 8:
ans += 1
print(ans) |
p03281 | s572336187 | Accepted | import sys
import os
import math
N=int(input())
count = 0
for i in range(1, N+1):
if i % 2 == 0:
continue
else:
yakusu = 0
for j in range(1, i+1):
if i % j == 0:
yakusu += 1
if yakusu == 8:
count += 1
print(count) |
p03281 | s084867937 | Accepted | n = int(input())
num = 0
ans = 0
for i in range(1, n + 1, 2):
for j in range(1, i + 1, 2):
if i % j == 0:
num += 1
if num == 8:
ans += 1
num = 0
print(ans) |
p03281 | s239454152 | Accepted | N = int(input())
def f(n):
return sum(1 for i in range(1,n+1) if n % i ==0)
print(sum(1 for i in range(1,N+1) if i % 2 >0 and f(i)==8))
|
p03281 | s876369337 | Accepted | n = int(input())
ans = 0
for i in range(1, n+1):
w = 0
if i % 2 == 0:
continue
for j in range(1, i+1):
if i % j == 0:
w += 1
if w == 8:
ans += 1
print(ans) |
p03281 | s979647492 | Accepted | N = int(input())
nums = range(1, N+1, 2)
res = 0
for n in nums:
i = 1
for x in range(1,n):
if (n // (x)) * (x) == n:
i = i + 1
if i == 8:
res += 1
print(res) |
p03281 | s000468357 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1):
tmp = 0
for j in range(1, N+1):
if i % j == 0 and j % 2 == 1:
tmp += 1
if tmp == 8:
ans += 1
print(ans) |
p03281 | s494126680 | Accepted | N = int(input())
ret = 0
if N <= 105:
if N == 105:
print(1)
else:
print(0)
exit()
ans = 1
for i in range(106, N+1):
ret = 0
for j in range(1, i+1):
if i % j == 0:
ret += 1
if ret == 8 and i % 2 == 1:
ans += 1
print(ans) |
p03281 | s064282136 | Accepted | import math
n = int(input())
ans = 0
for i in range(1, n+1):
if i % 2 == 0:
continue
num = 0
for j in range(1, math.floor(i / 3) + 1):
if i % j == 0:
num += 1
else:
if num == 7:
ans += 1
print(ans)
|
p03281 | s673557442 | Accepted | 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 | s701775674 | 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 | s673841108 | 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 | s623783128 | Accepted | N = int(input())
sum_cnt = 0
for n in range(1, N+1):
cnt = 0
for i in range(1, n+1):
if n % i == 0:
cnt += 1
if cnt == 8 and n % 2 == 1:
sum_cnt += 1
print(sum_cnt) |
p03281 | s072153528 | 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 | s256272710 | 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 | s811825066 | Accepted | n = int(input())
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)
ans = 0
for i in range(1,n+1,2):
if len(make_divisors(i)) == 8:
ans += 1
print(ans) |
p03281 | s794012272 | Accepted | def yakusuu(n):
kosuu = 0
for i in range(1, n+1 , 2):
cnt = 0
for j in range(1, n+1):
if i % j == 0:
cnt = cnt + 1
if cnt == 8:
kosuu = kosuu + 1
return kosuu
def main():
n = int(input())
print(yakusuu(n))
if __name__ == '__main__':
main() |
p03281 | s870357437 | 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())
count = 0
for i in range(1,N+1,2):
if len(divisor(i)) == 8:
count += 1
print(count) |
p03281 | s554815508 | Accepted | 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)
|
p03281 | s040102441 | Accepted |
import collections
def solve():
N = int(input())
def GetDivider(num):
cnt = 0
for i in range(1, num+1):
if num % i == 0:
cnt += 1
return cnt
ans = 0
for i in range(1, N+1):
if GetDivider(i) == 8:
if i % 2 != 0:
ans += 1
print(ans)
if __name__ == "__main__":
solve()
|
p03281 | s598877921 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1, 2):
divisor = []
for j in range(1, N+1):
if i % j == 0:
divisor.append(j)
if len(divisor) == 8:
ans += 1
print(ans)
|
p03281 | s943413920 | Accepted | n = int(input())
a =[]
for i in range(1,n+1):
if i % 2 == 1:
a.append(i)
ans = 0
for j in a:
x=0
for k in range(1,j+1):
if j % k == 0:
x += 1
if x ==8:
ans += 1
else:
continue
print(ans)
|
p03281 | s934347226 | 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:
break
if cnt == 8:
ans +=1
print(ans)
|
p03281 | s410377995 | Accepted | n=int(input())
ans=0
for i in range(1,n+1):
y=0
for k in range(1,i+1):
if i%k==0:
y+=1
if y==8 and i%2==1:
ans+=1
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.