problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03281 | s203934096 | Wrong Answer | n= int(input())
ans = 0
for i in range(1,n+1,2):
count = 0
for j in range(1,i+1):
if n%j ==0:
count +=1
if count == 8:
ans +=1
print(ans)
|
p03281 | s913157890 | Wrong Answer | n = int(input())
ans = 0
ku = 0
for i in range(1,n+1,2):
if n % i == 0:
ku+=1
if ku == 8:
ans+=1
print(ans) |
p03281 | s066335460 | Wrong Answer | N = int(input())
def check_divisor(number):
divisors = 0
for j in range(1, number+1, 2):
if not (number%j):
divisors += 1
if divisors == 9: return False
if divisors == 8: return True
else: return False
count = 0
for i in range(1, N+1, 2):
if check_divisor(i):
count += 1 |
p03281 | s804661098 | Wrong Answer | n=int(input())
l=list(range(1,n+1))
k=[27,105,125,165,195]
lk=set(l) & set(ｋ)
print(len(lk)) |
p03281 | s506379977 | Wrong Answer | 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
print(ans)
if __name__ == '__main__':
main()
|
p03281 | s430562743 | Wrong Answer | l=0
for c in input():
l+=[0,0,5,1,0,1,2,0,3,4][int(c)]
print(l)
|
p03281 | s313148025 | Wrong Answer | n = int(input())
ans = 0
for j in range(2,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]:
ans += 1
print(ans)
|
p03281 | s841448042 | Wrong Answer | import bisect
n = int(input())
lst = [105, 135, 165, 175, 195]
for i in range(5):
if n < lst[i]:
print(i)
exit()
print(5)
|
p03281 | s019000196 | Wrong Answer | n=int(input())
p=[3,5,7,11,13]
x=[]
for i in range(5):
for j in range(i):
for k in range(j):
if n >= p[i]*p[j]*p[k]:
x.append(i*j*k)
cnt=len(x)
if n >= 135:
cnt += 1
else:
pass
print(cnt)
|
p03281 | s461131846 | Wrong Answer | n = int(input())
if n < 105:
print(0)
exit()
dp = [0] * 201
ans = 0
for i in range(1, n + 1):
for j in range(105, n + 1):
if j % i == 0:
dp[j] += 1
for i in range(105, n + 1, 2):
if dp[i] >= 8:
print(i)
ans += 1
print(ans) |
p03281 | s524632532 | Wrong Answer | n = int(input())
li = [3,5,7,11,13,17,19,23,29,31]
ans = 0
for i in range(1,n+1):
cnt = 0
for j in range(10):
if i%li[j]==0:
cnt += 1
if cnt ==3:
ans +=1
print(ans) |
p03281 | s108182162 | Wrong Answer | n = int(input())
result = 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:
print(i)
result += 1
print(result) |
p03281 | s080365086 | Wrong Answer | N=int(input())
if N < 105:
print("0")
elif N == 105:
print("1")
else:
ans = 0
for i in range(105,N+1):
nn = i
c = 0
s = 2
while s*s<=i:
if nn%s==0:
c += 1
nn //= s
while nn%s==0:
nn //= s
s+=1
if nn!=1 and nn!=s:
c += 1
if c == 3:
ans += 1
print(ans)
|
p03281 | s297637577 | Wrong Answer | n=int(input())
ans=0
for j in range(1,n+1,2):
count=0
for i in range(1,j+1):
if n%i==0:
count+=1
if count==8:
ans+=1
print(ans) |
p03281 | s964125910 | Wrong Answer | N = int(input())
if (1 <= N < 105):
print(0)
if (105 <= N < 135):
print(1)
if (135 <= N < 189):
print(2)
if (N >= 189):
print(3) |
p03281 | s358772284 | Wrong Answer | n=int(input())
ans=0
for i in range(1,n+2,2):
for k in range(1,i+1):
x=0
if i%k==0:
x+=1
if x==8:
ans+=1
print(ans) |
p03281 | s967287072 | Wrong Answer | # coding = SJIS
n = int(input())
if n >= 189:
print(3)
elif n >= 135:
print(2)
elif n >= 105:
print(1)
else:
print(0) |
p03281 | s619774898 | Wrong Answer | number = int(input())
num_eight_divisors = 0
for i in range(9, number + 1, 2):
num_divisors = 2
for j in range(2, i // 2):
if i % j == 0:
if i == j:
num_divisors = num_divisors + 1
else:
num_divisors = num_divisors + 2
if num_divisors > 8:
break
if num_divisors == 8:
num_eight_divisors = num_eight_divisors + 1
print(num_eight_divisors)
|
p03281 | s491865550 | Wrong Answer | n = int(input())
s = 0
t = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if i % j == 0 and s % 8 <= 8:
s += 1
if i % j == 0 and s > 8:
t += 1
print(t)
|
p03281 | s259888629 | Wrong Answer | n = int(input())
cnt, ans = 0, 0
if n == 105:
print(1)
elif n <= 104:
print(0)
else:
for x in range(107,200,2):
cnt = 0
for y in range(1,x+1):
if x % y == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans+1) |
p03281 | s509182264 | Wrong Answer | n = int(input())
l = []
odd = []
ans = []
for s in [i for i in range(1,n+1) if i % 2 == 1]:
for i in range(1,int(s**0.5)+1):
if s % i == 0:
l.append(i)
if len(l)==8:
ans.append(s)
ans = set(ans)
print(len(ans))
|
p03281 | s158698151 | Wrong Answer | N = int(input())
if N >= 105:
print(1)
else:
print(0) |
p03281 | s900826037 | Wrong Answer | n = int(input())
def divisor(n):
res = 0
for i in range(1,n+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 | s539080516 | Wrong Answer | N = int(input())
def trial_div(n):
factors = []
f = 2
while f*f <= n:
if n % f == 0:
n //= f
factors.append(f)
else:
f += 1
return factors
res = 0
for i in range(1,N+1):
if i == 1:
continue
if i % 2 == 0:
continue
factors = trial_div(i)
n_divisor = 2**len(factors)
if n_divisor == 8:
res += 1
print(res)
|
p03281 | s961958650 | Wrong Answer | 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
print(ans)
|
p03281 | s853158337 | Wrong Answer | from math import sqrt
N = int(input())
ans = 0
for i in range(7, N+1):
if i%2==0:
continue
c = 0
for j in range(1, int(sqrt(i))):
if i%j==0:
c+=2
if c==8:
ans += 1
print(ans) |
p03281 | s290097607 | Wrong Answer | 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 == 8:
ans += 1
print(ans) |
p03281 | s845232765 | Wrong Answer | n = int(input())
cnt = 0
l = []
for i in range(1, n+1):
if i % 2 == 1:
for d in (1, i+1):
if n % i == 0:
l.append(i)
if len(l) == 8:
cnt += 1
print(cnt) |
p03281 | s917241779 | Wrong Answer | 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, a):
if a % b == 0:
count += 1
count_list.append(count)
count = 0
print(len(list(filter(lambda x: x == 8, count_list))))
|
p03281 | s460881104 | Wrong Answer | N = int(input())
cnt=0
y=[]
for i in range(1,N+1,2):
for j in range(1,i+1):
if i%j == 0:
y.append(j)
if len(y)==8:
cnt += 1
print(y)
y.clear()
print(cnt) |
p03281 | s203584738 | Wrong Answer | n = int(input())
if n < 105:
print(0)
elif n < 165:
print(1)
elif n < 195:
print(2)
else:
print(3) |
p03281 | s229975116 | Wrong Answer | n = int(input())
if n < 105:
print(0)
else:
print(1) |
p03281 | s704607863 | Wrong Answer | import math
n = int(input())
cnt = 0
if n ==1:
print(cnt)
exit()
for i in range(1,int(math.sqrt(n))+1):
if n % i == 0:
cnt += 1
print(cnt*2) |
p03281 | s198085072 | Wrong Answer | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
N = int(input())
result = 0
for i in range(1, N + 1):
if N % i == 0:
result += 1
print(1 if result == 8 else 0)
if __name__ == "__main__":
main()
|
p03281 | s078462725 | Wrong Answer | 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:
res+=1
print(res) |
p03281 | s019740816 | Wrong Answer | 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(n):
if i % 2 == 1:
if check(i) == 8:
ans += 1
print(ans) |
p03281 | s771114722 | Wrong Answer | N = int(input())
if N == 105:
print(1)
else:
print(0) |
p03281 | s307924287 | Wrong Answer | 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):
div = get_divisors(n)
if len(div) == 8:
cnt += 1
print(cnt) |
p03281 | s391180240 | Wrong Answer | 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 == 0:
ans += 1
print(ans)
|
p03281 | s512055372 | Wrong Answer | N = int(input())
def trial_division(n):
prime_factors = list()
while n % 2 == 0:
prime_factors.append(2)
n //= 2
p = 3
while p * p <= n:
if n % p == 0:
prime_factors.append(p)
n //= p
else:
p += 2
if n != 1:
prime_factors.append(n)
return prime_factors
cnt = 0
for i in range(1,N+1,2):
if len(set(trial_division(i))) == 3:
cnt += 1
print(cnt) |
p03281 | s070042540 | Wrong Answer | n=int(input())
ans=0
for i in range(1,n+2,2):
x=0
for k in range(1,i+1):
if i%k==0:
x+=1
if x==8:
ans+=1
print(ans) |
p03281 | s458819192 | Wrong Answer | n = int(input())
con = 0
ans = 0
for j in range(1,n+1):
for i in range(1,n+1):
if j % i == 0:
con += 1
if con == 8:
ans += 1
print(ans) |
p03281 | s144964120 | Wrong Answer | N=int(input())
ans=0
a=0
for i in range(1,N+1):
for j in range(1,i+1):
if i%j==0:
a+=1
if i%2==1 and a==8:
ans+=1
print(ans) |
p03281 | s503531556 | Wrong Answer | N = int(input())
ans = 0
for i in range(1, N + 2, 2):
count = 0
for j in range(1, i +1):
if i % j == 0:
count += 1
if count == 8:
ans += 1
print(ans)
|
p03281 | s614299819 | Wrong Answer |
def yakusu(x):
A=[]
for i in range(1,x+1):
if x%i==0:
A.append(i)
return(len(A))
n=int(input())
ans=0
for j in range(1,n+1):
if yakusu(j)==8:
ans+=1
print(ans) |
p03281 | s309193220 | Wrong Answer | n = int(input())
total, count = 0,0
for i in range(1, n+1, 2):
for j in range(1, i+1):
if i % j == 0:
count += 1
print(count)
if count == 8:
total += 1
count = 0
print(total)
|
p03281 | s942467240 | Wrong Answer | a = int(input())
if a < 105:
k = 0
elif a < 165:
k = 1
elif a < 195:
k = 2
else:
k = 3
print(k) |
p03281 | s965801625 | Wrong Answer | import sys, math
def input():
return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict, Counter
from math import factorial
from bisect import bisect_left # bisect_left(list, value)
#from fractions import gcd
sys.setrecursionlimit(10**7)
N = int(input())
if N < 105:
print(0)
exit()
cntt = 0
for i in range(1, N+1, 2):
cnt = 0
for j in range(1, int(math.sqrt(i)), 2):
if i%j==0:
cnt += 2
if cnt == 8:
cntt += 1
print(cntt)
|
p03281 | s111791046 | Wrong Answer | N=map(int,input().split())
cnt=0
l=[3*5*7,3*5*9,3*5*11,3*5*13]
for n in N:
cnt+=(n in l)
print(cnt)
|
p03281 | s054817229 | Wrong Answer | n = int(input())
ans = 0
for num in range(1, n):
if num%2 == 1:
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 | s539107394 | Wrong Answer | n = int(input())
count = 0
ans = 0
j = 1
for i in range(1, n+1, 2):
while j <= i:
print(i, j)
if i % j == 0:
count += 1
j += 1
print(i, j, count)
if count == 8:
ans += 1
count = 0
j = 1
print(ans) |
p03281 | s278673658 | Wrong Answer | n=int(input())
a=0
ans=0
if n < 105:
print(0)
elif n == 105:
print(1)
else:
for i in range(107,n+1,2):
a=0
for j in range(i):
if i%(j+1)==0:
a += 1
if a==8:
ans +=1
print(ans) |
p03281 | s140378969 | Wrong Answer | N = int(input())
result = 0
for i in range(1,N+1,2):
count = 0
for j in range(1,i,2):
if i %j ==0:
count+=1
if count ==8:
result +=1
print(result)
|
p03281 | s144431599 | Wrong Answer | n = int(input())
if n == 105:
print(1)
else:
print(0) |
p03281 | s733687174 | Wrong Answer | N = int(input())
# (a * b * c) or (d * d * d * e)
# (a, b, c) = (3, 5, 7) -> 105
# (a, b, c) = (3, 5, 11) -> 265 out
# (d, e) = (3, 5) -> 135
# (d, e) = (3, 7) -> 189
# (d, e) = (3, 11) -> 297 out
# (d, e) = (5, 3) -> 375 out
# therefore: 105, 135, 189
print(0) if N < 105 else print(1) if N < 135 else print(2) if N < 189 else print(3)
|
p03281 | s018600194 | Wrong Answer | import math
def countYakusu(n):
count = 0
for i in range(n):
if n % (i+1) == 0:
count = count + 1
return count == 8
N = int(input())
count = 0
for i in range(math.ceil(N/2)):
count = count + countYakusu(i*2)
print(count)
|
p03281 | s778804898 | Wrong Answer | N=int(input())
ans=0
for i in range(1,N+1,2):
if i>1:
div_list=[1,i]
for j in range(2,int(i**0.5)+1):
if i%j==0:
div_list.append(j)
if len(div_list)==8:
ans+=1
print(ans) |
p03281 | s784431843 | Wrong Answer | N=int(input())
X=[3, 5, 7, 11, 13]
ans=0
for n in range(1,N+1):
_X=[1 if n%x==0 else 0 for x in X]
if sum(_X)==3:
ans+=1
print(ans) |
p03281 | s817568687 | Wrong Answer | # -*- coding: utf-8 -*-
import math
import itertools
import sys
import copy
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
N = int(input())
if N <= 105 :
print (1)
exit()
cnt = 1
for i in range(107, N+1, 2) :
q = 0
for j in range(1, i+1) :
if i%j == 0 :
q += 1
if q == 8 :
cnt += 1
print (cnt)
|
p03281 | s170189349 | Wrong Answer | N=int(input())
if N<=104 :
print(0)
else :
print(1) |
p03281 | s686599774 | Wrong Answer | N = int(input())
ans = 0
if N%2==0:
print("0")
else:
for num in range(1,N+1):
cnt = 0
for i in range(1,num):
if num%i == 0:
cnt = cnt+1
if cnt == 8:
ans = ans+1
print(ans) |
p03281 | s094434993 | Wrong Answer | n=int(input())
count=0
ans=0
if n<=104:
print('0')
else:
for i in range(105,n+1):
count=0
for e in range(1,n+1):
if i%2==0:
break
elif i%e==0:
count+=1
if count==8:
ans+=1
print(ans) |
p03281 | s942999960 | Wrong Answer | def countyaku(m):
count = 0
for i in range(1,m+1):
if m%i==0:
count += 1
if count == 8:
return True
else:
return False
n = int(input())
if n<105:
print(0)
else:
ans = 0
for j in range(105,n+1):
if countyaku(j):
ans += 1
print(ans)
|
p03281 | s906646246 | Wrong Answer | 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
result = 0
for i in range(1,n+2,2):
if i > 200:
break
#print(i)
if len(make_divisors(i)) == 8:
result += 1
print(result)
|
p03281 | s699953717 | Wrong Answer | n = int(input())
ans = 0
cnt = 0
for s in range(1,n+1):
if s % 2 == 1:
for j in range(1,int(s**0.5)+1):
if s % j == 0:
cnt += 1
if cnt == 8:
ans += 1
cnt = 0
print(ans) |
p03281 | s074705877 | Wrong Answer | n=int(input())
ans=0
for j in range(n+1):
count=0
for i in range(1,j+1):
if n%i==0:
count+=1
if count==8:
ans+=1
print(ans) |
p03281 | s960943416 | Wrong Answer | N = int(input())
def trial_div(n):
factors = []
f = 2
while f*f <= n:
if n % f == 0:
n //= f
factors.append(f)
else:
f += 1
if n != 1:
factors.append(n)
return factors
res = 0
for i in range(1,N+1):
if i == 1:
continue
if i % 2 == 0:
continue
factors = trial_div(i)
if len(factors) == 3 \
and factors[0] < factors[1] \
and factors[1] < factors[2]:
res += 1
print(res)
|
p03281 | s149380155 | Wrong Answer | N = int(input())
if (N < 105):
print(0)
if (105 <= N < 135):
print(1)
if (135 <= N < 189):
print(2)
if (N >= 189):
print(3) |
p03281 | s243550694 | Wrong Answer | N = int(input())
if N < 105:
print(0)
else:
print(1)
|
p03281 | s437015359 | Wrong Answer | N = int(input())
ans = 0
if N < 105:
print(0)
elif N == 105:
print(1)
else:
for i in range(106,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 | s729510324 | Wrong Answer | import math
n = int(input())
ans = 0
for i in range(1, n+1):
count = 0
if i % 2 == 1:
for j in range(1, int(math.sqrt(i))):
if i % j == 0:
count += 1
if count == 4:
ans += 1
print(ans)
|
p03281 | s392934104 | Wrong Answer | import sys
c = 0
n = int(input())
if n%2==1:
for i in range(1,n+1):
n%i == 0
c += 1
if c == 8:
print('1')
sys.exit()
print('0') |
p03281 | s086291776 | Wrong Answer | import math
def countDividers(n):
divisors = []
for i in range(1, int(math.sqrt(n))):
if n % i == 0:
divisors.append(i)
divisors.append(int(n/i))
return len(divisors)
if __name__ == '__main__':
n = int(input())
count = 0
for i in range(1,n+1):
if i %2 ==1 and countDividers(i) == 8:
count += 1
#print(i)
print(count)
|
p03281 | s120019539 | Wrong Answer | 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):
if checkOdd(i):
res += 1
print(res) |
p03281 | s247020727 | Wrong Answer | n = int(input())
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:
print(i)
|
p03281 | s754634926 | Wrong Answer |
n = int(input())
ans = 0
for j in range(1,n+1,2):
sm = sum(n % i == 0 for i in range(1,j+1))
if sm == 8:
ans += 1
print(ans)
|
p03281 | s066242384 | Wrong Answer | N=int(input())
ans=0
a=0
for i in range(1,N+1,2):
for j in range(1,i+1):
if i%j==0:
a+=1
if a==8:
ans+=1
print(ans) |
p03281 | s004078537 | Wrong Answer | N = int(input())
if N < 105:
print(0)
elif N < 135:
print(1)
elif N < 165:
print(2)
elif N < 189:
print(3)
else:
print(4) |
p03281 | s013597165 | Wrong Answer | from math import sqrt
N = int(input())
ans = 0
for i in range(7, N+1):
if i%2==0:
continue
c = 0
for j in range(1, int(sqrt(i))+1):
if i%j==0:
if i%j==j:
c+=1
else:
c+=2
if c==8:
ans += 1
print(i)
print(ans) |
p03281 | s172574437 | Wrong Answer | c = 0
n = int(input())
if n%2==1:
for i in range(1,n+1):
n%i == 0
c += 1
if c == 8:
print('1')
else:
print('0') |
p03281 | s978249527 | Wrong Answer | print(4) |
p03281 | s400257248 | Wrong Answer | n=int(input())
count=0
for i in range(1,n+1):
if n%1==0:
count+=1
if count==8:
print("1")
else:
print("0") |
p03281 | s180642429 | Wrong Answer | 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)
else:
print(4) |
p03281 | s430033415 | Wrong Answer | def cnt_prime(x):
cnt = 0
for i in range(1, int(x ** 0.5 // 1) + 1):
if x % i == 0:
cnt += 1
return cnt
N = int(input())
ans = 0
for i in range(1, N+1):
if i % 2 == 1:
c = cnt_prime(i)
if c == 8:
ans += 1
print(ans) |
p03281 | s207474545 | Wrong Answer | N = int(input())
if N < 105:
print(0)
elif N < 165:
print(1)
elif N < 195:
print(2)
else:
print(3) |
p03281 | s817764568 | Wrong Answer | n=int(input())
ans=0
for i in range(1,n,2):
cnt=0
for j in range(1,i+1):
if i%j==0:
cnt+=1
if cnt==8:
ans+=1
print(ans) |
p03281 | s303523525 | Wrong Answer | def make_divisors(n: int) -> list:
return_list = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
return_list.append(i)
if i != n // i:
return_list.append(n//i)
return return_list
N = int(input())
cnt = 0
for i in range(1,N+1,2):
if len(make_divisors(i)) == 8:
cnt += 1
print(i)
print(cnt) |
p03281 | s836510493 | Wrong Answer | N = int(input())
if N < 105:
print(0)
else:
ans = 1
for a in range(106, N+1):
tmp = 1
for b in range(2, a//2):
if a % b == 0:
tmp += 1
if tmp == 8:
ans += 1
print(ans)
|
p03281 | s277908463 | Wrong Answer | n = int(input())
cnt, ans = 0, 0
if n == 105:
print(1)
elif n <= 104:
print(0)
else:
for x in range(107,n+1,2):
for y in range(1,x+1):
if x % y == 0:
cnt += 1
if cnt >= 8 and x % 2 != 0:
ans += 1
print(ans+1) |
p03281 | s191177519 | Wrong Answer |
def solve():
ans = 0
n=int(input())
for i in range(1,n+1):
div_list = []
for j in range(i,int(i**0.5)+1):
if i%j!=0:
continue
if i//j==j:
div_list.append(j)
else:
div_list.append(i//j)
div_list.append(j)
print(ans)
if __name__ == '__main__':
solve() |
p03281 | s439226067 | Wrong Answer | 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 == 0:
if len(make_divisors(i)) == 8:
ans += 1
print(ans)
|
p03281 | s137763547 | Wrong Answer | n=int(input())
a=0
ans=0
if n < 105:
print(0)
elif n == 105:
print(1)
else:
for i in range(107,n,2):
a=0
for j in range(i):
if i%(j+1)==0:
a += 1
if a==8:
ans +=1
print(ans) |
p03281 | s002403544 | Wrong Answer | def count_dividers(n):
sqrt = int(n ** 0.5)
count = 0
for i in range(1, sqrt):
if n % i == 0:
count += 1
count *= 2
if n == sqrt ** 2:
count += 1
return count
N = int(input())
print(len([0 for n in range(105, N + 1, 2) if count_dividers(n) == 8]))
|
p03281 | s069059451 | Wrong Answer | n=int(input())
if n<105:
print(0)
elif 105<=n<135:
print(1)
elif 135<=n<189:
print(2)
elif 189<=n:
print(3) |
p03281 | s143869888 | Wrong Answer | #!/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 | s659820547 | Wrong Answer | print(0) |
p03281 | s360155119 | Wrong Answer | n=int(input())
import math
cnt=0
coun=0
x=math.floor(n**(1/2))
if n<105:
print(0)
exit()
else :
for i in range (105,n+1):
for j in range (1,x):
if i%j==0 and j!=i/j:
cnt+=2
if cnt==8:
coun+=1
print(coun)
|
p03281 | s848111782 | Wrong Answer | ans=0
n=int(input())
if n<105:
print('0')
else:
for i in range(105,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 | s830525339 | Wrong Answer | 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):
l=make_divisors(i)
if len(l)==8:
ans+=1
print(ans)
|
p03281 | s663193676 | Wrong Answer | 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:
print(4) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.