problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03281 | s300148770 | Accepted | #ABC105-B
n = int(input())
divisor_list = []
ans = 0
for i in range(1,n+1):
divisor_list = []
#odd,even判定
if(i % 2 != 0):
#約数をdivisor_listに追加していく
for j in range(1,i+1):
if (i % j == 0):
divisor_list.append(j)
if(len(divisor_list) == 8):
ans += 1
print(ans) |
p03281 | s938379790 | Accepted | n=int(input())
if 104>=n:
print(0)
elif 105<=n<=134:
print(1)
elif 135<=n<=164:
print(2)
elif 165<=n<=188:
print(3)
elif 189<=n<=194:
print(4)
else:
print(5) |
p03281 | s419715851 | Accepted | #coding:utf-8
n = int(input())
ans = 0
#n以下のすべての奇数について全探索
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 | s030770403 | Accepted | a=int(input())
if a<=104:
ans=0
elif a<135:
ans=1
elif a<165:
ans=2
elif a<189:
ans=3
elif a<195:
ans=4
else:
ans=5
print(ans) |
p03281 | s677314844 | Accepted | import numpy as np
n = int(input())
l = [0 for i in range(0, 201)]
for i in range(1, 201):
for j in range(i, 201):
if j/i == int(j/ i):
l[j] += 1
l = np.array(l[1:n+1:2])>=8
print(sum(l)) |
p03281 | s175505839 | Accepted | def make_divisors(n):
a,b =[],[]
i = 1
while i*i<=n:
if n%i == 0:
a.append(i)
if i != n//i:
b.append(n//i)
i+= 1
return a+b[::-1]
n = int(input())
c = 0
for i in range(1,n+1):
if len(make_divisors(i))== 8 and i%2==1:
c+=1
print(c) |
p03281 | s570880490 | Accepted | N = int(input())
cnt = 0
for i in range(1,N+1,2):
ans=0
for j in range(1,i+1):
if i % j == 0:
ans += 1
else:
pass
if ans == 8:
cnt += 1
else:
pass
print(cnt) |
p03281 | s316393587 | Accepted | def main():
N = int(input())
num = 0
for i in range(1, N + 1):
if i % 2 == 1:
count = 0
for j in range(1, N + 1):
if i % j == 0:
count += 1
if count == 8:
num += 1
print(num)
main() |
p03281 | s336937317 | Accepted | N = int(input())
count = 0
for i in range(1,N+1):
yaku = 0
if i%2 == 1:
for j in range(1,i+1):
if i%j == 0:
yaku += 1
if yaku == 8:
count += 1
print(count) |
p03281 | s758071291 | 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())
ans = 0
for i in range(1,n+1):
if i % 2 == 1 and len(make_divisors(i)) == 8:
ans += 1
print(ans) |
p03281 | s665292927 | Accepted | n = int(input())
c = 0
a = [105,165,195]
if (n<105):
print(0)
elif (105<=n and n<135):
print(1)
elif (n >= 195):
print(5)
elif (135<=n and n<165):
print(2)
elif (165<=n and n<189):
print(3)
else:
print(4) |
p03281 | s329661195 | Accepted | N = int(input())
def divisor_all(n): # 約数全列挙
l = [1,n]
for i in range(2,int(pow(n,1/2))+1):
if n % i == 0:
if i == n//i:
l.append(i)
else:
l.append(i)
l.append(n//i)
l.sort()
return l # list
ans = 0
for i in range(1,N+1,2):
if len(divisor_all(i))==8:
ans += 1
print(ans) |
p03281 | s604217128 | 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 | s660593586 | 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 | s669258491 | Accepted | import itertools
N=int(input())
prime=[3,5,7,11,13,17,19]
comb = list(itertools.combinations(prime,3))
lst=[]
for i in range(len(comb)):
temp=comb[i][0]*comb[i][1]*comb[i][2]
if temp<=200:
lst.append(temp)
lst.append(135)
lst.append(189)
ans = sum(N>=x for x in lst)
print(ans) |
p03281 | s805796538 | 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
In = int(input())
count = 0
for i in range(1,In+1,2):
if len(make_divisors(i))==8:
count+=1
print(count) |
p03281 | s100241776 | 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
ans += i&1 and cnt == 8
print(ans) |
p03281 | s525009099 | Accepted | n = int(input())
a = 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:
a += 1
print(a) |
p03281 | s878619378 | 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 | s507027305 | Accepted | n = int(input())
total = []
for i in range(1, n+1, 2):
cnt = 0
for j in range(1, i+1, 2):
if i%j == 0:
cnt += 1
if cnt == 8:
total.append(i)
print(len(total)) |
p03281 | s396133459 | Accepted | n = int(input())
res = 0
for i in range(1,n+1):
cnt = 0
for j in range(1,i+1):
if i % 2 == 1 and i % j == 0:
cnt += 1
if cnt == 8: res += 1
print(res) |
p03281 | s041210352 | Accepted | n = int(input())
odd_list = [num for num in range(1, n+1, 2)]
cnt_8 = 0
for i in odd_list:
cnt = 0
for j in range(1, i+1, 2):
if i % j == 0:
cnt += 1
if cnt == 8:
cnt_8 += 1
print(cnt_8)
|
p03281 | s824824940 | Accepted | N = int(input())
ans = 0
for n in range(1,N+1,2):
sm = sum(n % i == 0 for i in range(1,n+1))
if sm == 8:
ans += 1
print(ans)
|
p03281 | s048859833 | Accepted | N = int(input())
res = 0
for n in range(1, N+1, 2):
cnt = 0
for i in range(1, n+1):
if n % i == 0:
cnt += 1
if cnt == 8:
res += 1
print(res) |
p03281 | s562871076 | Accepted | N=int(input())
ans=0
for i in range(1,N+1):
tmp=0
if i%2!=0:
for j in range(1,i+1):
if i%j==0:
tmp+=1
if tmp==8:
ans+=1
print(ans)
|
p03281 | s419256806 | Accepted | N=int(input())
count=0
for i in range(105,N+1,2):
divisor=0
for j in range(1,i+1):
if(i%j==0):divisor+=1
if(divisor==8):count+=1
print(count) |
p03281 | s154314538 | Accepted | n=int(input())
count=0
ans=0
for j in range(1,n+1,2):
count=0
for i in range(1,int(j**0.5)+1):
if j%i==0:
if j//i!=i:
count+=2
else:
count+=1
if count==8:
ans+=1
print(ans)
|
p03281 | s340963940 | Accepted | MAX_N = 200
N = int(input())
a = [3, 5]
i = 7
while 3 * 5 * i < MAX_N:
a.append(i)
i += 2
len_a = len(a)
dot = []
for j in range(len_a-2):
for k in range(j+1, len_a-1):
for l in range(k+1, len_a):
d = a[j] * a[k] * a[l]
if d < MAX_N:
dot.append(a[j] * a[k] * a[l])
dot = sorted(dot)
r = 0
for x in dot:
if x <= N:
r += 1
else:
break
print(r) |
p03281 | s920301742 | Accepted | N = int(input())
l = []
for i in range(1, N + 1, 2):
count = 0
for j in range(1, i + 1, 2):
if i % j == 0:
count += 1
if count == 8:
l.append(i)
print(len(l))
|
p03281 | s560004406 | 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 | s332264591 | 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 | s629384418 | Accepted | input = int(input())
count = 0
for i in range(1, input + 1, 2):
num = 0
for j in range(2, i):
if i % j == 0:
num += 1
if num == 6:
count += 1
print(count) |
p03281 | s734544920 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1):
if i%2 != 0:
cnt = 0
for j in range(1, i+1):
if i%j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) |
p03281 | s587747174 | Accepted | N = int(input())
count = 0
for i in range(1,N+1,2):
temp = 0
for j in range (1,i+1):
if i%j == 0:
temp+=1
if temp == 8:
count+=1
print(count)
|
p03281 | s315804609 | Accepted | N = int(input())
ans = 0
for n in range(1, N+1):
if n%2 == 1:
count = 0
for i in range(1, n+1):
if n%i == 0:
count += 1
if count == 8:
ans += 1
print(ans) |
p03281 | s239024129 | Accepted | N = int(input())
check = 0
for i in range(1,N+1):
count = 0
for j in range(1,i+1):
if i%j == 0:
count += 1
if i%2 == 1 and count == 8:
check += 1
print(check) |
p03281 | s737569158 | Accepted | n = int(input())
ans = 0
for i in range(1,n+1):
if i%2==0:
continue
else:
divcnt = 0
for j in range(1,i+1):
if i%j==0:
divcnt += 1
if divcnt == 8:
ans += 1
print(ans)
|
p03281 | s560602793 | 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
def solve():
n = int(input())
ans = 0
for i in range(1, n+1):
if len(make_divisors(i)) == 8 and i%2 == 1:
ans += 1
print(ans)
if __name__ == "__main__":
solve() |
p03281 | s012763592 | Accepted | n = int(input())
counter = 0
for i in range(1, n+1, 2):
divisor_counter = 0
for j in range(1, i+1):
if i % j == 0:
divisor_counter += 1
if divisor_counter == 8:
counter += 1
print(counter) |
p03281 | s947601229 | Accepted | N = int(input())
totalcount = 0
for j in range(1, N+1, 2):
count = 0
for i in range(1, N+1):
if j % i == 0:
count = count + 1
if count == 8:
totalcount = totalcount + 1
print(totalcount) |
p03281 | s353053068 | 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 | s681047258 | Accepted | N = int(input())
def make_divisors(n: int):
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
ans = 0
for i in range(1, N+1, 2):
if len(make_divisors(i)) == 8:
ans += 1
print(ans) |
p03281 | s363376200 | Accepted | alist=[105,135,165,189,195]
ans=0
n=int(input())
for i in alist:
if n>=i:
ans+=1
print(ans) |
p03281 | s148530116 | Accepted | N = int(input())
if N < 105:
print(0)
elif 105 <= N < 135:
print(1)
elif 135 <= N < 165:
print(2)
elif 165 <= N < 189:
print(3)
elif 189 <= N < 195:
print(4)
else:
print(5)
|
p03281 | s276840983 | Accepted | N = int(input())
ans = 0
for i in range(1, N + 1, 2):
count = 0
n = 1
while n * n <= i:
if not i % n:
if n * n == i:
count += 1
else:
count += 2
n += 2
if count == 8:
ans += 1
print(ans) |
p03281 | s680818885 | Accepted | n = int(input())
count = 0
ans = 0
j = 1
for i in range(1, n+1, 2):
while j <= i:
if i % j == 0:
count += 1
j += 1
if count == 8:
ans += 1
count = 0
j = 1
print(ans) |
p03281 | s162632629 | Accepted | n=int(input())
#n,m=map(int,input().split())
#hl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
def divnum(n):
res=0
for i in range(1,n+1):
if n%i==0:
res+=1
if res==8:
return True
else:
return False
count=0
for i in range(1,n+1):
if i%2!=0 and divnum(i):
count+=1
print(count) |
p03281 | s108402598 | Accepted | n=int(input())
ans=0
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 += 1
print(ans) |
p03281 | s152231980 | Accepted | N = int(input())
def make_divisors(n):
from collections import deque
divisors = deque([])
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)
lst_divisors = list(divisors)
lst_divisors.sort()
return lst_divisors
ans = 0
for i in range(1,-(-N//2)+1):
now = 2*i-1
if len(make_divisors(now)) == 8:
ans += 1
print(ans) |
p03281 | s356858391 | Accepted | N = int(input())
count = 0
if 105 <= N <= 106:
count = 1
elif N < 105:
count = 0
else:
count = 1
for i in range(107, N + 1, 2):
prime_count = 0
for j in range(1, int(i ** (1/2)) + 1):
if i % j == 0:
prime_count += 1
if i / j != j:
prime_count += 1
if prime_count == 8:
count += 1
print(count) |
p03281 | s311507425 | Accepted | n = int(input())
ans = 0
if n < 105:
print(0)
else:
for i in range(1,n+1,2):
count = 0
for l in range(1, i+1, 2):
if i % l == 0:
count += 1
if count == 8:
ans += 1
print(ans) |
p03281 | s157844094 | Accepted | import math
def yakusuu(a):
x=[]
b=math.ceil(math.sqrt(a))
for i in range(1,b+1):
if a%i==0:
x.append((i,int(a/i)))
return(x)
N=int(input())
oddlist=[i for i in range(1,N+1,2)]
ans=[]
for i in oddlist:
x=yakusuu(i)
if len(x)==4:
ans.append(i)
print(len(ans)) |
p03281 | s983614981 | Accepted | n = int(input())
ans = 0
for i in range(1,n+1):
yakusu = []
for j in range(1,i+1):
if i % j == 0:
yakusu.append(i)
if i % 2 == 1 and len(yakusu) == 8:
ans +=1
print(ans) |
p03281 | s447525339 | 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 len(divisors)
ans = 0
for i in range(1,N+1):
a = make_divisors(i)
if a ==8 and i%2 == 1 :
ans += 1
print(int(ans)) |
p03281 | s903977052 | Accepted | n = int(input())
def yakusu(num):
list_a = []
for i in range(1, num//2 + 1):
if num % i == 0:
list_a.append(i)
list_a.append(num)
return list_a
ans = 0
for i in range(1, n + 1):
if len(yakusu(i)) == 8 and i % 2 ==1:
ans += 1
print(ans) |
p03281 | s477937393 | Accepted | import itertools
N = int(input())
S = [3,5,7,11,13]
if N >= 189:
ans = 2
elif N>= 135:
ans = 1
else:
ans = 0
A = list(itertools.combinations(S,3))
#print(A)
for x in A:
a,b,c = x
if a*b*c <= N:
ans += 1
print(ans) |
p03281 | s672417612 | Accepted | N = int(input())
res = 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:
res += 1
print(res) |
p03281 | s045940005 | Accepted | N = int(input())
ans = 0
for i in range(1, N + 1):
if i % 2 == 0:
continue
cnt = 2
for j in range(2, i):
if i % j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) |
p03281 | s809061633 | Accepted | n = int(input())
count = 0
for i in range(1,n+1):
temp_count = 0
if i%2 == 0:
continue
for j in range(1,i+1):
if i%j == 0:
temp_count += 1
if temp_count == 8:
count += 1
print(count)
|
p03281 | s701073728 | Accepted | n = int(input())
ans = 0
for i in range(105,n+1,2):
c=0
for d in range(1,i+1,2):
if i % d == 0:
c+=1
if c == 8:
ans += 1
print(ans) |
p03281 | s229345144 | Accepted | N = int(input())
ans = 0
for i in range(1,N+1) :
dev = 0
if i%2 == 0 :
continue
for j in range(1,i+1) :
if i%j == 0 :
dev += 1
if dev == 8 :
ans += 1
print(ans)
|
p03281 | s282074805 | Accepted | n=int(input())
if n<105:
print(0)
exit()
ans=0
for i in range(105,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 | s387568090 | Accepted | N=int(input())
ans=0
for n in range(1,N+1,2):
a=0
for w in range(1,n+1,2):
if n%w==0:
a+=1
if a==8:
ans+=1
print(ans) |
p03281 | s561445150 | 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 i%2==1 and count==8:
ans+=1
print(ans)
|
p03281 | s776824845 | Accepted | n=int(input())
def check(n):
ans=0
for i in range(1,n+1):
if n%i==0:
ans+=1
if ans==8:
return True
return False
ans=0
for i in range(1,n+1,2):
if check(i):
ans+=1
print(ans) |
p03281 | s923260804 | Accepted | #nの約数列挙
#-------------------------------------------------------------------------
def divisor(n):
ass = []
for i in range(1,int(n**0.5)+1):
if n%i == 0:
ass.append(i)
ass.append(n//i)
return ass #sortされていない
#-------------------------------------------------------------------------
# テスト
N = int(input())
cnt = 0
for i in range(N+1):
if i%2 == 1 and len(divisor(i)) == 8:
cnt += 1
print(cnt) |
p03281 | s092188905 | Accepted | a=int(input())
if a<105:
print(0)
if 105<=a<135:
print(1)
if 135<=a<165:
print(2)
if 165<=a<189:
print(3)
if 189<=a<195:
print(4)
if 195<=a:
print(5) |
p03281 | s122140679 | Accepted | d8 = [105, 135, 165, 189, 195]
n = int(input())
print(sum([1 for i in d8 if i <= n])) |
p03281 | s692426904 | Accepted | N = int(input())
out=0
k=0
for i in range(1,N+1):
k=0
if i % 2==1:
for j in range(1,i+1):
if i % j==0:
k = k+1
if k==8:
out = out+1
print(out) |
p03281 | s254295237 | Accepted | 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) |
p03281 | s786974725 | Accepted | N = int(input())
res = 0
for n in range(1, N+1, 2):
cnt = 0
for i in range(1, n+1):
if n % i == 0:
cnt += 1
if cnt == 8:
res += 1
print(res) |
p03281 | s174726065 | 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 | s096960424 | Accepted | n=int(input())
ans=0
for i in range(1,n+1):
p=0
for j in range(1,i+1):
if i%j==0:
p+=1
if p==8 and j%2!=0:
ans+=1
print(ans) |
p03281 | s180883958 | Accepted | # coding: utf-8
def get_ans(num: int):
if num < 105:
return 0
ans = 0
for i in range(105, num + 1):
if i % 2 == 0:
continue
if cnt_yaku(i):
ans += 1
return ans
def cnt_yaku(num: int):
ans = 0
for i in range(1, num + 1):
if num % i == 0:
ans += 1
return ans == 8
num = int(input())
ans = get_ans(num)
print(ans)
|
p03281 | s017401909 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
n = int(input())
def num_divisors_table(n):
table = [0] * (n + 1)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
table[j] += 1
return table
table = num_divisors_table(n)
ans = 0
for i in range(1, n + 1, 2):
if table[i] == 8:
ans += 1
print(ans) |
p03281 | s189152456 | Accepted | N = int(input())
def divisors(n):
re = 0
for i in range(1,int(n**0.5)+1):
if n % i == 0:
if n == i**2:
re += 1
else:
re += 2
return re
ans = 0
for i in range(1,N+1,2):
if divisors(i) == 8:
ans += 1
print(ans) |
p03281 | s313873882 | Accepted | import sys
input = sys.stdin.readline
N = int(input())
if N < 105 :
print(0)
elif N >= 105 and N<135 :
print(1)
elif N>= 135 and N<165 :
print(2)
elif N>=165 and N<189 :
print(3)
elif N>=189 and N<195 :
print(4)
else :
print(5) |
p03281 | s345525659 | 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())
ans = 0
for i in range(1, n+1,2):
if len(make_divisors(i)) == 8:
ans += 1
print(ans)
|
p03281 | s278107333 | Accepted | n = int(input())
count = 0
sum_of_count_8 = 0
for i in range(1,n+1,2):
count = 0
for j in range(1,n+1):
if i%j ==0:
count+=1
if count == 8:
sum_of_count_8 += 1
print(sum_of_count_8) |
p03281 | s998901555 | Accepted | def solve(n):
cnt = 0
for i in range(1,n+1):
if n%i == 0: cnt += 1
if cnt == 8: return True
else: return False
n = int(input())
ans = 0
for i in range(1, n+1, 2):
if solve(i): ans += 1
print(ans) |
p03281 | s433136456 | Accepted | N = int(input())
cnt=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,2):
if(len(make_divisors(i))==8):
cnt+=1
print(cnt) |
p03281 | s253750383 | Accepted | n = int(input())
if n<3*5*7:
ans=0
elif n<3**3*5:
ans=1
elif n<3*5*11:
ans=2
elif n<3**3*7:
ans=3
elif n<3*5*13:
ans=4
else:
ans=5
print(ans)
|
p03281 | s420776728 | Accepted | N = int(input())
B = 0
for i in range(N):
A = 0
n = int((i+1)**(1/2))
for j in range(n):
if (i+1) % (j+1) == 0:
A += 1
if A == 4 and (i+1) % 2 == 1:
B += 1
print(B)
|
p03281 | s805368253 | Accepted | from math import sqrt
N=int(input())
ans=0
for i in range(1,N+1,2):
d=[]
for j in range(1,int(sqrt(i))+1):
if i%j==0:
d.append(j)
d.append(N//j)
d=list(set(d))
if len(d)==8:
ans+=1
print(ans) |
p03281 | s437725956 | Accepted | def yaku(n):
A = []
for i in range(1,int(n**0.5)+1):
if n%i==0:
A.append(i)
A.append(n//i)
return len(A)
N = int(input())
cnt = 0
for i in range(1,N+1,2):
if yaku(i)==8:
cnt += 1
print(cnt) |
p03281 | s757129212 | Accepted | n = int(input())
result = 0
for i in range(1,n+1,2):
total = 0
for j in range(1,i+1):
if (i%j == 0):
total += 1
if(total == 8):
result += 1
#print(i,j)
print(result)
|
p03281 | s516385665 | 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 | s388222380 | Accepted | n = int(input())
def check(p):
c = 0
for i in range(1,p+1):
if p % i == 0:
c += 1
return c
ans = 0
for i in range(1,n+1):
if i % 2 == 1:
if check(i) == 8:
ans += 1
print(ans) |
p03281 | s978897110 | Accepted | N = int(input())
ans = 0
for n in range(1,N+1,2):
d = set()
m = 1
while m*m <= n:
if n%m==0:
d.add(m)
d.add(n//m)
m += 1
if len(d)==8:
ans += 1
print(ans) |
p03281 | s938568334 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1, 2):
d = 0
for k in range(1, i+1):
if i % k == 0:
d += 1
if d == 8:
ans += 1
print(ans) |
p03281 | s104717789 | Accepted | n = int(input())
ans = 0
count = 0
for i in range(1,n+1,2):
for j in range(1,i+1):
if i%j == 0:
count += 1
if count == 8:
ans += 1
count = 0
print(ans) |
p03281 | s565165407 | Accepted | import math
n = int(input())
def judge(num):
count=0
for i in range(1,num+1):
if num%i==0:
count+=1
return count
ans=0
for i in range(3,n+1,2):
if judge(i)==8:
ans+=1
print(ans)
|
p03281 | s338723727 | Accepted | N=int(input())
#https://qiita.com/LorseKudos/items/9eb560494862c8b4eb56
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):
if i%2==1 and len(make_divisors(i))==8:
count+=1
print(count) |
p03281 | s375493065 | 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]
ans = 0
N = int(input())
for n in range(1, N+1):
if n%2 != 0:
if len(make_divisors(n)) == 8:
ans += 1
print(ans) |
p03281 | s466263303 | Accepted | import math
n = int(input())
ans = 0
for i in range(1, n+1):
if i % 2 != 0:
prime_num = 0
for j in range(1, n+1):
if i % j == 0:
prime_num += 1
if prime_num == 8:
ans += 1
print(ans) |
p03281 | s981841922 | Accepted | n = int(input())
def get_divisors(n):
return [i for i in range(1, n//2+1) if n%i == 0] + [n]
ans = 0
for i in range(1, n+1, 2):
if len(get_divisors(i)) == 8:
ans += 1
print(ans) |
p03281 | s003124112 | Accepted | 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))))
|
p03281 | s419822751 | Accepted | from math import sqrt, ceil
n = int(input())
ans = 0
for i in range(1, n+1, 2):
score = 0
for d in range(1, ceil(sqrt(i))+1):
p, m = divmod(i, d)
if m == 0:
if p != d:
score += 2
else:
score += 1
if score == 8:
ans += 1
print(ans) |
p03281 | s488123055 | 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
def main():
n = int(input())
ans = 0
for i in range(1, n+1):
if i % 2 != 0 and len(divisor(i)) == 8:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p03281 | s108851286 | Accepted | def make_divisors(n):
div=[]
for i in range(1,-int(-n**0.5//1)):
if n%i==0:
div.append(i)
div.append(n//i)
if n%(n**0.5)==0:
div.append(int(n**0.5))
return div
n=int(input())
ans=[]
for i in range(1,n+1,2):
if len(make_divisors(i))==8:
ans.append(i)
print(len(ans)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.