problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03281 | s392498854 | Wrong Answer | def gp():
yield 2
yield 3
n=6
while 1:
yield n-1
yield n+1
n+=6
def resolve():
nn=int(input())
l=[]
ans=0
for n in range(1,nn+1)[::2]:
s=1
pl=gp()
for i in pl:
k=0
while n%i==0:
k+=1
n//=i
s*=k+1
if n==1:
break
if s==8:
ans+=1
print(ans) |
p03281 | s898785272 | Wrong Answer | N = int(input())
if (N < 105):
print(0)
if (105 <= N < 135):
print(1)
if (135 <= N < 189):
print(2)
else:
print(3) |
p03281 | s734934573 | Wrong Answer | N = int(input())
res = 0
for i in range(1,N+1):
if N % i == 0:
if i % 2 == 1:
res += 1
print(res)
|
p03281 | s023357829 | Wrong Answer | import numpy
n = int(input())
num = [3,5,7,11,13,17,19]
k = len(num)
ans =0
for i in range(2 ** k):
cnt = []
for j in range(k):
if ((i >> j)&1):
cnt.append(num[j])
if numpy.prod(cnt) <= n and len(cnt) == 3 :
ans += 1
print(ans) |
p03281 | s758561164 | Wrong Answer | N = int(input())
ans = 0
if N>=105:
ans = 1
print(ans) |
p03281 | s898459167 | Wrong Answer | N = int(input())
if(N >= 195):
print(3)
elif(N >= 165):
print(2)
elif N>=105:
print(1)
else:
print(0)
|
p03281 | s841259272 | Wrong Answer | # 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(N)
if len(Y) == 8:
ans += 1
print(ans) |
p03281 | s135846724 | Wrong Answer | n = int(input())
count = 0
for i in range(1,n+1):
if n % i == 0:
count += 1
if count == 8:
print("Yes")
else:
print("No") |
p03281 | s803459248 | Wrong Answer | n = int(input())
ans = 0
for i in range(1, n+1, 2):
cnt = 0
for j in range(1, i+1):
if n % j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) |
p03281 | s245389968 | Wrong Answer | N = int(input())
counter = 0
ans = 0
for i in range(1,N+1):
for j in range(1, N+1):
if i % j == 0:
counter += 1
if counter == 8:
ans += 1
counter = 0
print(ans)
|
p03281 | s100241360 | Wrong Answer | def hantei(n):
root_n = int(n**0.5 +0.5)
if root_n**2 == n:
return 0
total = 0
for i in range(1,root_n):
if n % i == 0:
total += 2
return total
n = int(input())
total = 0
for i in range(1,n+1,2):
if hantei(i) == 8:
print(i)
total += 1
print(total) |
p03281 | s479343533 | Wrong Answer | N = int(input())
if N >= 189:
print(3)
elif N >= 135:
print(2)
elif N >= 105:
print(1)
else:
print(0) |
p03281 | s714783889 | Wrong Answer | 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):
if factors(i) == 8:
ans += 1
print(ans)
solve()
|
p03281 | s531340435 | 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)
elif N >= 195:
print(4) |
p03281 | s692539816 | 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())
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 | s521548933 | Wrong Answer | N=int(input())
if N<105:
print(0)
elif N==105:
print(1)
else:
ans=0
for n in range(106,N+1):
if n%2:
K=n//2
y=0
for k in range(2,K):
if n%k==0:
y+=1
if y==6:
ans+=1
print(ans) |
p03281 | s003677075 | Wrong Answer | N = int(input())
counter = 0
ans = 0
for i in range(1,N+1):
for j in range(1, N+1):
if N % j == 0:
counter += 1
if counter == 8:
ans += 1
print(ans)
|
p03281 | s496723634 | Wrong Answer | N = int(input())
cnt=0
ans=0
for i in range(1,N+1):
if N%i ==0:
cnt+=1
if cnt ==8:
ans+=1
print(ans) |
p03281 | s503699864 | Wrong Answer | 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:
print(i)
ans += 1
print(ans)
|
p03281 | s451213379 | Wrong Answer | print(2) |
p03281 | s625351260 | Wrong Answer | n = int(input())
if n < 105:
print(0)
elif n < 165:
print(1)
elif n < 195:
print(2)
else:
print(3) |
p03281 | s830170857 | Wrong Answer | n = int(input())
cnt = 0
for i in range(1, n+1):
if n % i == 0:
cnt += 1
if cnt == 8:
print(1)
else:
print(0)
|
p03281 | s215067380 | 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 | s314651708 | Wrong Answer | n = int(input())
if n < 105:
print(0)
elif n < 165:
print(1)
elif n < 195:
print(2)
else:
print(3)
|
p03281 | s385254844 | 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())
cnt = 0
for i in range(1, n+1):
if i%2==0:
continue
elif sum(make_divisors(i))==8:
cnt = cnt + 1
print(cnt) |
p03281 | s390618002 | 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 | s997523736 | 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=count+1
if count==8:
ans=ans+1
else:
print(ans)
|
p03281 | s997532722 | Wrong Answer | import sys
INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
sys.setrecursionlimit(10 ** 9)
def main():
N = INT()
if N < 105: print(0)
elif N < 165: print(1)
else: print(2)
if __name__ == '__main__':
main() |
p03281 | s493578728 | Wrong Answer | N = int(input())
if N<105:
print(0)
elif N<135:
print(1)
elif N<189:
print(2)
elif N<195:
print(3)
else:
print(4) |
p03281 | s298653717 | Wrong Answer | n = int(input())
res = 0
for i in range(1,n+1, 2):
if i % 1:
cnt = 0
for j in range(i+1):
if i % j == 0:
cnt += 1
if cnt == 8:
res += 1
print(res) |
p03281 | s194142332 | Wrong Answer |
n = int(input())
ret = 0
for j in range(1,n+1):
cnt = 0
for i in range(1,j+1):
if n % i == 0:
cnt += 1
if cnt == 8:
ret += 1
print(ret) |
p03281 | s745172075 | Wrong Answer |
n = int(input())
a = 1
status = 0
count = 0
l = []
for i in range(1,n):
if i % 2 ==0:
break
else:
for j in range(1,n):
if j % a == 0:
count += 1
else:
break
if count == 8:
l.append(1)
print(sum(l))
|
p03281 | s607368634 | Wrong Answer | N = int(input())
count = 0
for i in range(1, N+1):
yakusu_count = 0
if i % 2 == 0:
break
for j in range(1, N+1):
if N % j == 0:
yakusu_count += 1
if yakusu_count == 8:
count += 1
print(count) |
p03281 | s658644353 | 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
ans=0
N=int(input())
if N<105:
print(0)
exit(0)
for i in range(104,N):
if i%2==1 and len(make_divisors(i))==8:
ans+=1
print(ans) |
p03281 | s256694417 | Wrong Answer | n = int(input())
cnt = 0
ans = 0
j = 1
while j < n:
if cnt == 8:
ans += 1
cnt = 0
j += 2
for i in range(j):
if j % (i+1) == 0:
cnt += 1
print(ans+1 if cnt == 8 else ans) |
p03281 | s707334763 | 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 | s717736723 | Wrong Answer | n = int(input())
if 165 <= n:
print(2)
elif 105 <= n:
print(1)
else:
print(0) |
p03281 | s182629704 | Wrong Answer | N = int(input())
cnt = 0
for i in range(1, N + 1):
k = 0
for j in range(1, N + 1):
if i % j == 0:
k += 1
if k == 8:
cnt += 1 |
p03281 | s663863538 | Wrong Answer | in_num = int(input())
check_num = 0
ans_counter = 0
while check_num <= in_num:
i = 1
div_counter = 0
while i <= check_num /3:
if check_num % i == 0:
div_counter += 1
i += 2
if div_counter == 8:
ans_counter += 1
check_num += 2
print(ans_counter)
|
p03281 | s157582353 | Wrong Answer | N=int(input())
ans=0
odd=[]
for i in range(1,N+1):
if i%2!=0:
odd.append(i)
if N <104:
pass
else:
for i in range(105,N+1):
if i%2!=0:
tmp=0
for j in odd:
if i%j==0:
tmp=+1
if tmp==8:
ans+=1
print(ans) |
p03281 | s866268920 | Wrong Answer | ret = 0
for x in range(11, int(input()) + 1, 2):
n = 2
for y in range(2, x // 2 + 1):
if x % y == 0:
n += 1
if n == 8:
ret += 1
print(x)
print(ret) |
p03281 | s427893517 | Wrong Answer | N = int(input())
if N < 105:
print(0)
elif N < 165:
print(1)
else:
print(2)
|
p03281 | s903614097 | Wrong Answer | import math
n = int(input())
ans = 0
for i in range(105, n+1, 2):
cnt = 0
for j in range(2, int(math.sqrt(n))):
if i % j == 0:
cnt += 1
if cnt == 3:
ans += 1
print(ans)
|
p03281 | s051586734 | Wrong Answer | n = int(input())
if n < 105:
print(0)
else:
output = 0
for i in range(105,n+1):
yaku = 0
for j in range(1,n+1):
if n % j == 0:
yaku += 1
if yaku > 8:
continue
if yaku == 8:
output += 1
print(output) |
p03281 | s529477118 | Wrong Answer | n = int(input())
ans = 0
total = 0
for i in range(n//2 + 1):
for j in range(1, 2*i + 2):
if (2*i + 1) % j == 0:
ans += 1
if ans == 8:
total += 1
ans = 0
print(total)
|
p03281 | s994478126 | Wrong Answer | import sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
if N < 105:
print(0)
elif N < 165:
print(1)
elif N < 195:
print(2)
else:
print(3) |
p03281 | s490309315 | Wrong Answer | N = int(input())
if N >= 189:
print(3)
elif 189 > N >= 135:
print(2)
elif 135 > N >= 105:
print(1)
else:
print(0) |
p03281 | s997473933 | Wrong Answer | N = int(input())
divisor_cnt = 0
num = 0
# Nは奇数と言う制約があるため、約数は奇数×奇数の組み合わせ
for i in range(1, N+1, 2):
for j in range(1, N+1, 2):
if i * j == N:
divisor_cnt += 1
if divisor_cnt % 8 == 0:
num += divisor_cnt // 8
print(num)
|
p03281 | s202166016 | Wrong Answer | def I(): return int(input())
n = I()
ans = 0
if n>=105:
for i in range(105,n+1,2):
cnt=0
for j in range(1,int(n**0.5)+1):
if i % j ==0:
cnt+=2
if cnt==8:ans+=1
print(ans) |
p03281 | s069026102 | Wrong Answer | N = int(input())
if N >= 105 and N % 2 == 1:
print(1)
else:
print(0) |
p03281 | s261857388 | Wrong Answer | from random import*;print(randint(0,5)) |
p03281 | s207321924 | Wrong Answer | 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())
total = 0
for n in range(1, N + 1, 2):
print(n)
if len(divisor(n)) == 8:
total += 1
print(total) |
p03281 | s728425046 | Wrong Answer | N = int(input())
count_1,count_2 = 0,0
for i in range(1,N+1,2):
for j in range(1,i+1,2):
if N % j == 0:
count_1 += 1
if count_1 == 8:
count_2 += 1
count_1 = 0
print(count_2) |
p03281 | s572063953 | 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(count) |
p03281 | s998154023 | Wrong Answer | n = int(input())
res = 0
for i in range(8,n+1,2):
yakusu = 0
for j in range(2,int(i/2)+1):
if(i % j == 0):
yakusu +=1
if(yakusu == 8):
res += 1
print(res) |
p03281 | s535940789 | Wrong Answer | def ABC106C(n):
a = 0
for i in range(1,n+1):
if n % i == 0:
a += 1
return a
a = 0
for i in range(1,int(input()),2):
if ABC106C(i)==8:
a += 1
print(a) |
p03281 | s637266146 | Wrong Answer | n = int(input())
if n < 105:
print(0)
elif 105 <= n < 195:
print(1)
else:
print(2) |
p03281 | s128671359 | Wrong Answer | n = int(input())
ans = 0
yakusu = 0
for i in range(1,n+1):
if n % i == 0:
yakusu += 1
if yakusu == 8:
ans += 1
print(ans)
|
p03281 | s828165215 | Wrong Answer | n = int(input())
if n >= 195:
print(3)
elif n >= 165:
print(2)
elif n >= 105:
print(1)
else:
print(0)
|
p03281 | s588482846 | Wrong Answer | import math
import sys
n = int(sys.stdin.readline())
ans = 0
for i in range(3, n + 1, 2):
# print(f'{i=}', end=' ')
count = 0
for j in range(1, int(math.sqrt(i))):
if i % j == 0:
# print(f'{i} % {j} is 0.')
count += 2
if count == 8:
# print(f'{i} have just 8 divisors.')
ans += 1
print(ans) |
p03281 | s837992186 | Wrong Answer | #abc106b
n = int(input())
ans = 0
for i in range(1,n+1):
if i % 2 != 0:
cnt = 0
for ni in range(1,i+1):
if n % ni == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) |
p03281 | s838967578 | Wrong Answer | in_num = int(input())
check_num = 0
ans_counter = 0
while check_num <= in_num:
i = 1
div_counter = 0
while i <= check_num :
if check_num % i == 0:
div_counter += 1
i += 2
if div_counter == 8:
ans_counter += 1
check_num += 2
print(ans_counter)
|
p03281 | s926018217 | Wrong Answer | import sys
input = sys.stdin.readline
N = int(input())
if N < 105 :
print(0)
elif N >= 105 and N<128 :
print(1)
elif N>= 128 and N<135 :
print(2)
elif N>=135 and N< 189 :
print(3)
else :
print(4) |
p03281 | s265279283 | 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 135 <= n <189:
cnt += 1
elif n <= 189:
cnt += 2
else:
pass
print(cnt) |
p03281 | s526959294 | Wrong Answer | n=int(input())
if n<105:
print(0)
elif 105<=n and n<135:
print(1)
elif 135<=n and n<189:
print(2)
elif 165<=n and n<189:
print(3)
elif 189<=n and n<195:
print(4)
else:
print(5)
|
p03281 | s953109432 | Wrong Answer | n=int(input())
j=1
a=0
while j<=n:
d=0
for i in range(1,j):
if j%i==0:
d+=1
if d==8:
a+=1
j+=2
print(a)
|
p03281 | s476474146 | 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):
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 | s543593647 | Wrong Answer | def main():
n = int(input())
count = 0
x_list =[3**3*5, 3**3*7, 3*5*7, 3*5*11]
for one in x_list:
if one<=n:
count+=1
print(count)
if __name__=="__main__":
main()
|
p03281 | s976387092 | Wrong Answer | n = int(input())
arr = []
for i in range(1, n + 1):
a = []
for j in range(1, i + 1):
if j % 2 == 1:
if n % j == 0:
a.append(j)
if len(a) == 8:
arr.append(i)
print(len(arr)) |
p03281 | s950007497 | Wrong Answer | 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:
ans+=1
print(ans) |
p03281 | s355984879 | Wrong Answer | from random import*;print(randint(0,5)) |
p03281 | s677034614 | Wrong Answer | n = int(input())
if n >= 105:
print(1)
else:
print(0) |
p03281 | s885903160 | Wrong Answer | N = int(input())
ans = 0
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 | s183595656 | Wrong Answer | n = int(input())
import itertools
a = [3,5,7,11]
ax = 3*5*7*11
b = []
for i in range(4):
b.append(ax//a[i])
c = list(itertools.combinations([0, 1, 2, 3], 2))
for j in range(len(c)):
b.append(a[c[j][0]]**3 * a[c[j][1]])
ans = 0
for i in b:
if n >= i:
ans += 1
print(ans) |
p03281 | s857144454 | Wrong Answer | n=int(input())
if n>=189:
print('2')
elif n>=105:
print('1')
else:
print('0') |
p03281 | s943072416 | Wrong Answer | N = int(input())
ans = 0
for i in range(1, N, 2):
c = 0
for j in range(1, N+1):
if i%j==0:
c += 1
if c==8:
ans += 1
print(ans)
|
p03281 | s682007299 | Wrong Answer | N = int(input())
ans = []
for i in range(1, N + 1, 2):
count = 0
if i == 105:
print(105)
for j in range(1, i // 2 + 1):
if i % j == 0:
count += 1
if count == 7:
ans.append(1)
print(sum(ans)) |
p03281 | s914655999 | Wrong Answer | print(3) |
p03281 | s104296782 | 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(n)==8:
ans+=1
print(ans) |
p03281 | s374468151 | Wrong Answer | def main():
N = int(input())
num = 0
for i in range(1, N + 1):
if i % 2 == 1:
count = 0
for j in range(i, N + 1):
if i // j == 0:
count += 1
if count == 8:
num += 1
print(num)
main() |
p03281 | s496858496 | Wrong Answer | n = int(input())
res = 0
for i in range(1, n + 1):
temp = i
cnt = 0
for j in range(1, temp + 1):
if temp % i == 0:cnt += 1
if cnt == 8:res += 1
print(res) |
p03281 | s245880073 | Wrong Answer | n = int(input())
ans = 0
for num in range(1, n+1):
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 | s496869833 | Wrong Answer | N = int(input())
if N >= 105:
print(1)
else:
print(0) |
p03281 | s153304495 | Wrong Answer | n=int(input())
x=0
for i in range(1,n+1):
cnt=0
for j in range(1,i+1):
if n%j==0:
cnt+=1
if cnt==8:
x+=1
print(x) |
p03281 | s054715735 | Wrong Answer | def divsor(num):
count=0
for i in range(1,num+1):
if num%i==0:
count+=1
return count
n=int(input())
if(n<=105):
if(n==105):
print(1)
elif(n<105):
print(0)
exit()
res=1
for i in range(106,n+1):
if(divsor(i)==8 and i%2==1):
res+=1
print(res) |
p03281 | s281186552 | Wrong Answer | N = int(input())
if N < 105:
print(0)
elif N < 165:
print(1)
elif N < 195:
print(2)
else:
print(3)
|
p03281 | s552590974 | Wrong Answer | n = int(input())
if 189 <= n:
print(4)
elif 165 <= n:
print(3)
elif 135 <= n:
print(2)
elif 105 <= n:
print(1)
else:
print(0) |
p03281 | s871708013 | Wrong Answer | N = int(input())
## 約数の列挙O(√N)
def divisor(n): #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 len(table)
i = 1
answer = 0
while i < N:
if divisor(i) == 8:
answer += 1
i += 2
print(answer)
|
p03281 | s603088201 | Wrong Answer | N=int(input())
count=0
ans =0
for j in range(N+1):
count =0
for i in range(1,N+1):
if j %2 ==0:
continue
if j % i ==0:
count +=1
else:
continue
if count == 8 and i ==N:
ans += 1
print(ans) |
p03281 | s506128258 | Wrong Answer | n = int(input())
ans = []
if n < 105:
print(0)
exit(0)
for i in range(105, n + 2, 2):
divisors = []
for j in range(1, i + 1):
if i % j == 0:
divisors.append(j)
if len(divisors) == 8:
ans.append(i)
print(len(ans)) |
p03281 | s441764319 | Wrong Answer | N=int(input())
if N<105:
print(0)
elif N==105:
print(1)
else:
ans=0
for n in range(106,N+1):
K=n//2
y=0
for k in range(2,K):
if n%k==0:
y+=1
if y==6:
ans+=1
print(ans) |
p03281 | s093329238 | Wrong Answer | N=int(input())
def prime(n):
cnt=0
for i in range(2,n):
if n%2==0:
cnt+=1
return cnt
ans=0
for i in range(1,N+1):
if prime(i)==8:
ans+=1
print(ans)
|
p03281 | s170188876 | Wrong Answer | n = int(input())
ans = 0
A = [i for i in range(n+1)]
A = A[1:n+1:2]
for i in range(len(A)):
a=0
for j in range(len(A)):
if A[i] % (j+1) == 0:
a += 1
if a == 8:
ans += 1
print(ans)
|
p03281 | s847353982 | Wrong Answer | N = int(input())
ans = 0
for i in range(1, N+1):
ans += len([j for j in range(1, i) if i % j == 0]) == 8
print(ans)
|
p03281 | s306795811 | Wrong Answer | from random import*;print(randint(0,5)) |
p03281 | s764682541 | Wrong Answer | #import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
import heapq
from fractions import gcd
#input=sys.stdin.readline
import bisect
n=int(input())
ans=0
for i in range(1,n+1,2):
s=set()
for j in range(1,int(pow(i,0.5)+1)):
if i%j==0:
s.add(j)
s.add(i//j)
if len(s)==8:
print(s)
ans+=1
print(ans) |
p03281 | s064607769 | Wrong Answer | 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<189 :
print(2)
else :
print(3) |
p03281 | s242664543 | Wrong Answer | n=int(input())
if n<105:
print(0)
elif 105<=n and n<135:
print(1)
elif 135<=n and n<189:
print(2)
else:
print(3)
|
p03281 | s452836703 | Wrong Answer | def divsor(num):
count=0
for i in range(1,num+1):
if num%i==0:
count+=1
return count
n=int(input())
if(n<=105):
if(n==105):
print(1)
elif(n<105):
print(0)
res=1
for i in range(106,n+1):
if(divsor(i)==8 and i%2==1):
res+=1
print(res) |
p03281 | s870120068 | Wrong Answer | N = int(input())
count_1 = 0
for i in range(1,N+1,2):
count_2 = 0
for j in range(1,i+1,2):
if N % j == 0:
count_2 += 1
if count_2 == 8:
count_1 += 1
print(count_1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.