problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03281 | s016565973 | 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 | s408325853 | Accepted | prime = [3, 5, 7, 11, 13, 17]
N = int(input())
ans = 0
for i in range(1, N+1, 2):
a = 1; x = i
for j in range(6):
n = prime[j] #; print(i, n)
w = 0
while x%n == 0:
x = x//n
w += 1
a *= w + 1
if x == 1:
break
if a == 8:
ans += 1
print(ans) |
p03281 | s472454608 | Accepted | N=int(input())
num=0
cdcount=0
count=0
for i in range(N):
num=i+1
for j in range(num):
if (num%(j+1)==0):
cdcount=cdcount+1
if (cdcount==8)and(num%2==1):
count=count+1
cdcount=0
print(count) |
p03281 | s828271854 | Accepted | #!/usr/bin/env python3
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())
if N < 105:
print(0)
exit()
elif N == 105:
print(1)
exit()
ans = 1
for n in range(107, N+1, 2):
if len(make_divisors(n)) == 8:
ans += 1
print(ans)
|
p03281 | s245171384 | 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 | s188755949 | 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(7, N+1, 2):
cnt = len(make_divisors(i))
if cnt == 8:
ans += 1
print(ans)
|
p03281 | s973059263 | Accepted | n = int(input())
res = 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 == 1:
res += 1
print(res) |
p03281 | s493152784 | Accepted | N=int(input())
res=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)
return divisors
if N<105:
print('0')
else:
for i in range(105,N+1,2):
if len(make_divisors(i))==8:
res+=1
print(res) |
p03281 | s918458903 | Accepted | N=int(input())
ans = 0
for i in range(1,N+1):
cnt=0
if i%2!=0:
for j in range(1,i+1):
if i % j ==0:
cnt+=1
if cnt==8:
ans+=1
print(ans) |
p03281 | s458721161 | Accepted | import sys
input=sys.stdin.readline
def main():
cnt = 0
n = int(input())
for i in range(1,n+1,2): # 奇数だけ繰り返す
k = 0
for m in range(1,i+1):
if i % m == 0:
k += 1
if k == 8:
cnt += 1
print(cnt)
if __name__=="__main__":
main()
|
p03281 | s465598393 | 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:
ans += 1
if ans == 8:
count += 1
ans = 0
ans = 0
print(count) |
p03281 | s141548801 | Accepted | N = int(input())
ans=0
for i in range(1,N+1):
howyaku=0
if i%2==0:
continue
for k in range(1,int(i**0.5)+1):
if i%k==0:
howyaku+=1
if k != i//k:
howyaku+=1
if howyaku==8:
ans+=1
print(ans)
|
p03281 | s843724700 | Accepted | n = int(input())
def divisor_count(n):
i = 1
count = 0
while(i * i <= n):
if n % i == 0:
count += 1
if n != i * i:
count += 1
i += 1
return count
result = 0
for i in range(1, n + 1):
if i % 2 == 1 and divisor_count(i) == 8:
result += 1
print(result)
|
p03281 | s096056504 | Accepted | n=int(input())
a=[0]*(n+1)
for i in range(1,n+1,2):
for j in range(1,n+1):
if i%j==0:
a[i]+=1
print(a.count(8)) |
p03281 | s277051801 | Accepted | n = int(input())
ans = 0
for i in range(8, n+1):
#8回割れるかどうか
divisor_cnt = 0
for j in range(1, n+1):
if i % j == 0 and j % 2 == 1:
divisor_cnt += 1
if divisor_cnt == 8:
ans += 1
print(ans)
|
p03281 | s345646435 | 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 | s498721073 | Accepted |
def main():
n = int(input())
# 奇数の数列生成
odd = [i for i in range(1, n+1, 2)]
res = 0
for i in odd:
cnt = 0
for j in range(1, i+1, 2):
if i % j == 0:
cnt += 1
if cnt == 8:
res += 1
print(res)
if __name__ == "__main__":
main() |
p03281 | s475104384 | Accepted | N=int(input())
#奇数
ki=[i for i in range(1,N+1,2)]
yakusuu=[]
ans=[]
for i in ki:
for j in range(1,i+1):
if i%j==0:
yakusuu.append(j)
else:
ans.append(str(len(yakusuu)))
yakusuu=[]
print(ans.count("8"))
|
p03281 | s381368476 | Accepted | if __name__ == '__main__':
n = int(input())
cnt = 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:
cnt += 1
tmp = 0
print(cnt) |
p03281 | s033091755 | Accepted | def I(): return int(input())
N = I()
ans = 0
if N>=105:
for i in range(105,N+1):
yakusuu = []
if i%2==1:
for j in range(1,int(i**0.5)+1):
if i%j==0:
yakusuu.append(j)
yakusuu.append(i//j)
if len(yakusuu)==8:
ans += 1
print(ans) |
p03281 | s280062109 | Accepted | def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
n=n0()
ans=0
for k in range(105,n+1,2):
c=0
for i in range(1,int(k**0.5)+1):
if k%i==0:
c+=2
if i**2==k:
c-=1
if c==8:
ans+=1
print(ans) |
p03281 | s590011178 | Accepted | n = int(input())
ans = 0
L = [0]*200
for i in range(1,n+1,2):
tmp = 1
cnt = 0
while tmp <= i:
if i % tmp == 0:
cnt += 1
tmp += 1
L[i] = cnt
print(L.count(8)) |
p03281 | s147776685 | Accepted | def is_div_8(x):
if x % 2 == 0:
return False
count = 0
for j in range(1, x + 1):
if x % j == 0:
count += 1
if count == 8:
return True
else:
return False
N = int(input())
count = 0
for i in range(1, N + 1):
if is_div_8(i):
count += 1
print(count)
|
p03281 | s886838147 | Accepted | def 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())
cnt=0
for i in range(1,n+1,2):
if len(divisors(i))==8:
cnt+=1
print(cnt) |
p03281 | s693907927 | Accepted | n=int(input())
c=0
ans=0
for i in range(1,n+1):
if i%2==1:
for j in range(1,n+1):
if i%j==0:
c+=1
if c==8:
ans+=1
c=0
print(ans) |
p03281 | s711705446 | Accepted | N = int(input())
def func(x):
if x % 2 == 0:
return 0
cnt = 0
for i in range(1, x + 1):
if x % i == 0:
cnt += 1
if cnt == 8:
return 1
else:
return 0
ans = 0
for i in range(1, N + 1):
ans += func(i)
print(ans)
|
p03281 | s312266380 | Accepted | import math
N=int(input())
res=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):
res+=1
print(res) |
p03281 | s021925958 | Accepted | import math
n = int(input())
ans = 0
if n < 105:
print(0)
else:
for i in range(105, n +1):
if i % 2 == 0:
continue
div = []
for j in range(1, int(math.sqrt(i**2) + 1)):
if i % j == 0:
div.append(j)
if j != i // j:
div.append(i //j)
if len(div) // 2 == 8:
ans += 1
print(ans) |
p03281 | s192015914 | 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 i%2==1 and cnt==8:
ans+=1
print(ans) |
p03281 | s551973342 | 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())
count = 0
for i in range(1, n+1, 2):
if len(make_divisors(i)) == 8:
count += 1
print(count) |
p03281 | s694088648 | 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 | s204972394 | Accepted | N=int(input())
cnt=0
for i in range(1,N+1,2):
count=0
for t in range(1,i+1):
if i%t==0:
count+=1
else:
continue
if count==8:
cnt+=1
print(cnt) |
p03281 | s321914174 | Accepted | N = int(input())
ans = 0
for i in range(1,N+1):
if i%2 == 1:
y = 0
for j in range(1,i+1):
if i%j == 0:
y += 1
if y == 8:
ans += 1
print(ans) |
p03281 | s763070476 | Accepted | # 約20分
# 簡単な問題なのだがパッと正確にイメージできていない
n = int(input())
l = []
for j in range(1,n+1):
if j%2 != 0:
l.append(j)
b = 0
for i in l:
a = 0
for k in range(1,i+1):
if i%k == 0:
a += 1
if a == 8:
b += 1
print(b)
|
p03281 | s949867330 | Accepted | N = int(input())
result=0
for i in range(1,N+1,2):
j= i+1
cnt=0
for k in range(1,j):
if i % k==0:
cnt+=1
if cnt>8:
break
if cnt == 8:
result+=1
print(result)
|
p03281 | s121795094 | Accepted | n = int(input())
ans = 0
for x in range(1,n+1,2):
cou = 0
for j in range(1,x+1):
if x % j == 0:
cou += 1
if cou == 8:
ans += 1
print(ans) |
p03281 | s538730132 | Accepted | n = int(input())
ans = 0
for i in range(1,n+1):
if i % 2 == 0:
continue
count = 0
for j in range (1,i+1):
if i % j == 0:
count += 1
if count == 8:
ans += 1
print(ans) |
p03281 | s119552429 | Accepted | import math
N = int(input())
ans = 0
for m in range(1,N+1,2):
P = set([1,m])
for k in range(2,math.floor(math.sqrt(m))+1):
if m % k == 0:
P.add(k)
P.add(m//k)
if len(P) == 8:
ans += 1
print(ans)
|
p03281 | s972115049 | Accepted | n=int(input())
ans=0
count=0
for i in range(1,n+1):
if i%2 == 1:
for j in range(1,i+1):
if i%j == 0:
count += 1
if count == 8:
ans += 1
count = 0
print(ans) |
p03281 | s870702747 | Accepted | N = int(input())
sup = (N + 1) // 2
con = 0
ans = 0
if N < 105:
print(ans)
else:
for i in range(1,N + 1,2):
for j in range(1,max(i // 2 + 1,2)):
if i % j == 0:
con +=1
if con == 7:
ans += 1
con = 0
print(ans) |
p03281 | s860220377 | 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 | s138554949 | Accepted | def make_d(n):
d = []
for i in range(1,int(n**(0.5))+1):
if n%i == 0:
d.append(i)
d.append(n//i)
return d
ans = 0
for i in range(1,int(input())+1):
if i % 2 == 0:
continue
if len(make_d(i)) == 8:
ans += 1
print(ans) |
p03281 | s393671607 | Accepted | N = int(input())
ans = 0
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 += 1
print(ans)
|
p03281 | s557175457 | 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 | s571108474 | Accepted | 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) |
p03281 | s850093056 | Accepted | # B - 105
def yakusu_rekkyo(n):
yakusu = set()
for i in range(1, int(pow(n, 0.5)+1)):
if n%i == 0:
yakusu.add(i)
yakusu.add(n//i)
return yakusu
N = int(input())
ans = 0
for i in range(105, N+1, 2):
Y = yakusu_rekkyo(i)
if len(Y) == 8:
ans += 1
print(ans) |
p03281 | s714538864 | Accepted | N=int(input())
res = 0
def checkOdd(N):
k = 0
for i in range(1,N+1):
if N % i ==0:
k += 1
if k == 8:
return True
else:
return False
if N<104:
print(res)
else:
for i in range(105,N+1,2):
if checkOdd(i):
res += 1
print(res) |
p03281 | s902837765 | Accepted | N = int(input())
cnt=0
ans=0
for i in range(1,N+1,2):#iは対象となる奇数
for j in range(1,i+1):
if i%j ==0:
cnt+=1
if cnt ==8:
ans+=1
cnt =0
print(ans) |
p03281 | s421862792 | Accepted |
N = int(input())
has8 = [0] * 201
for num in range(1,201):
cnt = 0
if num % 2 == 1:
for m in range(1,num+1):
if num % m == 0:
cnt += 1
if cnt == 8:
has8[num] = 1
total = [0] * 201
for i in range(1,201):
total[i] = total[i-1] + has8[i]
print(total[N]) |
p03281 | s189479700 | Accepted | n=int(input())
ans=0
m=0
for i in range(1,n+1):
m=0
for j in range(1,i+1):
if i%j==0:
m+=1
if i%2==1 and m==8:
ans+=1
print(ans)
|
p03281 | s652873267 | Accepted | def factors(n):
d, res = 1, 0
while d*d <= n:
if n % d == 0:
if d*d == n:
res += 1
else:
res += 2
d += 1
return res
N = int(input())
ans = 0
for i in range(1,N+1,2):
if factors(i) == 8:
ans += 1
print(ans) |
p03281 | s960702050 | Accepted | n = int(input())
cnt = 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:
cnt +=1
print(cnt) |
p03281 | s586938204 | 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):
c = make_divisors(i)
if len(c) == 8:
ans += 1
print(ans) |
p03281 | s997308492 | Accepted | N = int(input())
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) |
p03281 | s544896018 | Accepted | def divisor(x):
ret=[]
for i in range(1,x+1):
if x%i==0:
ret.append(i)
return len(ret)
ans=0
n=int(input())
for i in range(1,n+1):
if divisor(i)==8 and i%2==1:
ans+=1
print(ans)
|
p03281 | s236772443 | 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 | s274530991 | Accepted | N=int(input())
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
counter = 0
for i in range(1,N+1,2):
if len(divisor(i)) == 8:
counter += 1
print(counter) |
p03281 | s800632748 | Accepted | 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
N = int(input())
ans = 0
for i in range(1,N+1,2):
if len(divisor_all(i))==8:
ans += 1
print(ans) |
p03281 | s959667044 | 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 | s692455323 | Accepted | N = int(raw_input())
ans = 0
for i in range(1, N+1):
num = 0
if i%2 != 0:
for j in range(1, N+1):
if i%j == 0:
num = num + 1
# print i, num
if num == 8:
ans = ans + 1
print ans
|
p03281 | s818260420 | Accepted | def wari(a,i):
if(a%i == 0):
return 1
else:
return 0
def yakusum(n):
sum = 1
for i in range(1,n//2):
sum += wari(n,i)
return sum
n = int(input())
sum = 0
for i in range(105,n+1,2):
if yakusum(i) == 8:
sum += 1
print(sum)
|
p03281 | s463325065 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1, 2):
divisor = 0
for j in range(1, i+1):
if i % j == 0:
divisor += 1
if divisor == 8:
ans += 1
print(ans)
|
p03281 | s228008460 | Accepted | import math
N=int(input())
ans=0
for i in range(1,N+1):
if i%2==0:
continue
cnt=0
for k in range(1,i+1):
if i%k==0:
cnt+=1
if cnt==8:
ans+=1
print(ans) |
p03281 | s242710352 | Accepted | n=input()
n=int(n)
s=0
for i in range(1,n+1):
p=0
if i%2==0:
continue
for j in range(1,i+1):
if i%j==0:
p+=1
if p==8:
s+=1
print(s) |
p03281 | s469214874 | Accepted | import math
N = int(input())
count = 0
def divisoros_count(n):
num = 0
for i in range(1,int(math.sqrt(n))+1):
if n % i == 0:
num += 1
if n != i**2:
num += 1
return num
for i in range(1,N+1,2):
if divisoros_count(i) == 8:
count += 1
print(count) |
p03281 | s817194623 | Accepted | #105という数は, 非常に特殊な性質を持つ - 奇数なのに, 約数が 8個もある.
#さて, 1以上 N以下の奇数のうち, 正の約数を ちょうど 8個持つようなものの個数を求めよ.
#1<=N<=200
N = int(input())
Nlist = list(range(1,N+1, 2))
ans = 0
for n in Nlist:
tmp = 1
for i in range(1, (N+1)//2):
if n % i == 0:
tmp += 1
if tmp == 8:
ans += 1
print(ans) |
p03281 | s984605177 | 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 | s923429960 | Accepted | n=int(input())
def yakusuu(n):
num=0
if n%2==1:
for i in range(1,n+1):
if n%i==0:
num=num+1
return num
ans=0
for i in range(n+1):
if yakusuu(i)==8:
ans=ans+1
print(ans)
|
p03281 | s101346971 | Accepted | import itertools
sosuu = [3,5,7,11,13]
n=(int)(input())
count = 0
for i in itertools.combinations(sosuu, 3):
if i[0] * i[1] * i[2] <= n:
#print(i)
count += 1
add = 2 if n >= 189 else (1 if n >= 135 else 0)
print(count + add) |
p03281 | s496061337 | Accepted | n=int(input())
count=0
for i in range(1,n+1):
if i%2==1:
yakusuu=0
for j in range(1,int((i**0.5)//1)+1):
if i%j==0:
if j**2==i:
yakusuu+=1
else:
yakusuu+=2
if yakusuu==8:
count+=1
print(count) |
p03281 | s171866059 | Accepted | N=int(input())
if 1<=N and N<=104 :
print(0)
elif N<=134 :
print(1)
elif N<=164 :
print(2)
elif N<=188 :
print(3)
elif N<=194 :
print(4)
else :
print(5)
|
p03281 | s344248276 | Accepted | def divisor(num):
ret = 0
for i in range(1, num+1):
if(num%i == 0): ret += 1
return ret
n = int(input())
if(n <= 105):
if(n==105): print(1)
else: print(0)
exit()
res = 1
for i in range(106, n+1):
if(divisor(i) == 8 and i%2==1): res += 1
print(res) |
p03281 | s061187336 | Accepted | number = int(input())
num_eight_divisors = 0
numbers = list(range(9, number + 1, 2))
for i in range(9, number + 1, 2):
divisors = [1, i]
for j in range(2, i):
q, mod = divmod(i, j)
if mod == 0:
divisors.append(j)
divisors.append(q)
if len(set(divisors)) == 8:
num_eight_divisors = num_eight_divisors + 1
print(num_eight_divisors)
|
p03281 | s051089173 | Accepted | n=int(input())
ans=0
for i in range(1,n+1,2):
cou=0
for j in range(1,n+1):
if i%j==0:
cou+=1
if cou==8:
ans+=1
print(ans) |
p03281 | s038388928 | Accepted | n = int(input())
l = [i for i in range(1, n+1) if i % 2 == 1]
ans = 0
for i in l:
cnt = 0
for x in range(1, i+1):
if i % x == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans)
|
p03281 | s421667123 | Accepted | def solve(N):
allcount=0
if N<105:
return allcount
for i in range(105,N+1,2):
count=0
for j in range(1,i+1):
if i%j==0:
count += 1
if count==8:
allcount += 1
return allcount
N=int(input())
print(solve(N)) |
p03281 | s690207644 | 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):
#print(i)
ans+=1
print(ans) |
p03281 | s628036535 | Accepted | n = int(input())
def make_divisors(n):
x = 0
i = 1
while i*i <= n:
if n % i == 0:
x += 1
if i != n // i:
x += 1
i += 1
return x
s = 0
for i in range(1, n+1, 2):
#print(make_divisors(i))
if make_divisors(i) == 8:
s += 1
print(s) |
p03281 | s700366006 | Accepted | n=int(input())
a = 0
for x in range(1,n+1):
if x%2 == 0: continue
else:
b=0
for y in range(1,x+1):
if x%y ==0:
b+=1
if b>= 8: a+=1
print(a) |
p03281 | s343738519 | 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 | s508950800 | Accepted | t = 0
def div(n):
c = 0
for i in range(1, int(n**0.5)+1):
if n % i == 0:
c += 2 if i != n // i else 1
return c
for i in range(1, int(input()) + 1, 2):
if div(i) == 8:
t += 1
print(t) |
p03281 | s227410322 | Accepted | _=int(input());c=0
for i in 'i¥½ÃÉ':
if (_ < ord(i)):
print(c)
break
c+=1 |
p03281 | s195172334 | Accepted | N = int(input())
cnt = 0
ans = 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):
ans += 1
cnt = 0
print(ans) |
p03281 | s396346566 | Accepted | n=int(input())
a=[]
for i in range(1,201):
s=0
for j in range(1,int(i**0.5)+1):
if i%j==0:
s+=1
if j != i//j:
s+=1
a.append(s)
ans=0
for i in range(n):
if a[i]==8 and i%2==0:
ans+=1
print(ans) |
p03281 | s000836194 | 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 | s640611722 | Accepted | def solution():
n = int(input())
ans = 0
for i in range(21, n+1, 2):
match = 0
for j in range(1, i+1):
if i % j == 0:
match += 1
if match == 8:
ans += 1
print(ans)
solution() |
p03281 | s651404235 | Accepted | n = int(input())
ans = 0
for j in range(1,n+1,2):
count_j = 0
for i in range(1,j+1):
if j%i==0:
count_j +=1
if count_j ==8:
ans +=1
#print(j)
print(ans) |
p03281 | s991694701 | Accepted | N = int(input())
answer=0
count=0
for i in range(1,N+1,2):
for j in range(1,int(i**0.5)+1):
if i%j==0:
count+=1
if count==4:
answer+=1
count=0
print(answer) |
p03281 | s012007567 | Accepted | n = int(input())
lp = [3,5,7,11,13]
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], [3,1]]:
ans += 1
print(ans) |
p03281 | s713644731 | Accepted | n = int(input())
ans = 0
for i in range(1, n+1, 2):
counter = 0
for j in range(1, i+1):
if i%j==0:
counter += 1
if counter > 8:
break
if counter == 8:
ans += 1
print(ans) |
p03281 | s092490987 | Accepted | N = int(input())
cnt = 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:
cnt += 1
print(cnt) |
p03281 | s863863319 | 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):
if i%2==1 and len(make_divisors(i))==8:
ans+=1
print(ans)
|
p03281 | s203614057 | Accepted | """
for i in range(201):
if i % 2 == 0:
continue
cnt = 0
for j in range(1, i+1):
if i % j == 0:
cnt += 1
if cnt == 8:
print(i)
出力
105
135
165
189
195
"""
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) |
p03281 | s908187519 | Accepted | a = int(input())
b = [135,189,105,165,195]
ans = 0
for i in range(1,a+1):
if i in b:
ans += 1
print(ans) |
p03281 | s237575159 | 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=count+1
if count==8:
ans=ans+1
else:
print(ans)
|
p03281 | s243123807 | 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 | s964454219 | Accepted | N = int(input())
res = 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:
res += 1
print(res) |
p03281 | s322710349 | Accepted | N = int(input())
out=0
for i in range(1,N+1):
cnt=0
if i%2==1:
for j in range(1,N+1):
if i%j==0:
cnt+=1
if cnt==8:
out+=1
print(out)
|
p03281 | s214192123 | Accepted | n = int(input())
cnt = 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:
cnt+=1
print(cnt) |
p03281 | s800597862 | Accepted | import math
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)
return divisors
ans=0
for j in range(1,N+1,2):
count = make_divisors(j)
if len(count)==8:
ans +=1
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.