problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03281 | s937104579 | Accepted | N = int(input())
def count(x):
c = 0
for i in range(1, x + 1):
if x % i == 0:
c += 1
return c
ans = 0
for i in range(3, N + 1, 2):
if count(i) == 8:
ans += 1
print(ans) |
p03281 | s271582800 | Accepted | N = int(input())
cN = 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:
cN += 1
print(cN)
|
p03281 | s246214020 | Accepted | n=int(input())
s=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):
s+=1
print(s)
|
p03281 | s900789519 | 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 | s675568029 | Accepted | N = int(input())
count = 0
total_count = 0
for i in range(1,N+1):
for j in range(1,N+1):
if i % j == 0:
count += 1
if count == 8 and i % 2 == 1:
total_count += 1
count = 0
print(total_count) |
p03281 | s073226236 | Accepted | n=int(input())
list=[]
for i in range(1,n+1,2):
count=0
for j in range(1,i+1,1):
if i%j==0:
count+=1
if count==8:
list.append(i)
print(len(list)) |
p03281 | s157140645 | Accepted | ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
n = ii()
cnt = 0
for i in range(n,16,-1):
if(i % 2 == 0):
continue
cnt2 = 0
for j in range(3,i+1):
if(i%j == 0):
cnt2 +=1
if cnt2 == 7:
cnt += 1
print(cnt) |
p03281 | s882843314 | 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())
ans = 0
for i in range(1, N+1, 2):
if len(make_divisors(i))==8:
ans += 1
print(ans) |
p03281 | s978945113 | 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 | s816272320 | 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 | s173284264 | 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 | s360832355 | Accepted | S=int(input())
count=0
for i in range(1,S+1,2):
a=0
for j in range(1,i+1):
if i % j ==0:
a+=1
if a==8:
count+=1
print(count) |
p03281 | s423946740 | Accepted | l = [3*5*7, 3*5*11, 3*5*13, 3**3*5, 3**3*7]
n = int(input())
ans = 0
for i in l:
if i <= n:
ans += 1
print(ans) |
p03281 | s953545433 | Accepted | n = int(input())
cnt = 0
def sympy(num):
l = []
for i in range(1, num+1):
for j in range(1, num+1):
if (i % 2 != 0) and (i*j == num):
l.append(i)
return l
for i in range(1, n+1):
l = sympy(i)
if (i % 2 != 0) and (len(l) == 8):
cnt += 1
print(cnt) |
p03281 | s237395016 | Accepted |
N = int(input())
ans = 0
for n in range(1, N+1):
cnt = 0
for i in range(1, n+1):
if (n % i == 0) and (n % 2 == 1):
cnt += 1
if cnt == 8:
ans += 1
print(ans)
|
p03281 | s642480087 | Accepted | n=int(input())
if 105<=n<135:
print(1)
elif 135<=n<165:
print(2)
elif 165<=n<189:
print(3)
elif 189<=n<195:
print(4)
elif 195<=n:
print(5)
else:
print(0)
|
p03281 | s708132795 | Accepted | n = int(input())
ans = 0
for j in range(1,n+1):
if j %2 ==0:
continue
div = []
for i in range(2,j+1):
if j % i ==0:
count = 0
while j%i==0:
j = j//i
count += 1
div.append(count)
if j == 1:
break
if div == [1,1,1] or div == [1,3] or div ==[3,1]:
ans += 1
print(ans)
|
p03281 | s457508952 | Accepted | import sys
n = int(sys.stdin.readline().rstrip("\n"))
count = 0
for num in range(27, n+1, 2):
divisor = 1
for p in range(1, num, 2):
if num % p == 0:
divisor += 1
if divisor == 8:
count += 1
print(count)
|
p03281 | s289863526 | 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):
if i % 2 == 1:
if len(make_divisors(i)) == 8:
ans += 1
print(ans)
|
p03281 | s678059953 | Accepted | N = int(input())
ans = 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:
ans += 1
print(ans) |
p03281 | s075052522 | 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 | s709024273 | Accepted | N=int(input())
i=1
ans=0
while i<=N:
j=1
count=0
while j<=i:
count+=1*(i%j==0)
j+=1
ans+=1*(count==8)
i+=2
print(ans) |
p03281 | s776331798 | Accepted |
n = int(input())
def f(x):
count = 0
for i in range(1,x+1):
if x % i == 0:
count += 1
return count
ans = 0
for i in range(1,n+1):
if f(i) == 8 and i % 2 == 1:
ans += 1
print(ans)
|
p03281 | s719424940 | Accepted | n=int(input())
res=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:
res+=1
print(res) |
p03281 | s641334877 | Accepted | 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)
|
p03281 | s049531084 | 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 | s107376780 | Accepted | n = int(input())
ans=0
for i in range(1,n+1,2):
a=0
for j in range(1,i+1,2):
if i%j==0:
a+=1
if a==8:
ans+=1
print(ans)
|
p03281 | s363160043 | Accepted | n = int(input())
ans = 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:
ans += 1
print(ans) |
p03281 | s672564469 | Accepted | n=int(input())
#[105,135,165,189,195]
if n<105: print(0)
elif n<135: print(1)
elif n<165: print(2)
elif n<189: print(3)
elif n<195: print(4)
else: print(5)
|
p03281 | s595396962 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1, 2):
num = 0
for j in range(1, i+1):
if i % j == 0:
num += 1
if num == 8:
ans += 1
print(ans)
|
p03281 | s214616435 | 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]
ans=0
for x in range(n+1):
if x%2==1:
s=make_divisors(x)
if len(s)==8:
ans+=1
print(ans) |
p03281 | s687499256 | 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 | s946684070 | Accepted | N=int(input())
count = 0
count2 = 0
for i in range(1,N+1):
#print(i,"i")
for j in range(1,N+1):
#print(j,"k")
if i % j == 0 :
count += 1
#print(count,"count")
if count == 8 and i%2 != 0:
count2 += 1
ans = count2
count = 0
print(ans)
|
p03281 | s111950172 | Accepted | n = int(input())
cnt = 0
lista = [0] * (n + 1)
# 奇数のみ
for i in range(1, n + 1, 2):
# 3 * 1, 3 * 3, 3 * 5...
for j in range(i, n + 1, 2 * i):
lista[j] += 1
for i in range(n + 1):
if lista[i] == 8:
cnt += 1
print(cnt)
|
p03281 | s150214189 | 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 | s410414094 | 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
a=int(input())
b=0
for i in range(1,a+1,2):
if len(make_divisors(i))==8:
b+=1
print(b) |
p03281 | s526844750 | Accepted | N = int(input())
def yakusuu(a):
b = 0
if a % 2 == 1:
for i in range(1,a+1):
if a % i == 0:
b += 1
return b
else:
return 0
ans = 0
for i in range(1,N+1):
if yakusuu(i) == 8:
ans += 1
print(ans) |
p03281 | s958599080 | Accepted | import math
n = int(input())
def factors(a):
b = int(math.sqrt(a))
f = []
for i in range(1, b+1):
if a % i == 0:
f.append(i)
f.append(a//i)
return len(f)
def solve():
if n < 105:
print(0)
return
ans = 0
for i in range(105, n+1, 2):
if factors(i) == 8:
ans += 1
print(ans)
solve()
|
p03281 | s455460969 | Accepted | N = int(input())
def f(v):
cnt = 0
for i in range(1, v + 1):
if v % i == 0:
cnt += 1
return cnt
ans = 0
for i in range(1, N + 1, 2):
if f(i) == 8:
ans += 1
print(ans)
|
p03281 | s342935474 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1, 2):
divisor_num = 0
for j in range(1, i+1):
if i % j == 0:
divisor_num += 1
if divisor_num == 8:
ans += 1
print(ans)
|
p03281 | s686842092 | Accepted | def solve(x):
if x%2==0:return False
res = 0
for i in range(x):
if x%(i+1)==0:res += 1
return res == 8
n = int(input())
ans = 0
for i in range(n):
if solve(i+1):ans+=1
print(ans) |
p03281 | s980302217 | Accepted | n = int(input())
ans = 0
def ok(x):
res = 0
i = 1
while i*i <= x:
if x%i == 0:
res+=1
if i!=x//i:res+=1
i+=1
return res == 8
for i in range(1,n+1,2):
ans+=ok(i)
print(ans)
|
p03281 | s511523709 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1, 2):
count = 1
for j in range(1, int(i/2)+2, 2):
if (i/j).is_integer():
count += 1
if count == 8:
ans += 1
print(ans) |
p03281 | s589659486 | 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
def main():
n = int(input())
cnt = 0
for i in range(1,n+1,2):
if len(make_divisors(i)) == 8:
cnt+=1
print(cnt)
if __name__ == '__main__':
main()
|
p03281 | s297278909 | Accepted | n = int(input())
ans = 0
if n >= 105:
for i in range(105, n+1, 2):
count_yakusuu = 0
for j in range(1, int(i**0.5)+1):
if i % j == 0:
count_yakusuu += 2
if count_yakusuu == 8:
ans += 1
print(ans)
|
p03281 | s380898122 | Accepted | N=int(input())
ans=0
for i in range(1,N+1,2):
div=0
for j in range(1,i+1):
if i%j==0:
div=div+1
if div==8:
ans+=1
print(ans) |
p03281 | s295199553 | 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 | s802991063 | 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 | s296573216 | Accepted | # B
# 2020/03/09 0:11-
n = int(input())
def yakusu(x):
l = []
for i in range(1, x+1):
if x%i == 0:
l.append(i)
return l
count = 0
for i in range(1, n+1):
A = yakusu(i)
if len(A) == 8 and i%2 == 1:
count += 1
print(count) |
p03281 | s799281742 | Accepted | n=int(input())
app=[]
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:
app.append(i)
print(len(app)) |
p03281 | s919699343 | Accepted | n=int(input())
ans=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:
ans+=1
print(ans)
|
p03281 | s655539714 | 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 | s396706860 | Accepted | def divisor_list(n):
ret = set()
i = 1
while i * i <= n:
if n % i == 0:
ret.add(i)
ret.add(n // i)
i += 1
return ret
N = int(input())
ans = 0
for i in range(N+1):
A = divisor_list(i)
oddcnt = 0
for a in A:
if a % 2 == 1:
oddcnt += 1
if oddcnt == 8:
ans += 1
print(ans) |
p03281 | s577334347 | 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
cnt=0
for i in range(1,n+1,2):
if len(make_divisors(i))==8:
cnt+=1
print(cnt) |
p03281 | s875569074 | Accepted | 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) |
p03281 | s923205741 | 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):
if i % 2 == 1 and len(make_divisors(i)) == 8:
ans += 1
print(ans) |
p03281 | s039172515 | Accepted | n = int(input())
cnt = 0
for i in range(1, n+1):
if i % 2 == 1:
l = []
for d in range(1, i+1):
if i % d == 0:
l.append(d)
if len(l) == 8:
cnt += 1
print(cnt) |
p03281 | s415401661 | Accepted | i_n = int(input())
nu = 0;
for i in range(1,i_n+1):
cnt = 0
for j in range(1,i+1):
if i%j==0:
cnt+=1
if cnt == 8 and i%2 != 0:
nu += 1
print(nu) |
p03281 | s712649968 | Accepted | n=int(input())
ans=0
for j in range(1,n+1,2):
count=0
for i in range(1,j+1):
if j%i==0:
count+=1
if count==8:
ans+=1
print(ans) |
p03281 | s433946008 | Accepted | def fn(a):
alist =[]
for i in range(1,a+1):
if a%i == 0:
alist.append(i)
return len(alist)
n = int(input())
anslist =[]
for i in range(1,n+1):
if fn(i) == 8 and i%2 == 1:
anslist.append(i)
print(len(anslist))
|
p03281 | s491365957 | 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())
s = list(range(1,N+1,2))
ans = 0
for i in s:
if len(make_divisors(i)) == 8:
ans += 1
print(ans) |
p03281 | s694381246 | 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 | s623861402 | Accepted | N = int(input())
def divisor(n):
res = []
i = 1
while i*i <= n:
if n % i == 0:
res.append(i)
if i != n//i:
res.append(n // i)
i += 1
return res
ans = 0
for i in range(1, N+1, 2):
res = len(divisor(i))
ans += 1 if res == 8 else 0
print(ans)
|
p03281 | s249708162 | Accepted | n=int(input())
import math
ans=0
def yakusu(n):
ans_local=set()
for i in range(1,int(math.sqrt(n))+1):
if n%i==0:
ans_local = ans_local | set([i,n//i]) #setなので平方数でもOK
return list(ans_local) #必要に応じてsort
for i in range(1,n+1,2):
if len(yakusu(i))==8:
ans+=1
print(ans) |
p03281 | s887143354 | Accepted | n=int(input())
ans=0
o=[a for a in range(1,n+1) if a%2==1]
for i in o:
c=0
for j in range(1,i+1):
if i%j==0:
c+=1
if c==8:
ans+=1
print(ans) |
p03281 | s191937662 | Accepted | N = int(input())
ans = 0
count = 0
#1の約数の数は絶対1、面倒なので2~Nのカウントにした。+1忘れないように
for i in range(2, N+1):
for j in range(1, i+1):
if i % j == 0:
count += 1
if count == 8 and i % 2 == 1:
ans += 1
count = 0
print(ans) |
p03281 | s794406260 | Accepted | import math
ans = 0
n = int(input())
for i in range(1,n+1,2):
count = 0
for j in range(1,int(math.sqrt(i))+1):
if i%j==0:
count+=1
if count*2 == 8:
ans += 1
print(ans) |
p03281 | s090401506 | Accepted | n = int(input())
ans = 0
i = 1
while i <=n:
j = 1
cnt = 0
while j <= i:
if i%j == 0:
cnt +=1
#print(i,cnt,j)
j +=1
if cnt == 8 and i%2 ==1:
#print(i)
ans += 1
i +=1
print(ans) |
p03281 | s573154688 | 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 | s763308037 | Accepted | def main():
n = int(input())
count = 0
x_list =[3**3*5, 3**3*7, 3*5*7, 3*5*11, 3*5*13]
for one in x_list:
if one<=n:
count+=1
print(count)
if __name__=="__main__":
main()
|
p03281 | s687586582 | Accepted | N = int(input())
ans = 0
for n in range(1, N+1):
cnt = 0
if n % 2 == 1:
for i in range(1, N+1):
if n % i == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) |
p03281 | s457214714 | Accepted | n = int(input())
ans = 0
for x in range(1, n + 1, 2):
res = 0
for y in range(1, n + 1):
if x % y == 0:
res += 1
if res == 8:
ans += 1
print(ans)
|
p03281 | s774203556 | Accepted | N = int(input())
if N < 105:
ans = 0
elif N == 105:
ans = 1
else:
ans = 1
for n in range(106, N+1):
if n % 2 == 0:
continue
count = 0
for i in range(1, int(n**(1/2))+1):
if n % i == 0:
count += 1
if count == 4:
ans += 1
print(ans)
|
p03281 | s319105554 | Accepted | def count_divisor(n):
count = 0
for i in range(1, n+1):
if n % i == 0:
count += 1
return count
def main():
n = int(input())
ans = 0
for i in range(1, n+1, 2):
if count_divisor(i) == 8:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p03281 | s998197882 | Accepted | n = int(input())
X = [int(x) for x in range(1,n+1,2)]
ans = 0
for x in X:
a = 0
for i in range(1,n+1):
if x % i == 0:
a += 1
if a == 8 :
ans += 1
print(ans)
|
p03281 | s793008800 | Accepted | n,ans=int(input()),0
for i in range(1,n+1,2):
divisor=[]
for j in range(1,int(i**0.5)+1,2):
if i % j == 0:
divisor.append(j)
if j != i // j:
divisor.append(i//j)
if len(divisor) == 8:
ans += 1
print(ans) |
p03281 | s736907032 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1, 2):
tmp = 0
for j in range(1, N+1):
if i % j == 0:
tmp += 1
if tmp == 8:
ans += 1
print(ans)
|
p03281 | s276081376 | Accepted | n=int(input())
num=[3*5*7,3*3*3*5,3*5*11,3*3*3*7,3*5*13]
ans=0
for i in range(5):
if n>=num[i]:
ans+=1
else:
break
print(ans) |
p03281 | s154400087 | Accepted | N=int(input())
cnt = 0
ans = 0
for i in range(1,N+1):
if i % 2 != 0:
for j in range(1,i+1):
if i%j == 0:
cnt += 1
#print(j)
if cnt == 8:
ans += 1
cnt = 0
print(ans)
|
p03281 | s828833823 | Accepted | n = int(input())
answer = []
for i in range(1,n+1,2):
check = 0
for j in range(1,i+1):
if (i) % j == 0:
check += 1
if check == 8:
answer.append(i)
print(len(answer)) |
p03281 | s744072469 | Accepted | 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)
|
p03281 | s935552594 | Accepted | N = int(input())
a = 0
for i in range(1,1+N,2):
n = 0
for j in range(1,1+i,2):
if i%j==0:
n+=1
if n==8:
a+=1
print(a) |
p03281 | s139722084 | Accepted | n = int(input())
count = 0
for i in range(1, n + 1):
check = 0
if(i % 2 == 1):
for j in range(1, i + 1):
if(i % j == 0):
check += 1
if(check == 8):
count += 1
print(count)
|
p03281 | s384445024 | Accepted | n = int(input())
count = 0
def divs(n:int):
divs = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divs.append(i)
if i != n // i:
divs.append(n//i)
# divs.sort()
return divs
for i in range(1,n+1,2):
if len(divs(i)) == 8:
count += 1
print (count) |
p03281 | s516520556 | Accepted | def get_divisors(n):
div = []
append = div.append
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
append(i)
if i != n // i:
append(n // i)
div.sort()
return div
# input
N = int(input())
# check
cnt = 0
for n in range(1, N + 1, 2):
div = get_divisors(n)
if len(div) == 8:
cnt += 1
print(cnt) |
p03281 | s095250030 | Accepted | import numpy as np
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 | s788465696 | Accepted | N = int(input())
def divisors(n):
divisors = []
for i in range(1, n // 2 + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
return set(divisors)
c = 0
for i in range(1, N + 1):
if len(divisors(i)) == 8 and i % 2:
c += 1
print(c)
|
p03281 | s168312614 | 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 | s079816111 | 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 | s432404774 | Accepted | 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 = c + 1
if c == 8:
ans = ans + 1
print(ans)
|
p03281 | s990408737 | Accepted | n=int(input())
def yakusu(n):
L=[]
for i in range(1,int(n**0.5)+1):
if n%i==0:
if i not in L:
L.append(i)
if n//i not in L:
L.append(n//i)
return len(L)
c=0
for i in range(1,n+1,2):
if yakusu(i)==8:
c+=1
print(c) |
p03281 | s560163957 | 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 len(divisors)
n=int(input())
ans=0
for i in range(1,n+1,2):
if make_divisors(i)==8:
ans+=1
print(ans) |
p03281 | s788829650 | Accepted | n = int(input())
ans = 0
for i in range(1,n+1)[::2]:
p = 0
for j in range(1,i+1):
if i % j == 0:
p += 1
if p == 8:
ans += 1
print(ans) |
p03281 | s586413929 | 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 | s431508855 | Accepted | # 引数nが持つ正の約数の数を調べる
def divisor_count(n:int) -> int:
count = 0
for x in range(1, n+1):
if n % x == 0:
count += 1
return count
def solve(n: int) -> int:
# [1..N]内で奇数かつ約数をちょうど8個持つ数字の数
result = 0
for x in range(1, n+1):
if x&1 and divisor_count(x) == 8:
result += 1
return result
N = int(input())
print(solve(N)) |
p03281 | s284959861 | Accepted | 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()
ans = 0
if n < 105:
print(0)
exit
else:
for i in range(105, n+1, 2):
cnt = 0
for q in range(1,i+1):
if i % q == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) |
p03281 | s766624981 | Accepted | n = int(input())
if n<105:
print(0)
exit()
if n==105:
print(1)
exit()
res=1
for i in range(107,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:
res+=1
print(res) |
p03281 | s887713957 | Accepted | def div(n):
if n==1:s=1
else:s=2
for i in range(2,n):
if n%i==0:s+=1
return s
n=int(input())
ans=0
for i in range(1,n+1,2):
if div(i)==8:ans+=1
print(ans) |
p03281 | s689663092 | Accepted | from math import sqrt
N = int(input())
ans = 0
for M in range(105,N+1,1):
if M%2==0:
continue
count=0
for i in range(1,int(sqrt(M))+2,1):
if M % i ==0:
if M % i == 0:
count+=2
if count==8:
ans+=1
print(ans) |
p03281 | s561975195 | Accepted | N = int(input())
A = [105, 135, 165, 189, 195]
print(sum([1 for a in A if a <= N]))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.