problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02608 | s362276645 | Wrong Answer | N = int(input())
L=[0]*N
for x in range(1,int(N**0.5)):
for y in range(1,int(N**0.5)):
for z in range(1,int(N**0.5)):
f=x**2+y**2+z**2+x*y+y*z+z*x
if f<=N:
if x==y and x==z:
L[f-1]=1
else:
L[f-1]=3
for i in range(N):
print(L[i]) |
p02608 | s636552397 | Wrong Answer | import itertools
n = int(input())
ans = [0] * n
for x,y,z in itertools.combinations_with_replacement(list(range(1,10**2+1)),3):
a = x**2 + y**2 + z**2 + x*y + y*z + z*x
if a > n: continue
if x==y==z: b = 1
elif x==y or x==z or y==z: b = 3
else: b = 6
ans[a-1] = b
for i in ans: print(i) |
p02608 | s223047395 | Wrong Answer | N = int(input())
cnt = 0
for n in range(1,N+1):
for z in range(1,35):
for y in range(1,35):
for x in range(1,35):
if x*x+y*y+z*z+x*y+y*z+z*x == n:
cnt +=1
print(cnt)
cnt=0 |
p02608 | s914609909 | Wrong Answer | import itertools
n=int(input())
mylist=[0]*n
a=1
while(6*(a**2)<n):
a+=1
l=list(range(1,3*a-1))
for c in itertools.product(l,repeat=3):
sum_num=sum(c)**2-(c[0]*c[1]+c[1]*c[2]+c[2]*c[0])
if sum_num<n:
mylist[sum_num-1]+=1
for i in mylist:
print(i) |
p02608 | s848014001 | Wrong Answer | n = int(input())
ans = [0 for _ in range(10**4 + 100)]
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
p = x**2 + y**2 + z**2 + x * y + y * z + z * x
if p <= 10**4:
ans[p] += 1
for i in range(n + 1):
print(ans[i]) |
p02608 | s597589210 | Wrong Answer | def main():
n = int(input())
for i in range(n):
calc(i)
def calc(n):
count = 0
for x in range(1, n + 1):
for y in range(1, n + 1):
for z in range(1, n + 1):
a = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if a == n+1:
count += 1
if a > n+1:
break
print(count)
return |
p02608 | s441519631 | Wrong Answer | from math import sqrt
l = [-1]+[0]*10**4
n = int(input())
for i in range(1,int(sqrt(n))+1):
for j in range(1,int(sqrt(n))+1):
for k in range(1,int(sqrt(n))+1):
ans = i**2+j**2+k**2+i*j+j*k+k*i
if ans <= 10*4:
l[ans] += 1
for i in range(1,n+1):
print(l[i]) |
p02608 | s512487096 | Wrong Answer | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n = int(input())
r = [0]*100000
for i1 in range(1,20):
for i2 in range(1,20):
for i3 in range(1,20):
t = i1**2 + i2**2 + i3**2 + i1*i2 + i2*i3 + i1*i3
r[t] += 1
print(*r[1:n+1],sep='\n')
if __name__ == '__main__':
main()
|
p02608 | s495558585 | Wrong Answer | N = int(input())
Xlist = [0]*(10**4)
for i in range(75):
for j in range (70):
for k in range(70):
A = (i + j + 2)**2 + (k + j + 2)**2 + (i + k + 2)**2
if ((A % 2) == 0)and(A <= 20000):
Xlist[(A//2 -1)] += 1
for a in range (N):
print(Xlist[a])
|
p02608 | s585681232 | Wrong Answer | import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
N = ri()
f = [0] * N
for x in range(1,100+1):
for y in range(1, 100+1):
for z in range(1, 100+1):
h = x**2 + y**2 + z**2 + x*y + y*z + z*x
if h > N - 1:
continue
f[h - 1] += 1
for i in range(N):
print(f[i])
|
p02608 | s068397075 | Wrong Answer | N = int(input())
for n in range(1, N+1):
cnt = 0
for x in range(100):
for y in range(100):
for z in range(100):
if (x + y + z) ** 2 - (x * y) - (y * z) - (z * x) == n:
cnt += 1
print(cnt) |
p02608 | s810137012 | Wrong Answer | import collections
ans_list = []
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
tmp = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if tmp <= 10000:
ans_list.append(tmp)
ans_list = sorted(ans_list)
print(ans_list)
N = int(input())
c = collections.Counter(ans_list)
for i in range(1, N + 1):
print(c[i])
|
p02608 | s555560968 | Wrong Answer | N = int(input())
res=[0] * 10000
for x in range(1,42):
for y in range(1,42):
for z in range(1,42):
k=x*x+y*y+z*z+x*y+y*z+z*x
if k>10000: continue
res[k-1]+=1
for i in range(N):
print(res[i])
|
p02608 | s333397864 | Wrong Answer | N = int(input())
a = [0 for x in range(N)]
for i in range(1,N+1):
for j in range(1,N+1):
for k in range(1,N+1):
n = i*i+j*j+k*k+i*j+j*k+i*k
if n < N:
a[n] += 1
for i in range(N):
print(a[i])
|
p02608 | s912718264 | Wrong Answer | import math
n = int(input())
ans = [0]*n
max = int(math.sqrt(max(n-2,1)))
for x in range(1,max):
for y in range(1,max):
for z in range(1,max):
ns = x**2 + y**2 + z**2 + x*y + y*z + z*x
if ns < n:
ans[ns-1] += 1
for a in range(n):
print(ans[a])
|
p02608 | s519123455 | Wrong Answer | N = int(input())
results = [0] * N
def g(x, y, z):
return x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
for x in range(1,32):
for y in range(1, 32):
for z in range(1, 32):
w = g(x,y,z)
if w > N: break
results[w - 1] += 1
for result in results:
print(result) |
p02608 | s878372703 | Wrong Answer | n = int(input())
from itertools import product
l = list(range(1, 100+1))
f = [0 for _ in range(11000)]
def func(x,y,z):
return x**2 + y**2 + z**2 + x*y + y*z + z*x
for x, y, z in product(l, l, l):
v = func(x,y,z)
if v <= n:
f[v] += 1
for ans in f[:n]:
print(ans)
|
p02608 | s327884642 | Wrong Answer | import math
n = int(input())
for i in range(6, n + 1):
cnt = 0
f = int(math.sqrt(n)) + 1
for x in range(1, f):
for y in range(1, f):
for z in range(1, f):
# print(i, x, y, z)
if (x ** 2) + (y ** 2) + (z ** 2) + (x * y) + (y * z) + (z * x) == i:
cnt += 1
print(cnt) |
p02608 | s506583209 | Wrong Answer | n = int(input())
ans = [0]*(n+1)
for x in range(1,20):
for y in range(1,20):
for z in range(1,20):
ni = x**2 + y**2 + z**2 + x*y + y*z + z*x
if ni <= n:
ans[ni] += 1
for i in range(1, n+1):
print(ans[i])
|
p02608 | s201086325 | Wrong Answer | n = int(input())
ans = [0] * (n + 1)
loop = int((n/6) ** .5) + 1
def f(i, j, k):
return i ** 2 + j ** 2 + k ** 2 + i*j + j*k + k*i
for i in range(1, loop+1):
for j in range(1, loop+1):
for k in range(1, loop+1):
res = int(f(i, j, k))
if res <= n:
ans[res] += 1
for a in ans[1:]:
print(a)
|
p02608 | s589957239 | Wrong Answer | # -*- coding: utf-8 -*-
import math
n = int(input())
for i in range(n + 1):
s = 0
p = math.floor(n / 6) + 1
if i > 5:
for x in range(1, p + 1):
for y in range(1, p + 1):
for z in range(1, p + 1):
if (x**2) + (y**2) + (z**2) + (x*y) + (y*z) + (z*x) == i:
s += 1
print(s)
|
p02608 | s178979476 | Wrong Answer | n = int(input())
table = [0]*(10**4+100)
for x in range(1,42):
for y in range(1,42):
for z in range(1,42):
total = x**2 + y**2 + z**2 + x*y + y*z + z*x
table[total] += 1
for i in table[1:n+1]:
print(i) |
p02608 | s443425529 | Wrong Answer | n=int(input())
ans=[0]*n
t=3
while (t-2)**2<n:
for i in range(1,t-1):
for j in range(1,t-i):
k=t-i-j
if t**2-i*j-j*k-k*i-1<n:
ans[t**2-i*j-j*k-k*i-1]=ans[t**2-i*j-j*k-k*i-1]+1
t=t+1
for i in range(n):
print(ans[i]) |
p02608 | s798491198 | Wrong Answer | n = int(input())
count_n = []
ans = []
for o in range(n):
temp = 0
for i in range(1,20):
for j in range(1,20):
for k in range(1,20):
if o == i ** 2 + j **2 + k ** 2 + i * j + j * k + k * i:
count_n.append(o)
for i in range(1,n+1):
if i not in count_n:
ans.append(0)
else:
ans.append(count_n.count(i))
print(ans) |
p02608 | s365003973 | Wrong Answer | n=int(input())
def f(i):
co=0
for z in range(1,7):
for y in range(1,7):
for x in range(1,7):
if x**2+y**2+z**2+z*y+z*x+y*x==i:
co+=1
return co
for i in range(1,n+1):
co=f(i)
print(co) |
p02608 | s757764809 | Wrong Answer | n = 10**4
k = [0]*10**4
for x in range(1,5):
for y in range(1,5):
for z in range(1,5):
for i in range(n+1):
if (x+y+z)**2 -(x*y+y*z+z*x) == i:
k[i-1] += 1
for i in range(int(input())):
print(k[i]) |
p02608 | s078330320 | Wrong Answer | n=int(input())
ans = [0 for _ in range(10001)]
for i in range(101):
for j in range(101):
for k in range(101):
v = i*i + j*j + k*k + i*j + j*k + k*i
if v < 10001:
ans[v] += 1
for i in range(n):
print(ans[i+1]) |
p02608 | s490855444 | Wrong Answer | n = [0 for i in range(10001)]
for z in range(1, 59, 1):
for y in range(1, 59, 1):
for x in range(1, 59, 1):
tmp = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if tmp > 10 ** 4:
break
else:
n[tmp] += 1
N = int(input())
for i in range(1, N+1, 1):
print(n[i]) |
p02608 | s541780089 | Wrong Answer | n=int(input())
ans=0
for i in range(1,n+1):
cnt=0
for x in range(1,101):
if x**2>i:
break
for y in range(1,x+1):
if x**2+y**2>i:
break
for z in range(1,y+1):
if x**2+y**2+z**2+x*y+y*z+z*x==i:
cnt+=3
ans=cnt
if i==6:
ans=1
print(ans) |
p02608 | s729544313 | Wrong Answer | #C
import math
N = int(input())
count = [0] * 10100
for j in range(1, 105):
for k in range(1, 105):
for l in range(1, 105):
v = (j+k+l) ** 2 - (j*k + k*l + l*j)
if v <= 10050:
count[v] += 1
for i in range(1, N):
print(count[i]) |
p02608 | s616749237 | Wrong Answer | N = int(input())
ans = list()
for i in range(N+1):
ans.append(0)
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
tmp = x**2 + y**2 + z**2 + x*y + y*z + z*x
if tmp < N:
ans[tmp] += 1
for i in range(N):
print(ans[i+1]) |
p02608 | s721892154 | Wrong Answer | N = int(input())
n = N ** (1/2)
n = int(n)
for nn in range(N):
ans = 0
for x in range(1, n + 1):
for y in range(1, n + 1):
a = x + y
b = x*x + y*y + x*y - nn
if a*a -4*b >= 0:
c = ((a*a-4*b)**(1/2)-a)/2
if c.is_integer() and c > 0:
ans += 1
print(ans)
|
p02608 | s003439589 | Wrong Answer | n = int(input())
l = [0 for i in range(n+1)]
for i in range(1, n):
x = (i**2)*6
if x <= n:
l[x] = 1
else:
break
x = 11
s = 7
for _ in range(10**9):
if x <= n:
l[x] = 3
x += s
s += 2
else:
break
x = 17
s = 17
for _ in range(10**9):
if x <= n:
l[x] = 3
x += s
s += 6
else:
break
l.pop(0)
for i in range(n):
print(l[i])
|
p02608 | s540090119 | Wrong Answer | def triplets_brute(n):
counter = 0
upper = round(n**0.5)
for x in range(1, upper+1):
for y in range(1, upper+1):
for z in range(1, upper+1):
if x**2+y**2+z**2+x*y+y*z+z*x==n:
counter += 1
print(triplets_brute(int(input()))) |
p02608 | s941527806 | Wrong Answer | import math
N = int(input())
for i in range(1, N+1):
ans = 0
for x in range(1, round(math.pow(i, 1/3))):
for y in range(1, round(math.pow(i, 1/3))):
for z in range(1, round(math.pow(i, 1/3))):
tmp = x**2 + y**2 + z**2 + x*y + y*z + z*x
if tmp == i:
ans += 1
print(ans) |
p02608 | s667453431 | Wrong Answer | import numpy as np
n = int(input())
ans = [0 for _ in range(n+1)]
tmp = int(np.sqrt(n)+1)
for i in range(1, tmp):
for j in range(1, tmp):
for k in range(1, tmp):
v = i**2+j**2+k**2+i*j+i*k+j*k
if v < n:
ans[v]+=1
for a in ans[1:]:
print(a)
|
p02608 | s166024047 | Wrong Answer | from collections import defaultdict
import math
n=int(input())
d=defaultdict(int)
if n>2:
m=int(math.sqrt(n))
for l in range(1,m+4):
for i in range(1,l-1):
for j in range(1,l-i):
k=l-i-j
N=i*i+j*j+k*k+i*j+j*k+k*i
d[N]+=1
for i in range(1,n+1):
print(d[i]) |
p02608 | s747955344 | Wrong Answer | N = int(input())
ans = [0] * (N + 5)
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
tmp = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if N >= tmp:
ans[tmp] += 1
for i in range(N+1):
print(ans[i])
|
p02608 | s278077194 | Wrong Answer | ans = [0 for i in range(10050)]
for i in range(1, 105):
for j in range(1, 105):
for k in range(1, 105):
v = i**2 + j**2 + k**2 + i*j + j*k + i*k
if v < 10050:
ans[v] +1
n = int(input())
for i in range(n):
print(ans[i+1])
|
p02608 | s271189041 | Wrong Answer | from collections import defaultdict
dict=defaultdict(lambda:0)
n=int(input())
for x in range(1,100):
for y in range(1, 100):
for z in range(1,100):
p=(x+y+z)**2-(x*y+y*z+z*x)
dict[p]+=1
for i in range(1,n):
print(dict[i]) |
p02608 | s129894956 | Wrong Answer | import itertools
N = int(input())
lst = [0]*N
for x,y,z in itertools.product(list(range(1,int(N**0.5))),repeat=3):
val = x*x + y*y +z*z + x*y + y*z + z*x
if val <= N-1:
lst[val-1] += 1
print(*lst,sep="\n")
|
p02608 | s447709955 | Wrong Answer | import math
N = int(input())
zeros = [0 for i in range(N+1)]
for x in range(1,int(math.sqrt(N))):
for y in range(1,int(math.sqrt(N))):
for z in range(1,int(math.sqrt(N))):
n = x**2 + y**2 + z**2 + x*y + y*z + z*x
if n < N:
zeros[n]+=1
for i in range(N):
print(zeros[i+1]) |
p02608 | s037806694 | Wrong Answer | N = int(input())
record = [0] * 1000000
for i in range(1,N):
for j in range(1,N):
sum = i**2 + i**2 + j**2 + i*i + i*j +j*i
if sum >= N: break
# print(i,j)
record[sum] += 3
for num in record[1:N+1]:
print(num)
|
p02608 | s052867002 | Wrong Answer | N = int(input())
A = []
for i in range(1,46):
for j in range(1,46):
for k in range(1,46):
A.append(i**2+j**2+k**2+i*j+i*k+j*k)
A = sorted(A)
B = [0]*10001
for i in range(10001):
if A[i] < 10001:
B[A[i]] += 1
C = B[1:N+1]
[print(i) for i in C] |
p02608 | s056912662 | Wrong Answer | N=int(input())
ans = [0]*10000000
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
ans[i**2+j**2+k**2+i*j+j*k+i*k] += 1
for i in range(N):
print(ans[i])
|
p02608 | s149220794 | Wrong Answer | from math import sqrt, floor
N = int(input())
d = [0] * (N+1)
k = floor(sqrt(N))
for x in range(1, k):
for y in range(1, k):
for z in range(1, k):
c = x*x + y*y + z*z + x*y + y*z + z*x
if 1 <= c <= N:
d[c] += 1
for i in range(1, N):
print(d[i]) |
p02608 | s353646313 | Wrong Answer | N = int(input())
ans = [0]*(N+1)
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
tmp = x*x+y*y+z*z+x*y+y*z+z*x
if 1 <= tmp <= N:
ans[tmp] += 1
for i in ans:
print(i) |
p02608 | s069015243 | Wrong Answer | n = int(input())
ans = [0,0,0,0,0,1,0,0,0,0,3,0,0,0,0,0,3,3,0,0]+[0 for i in range(n-20)]
for i in range(21,n+1):
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
if x**2+y**2+z**2+x*y+y*z+z*x == i:
ans[i-1]+=1
for i in ans:
print(i) |
p02608 | s379919819 | Wrong Answer | N=int(input())
ans=[0]*(10**5)
L=list(i for i in range(1,40))
from itertools import*
P=list(product(L,repeat=3))
for x,y,z in P:
ans[x**2+y**2+z**2+x*y+y*z+z*x-1]+=1
for a in ans[:N]:
print(a) |
p02608 | s537058029 | Wrong Answer | N = int(input())
cnt = [0] * N
for x in range(1, 50):
for y in range(1, 50):
for z in range(1, 50):
tmp = x * x + y * y + z * z + x * y + y * z + z * x
if tmp <= N:
cnt[tmp-1] += 1
for i in range(N):
print(cnt[i]) |
p02608 | s249647019 | Wrong Answer | n = 10**4
k = [0]*10**4
for x in range(1,9):
for y in range(1,9):
for z in range(1,9):
for i in range(n+1):
if (x+y+z)**2 -(x*y+y*z+z*x) == i:
k[i-1] += 1
for i in range(int(input())):
print(k[i]) |
p02608 | s396331989 | Wrong Answer | n = int(input())
num = [0] * 10001
for i in range(1, 142):
for j in range(1, 142):
for k in range(1, 142):
temp = i + j + k
if temp % 2 == 0:
if i + j > k and j + k > i and k + i > j:
temp2 = (i ** 2 + j ** 2 + k ** 2) // 2
if 0 <= temp2 <= 1000:
num[temp2] += 1
for i in range(1, n + 1):
print(num[i]) |
p02608 | s623374093 | Wrong Answer | import itertools
N = int(input())
lst = [0]*N
for x,y,z in itertools.product(list(range(1,int(N**0.5)+1)),repeat=3):
val = x*x + y*y + z*z + x*y + y*z + z*x
if val <= N-1:
lst[val-1] += 1
print(*lst,sep="\n")
|
p02608 | s286550463 | Wrong Answer | import numpy as np
N = int(input())
ans = np.zeros((10**4+5))
for i in range(1,51):
for j in range(1,51):
for l in range(1,51):
f = (i+j)**2+(j+l)**2+(l+i)**2
if((f%2==0) and (f<=2*10**4)):
ans[int(f/2)] += 1
for i in range(1,N+1):
print(int(ans[i])) |
p02608 | s093539189 | Wrong Answer | n = int(input())
for i in range(1,n+1):
cnt = 0
for x in range(1,32):
for y in range(1,32):
for z in range(1,32):
if x**2 + y**2 + z**2 +x*y + y*z + z*x == i:
cnt += 1
print(cnt) |
p02608 | s306133936 | Wrong Answer | import math
n=int(input())
for i in range(n):
cnt=0
sq=int(math.sqrt(n))
for x in range(1,sq):
for y in range(1,sq):
for z in range(1,sq):
if x**2+y**2+z**2+x*y+y*z+z*x==i:
cnt+=1
print(cnt) |
p02608 | s140577411 | Wrong Answer | N = int(input())
ls = [0]*15000
for i in range(1,42):
for j in range(1,42):
for k in range(1,42):
t = i**2 + j**2 + k**2 + i*j + j*k + k*i
ls[t-1] = ls[t-1] + 1
for p in range(0,N):
print(ls[p]) |
p02608 | s315337015 | Wrong Answer | n = int(input())
num = [0]*1000
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
a = x**2 + y**2 + z**2 + x*y + y*z + z*x - 1
if a <= 1000:
num[a] += 1
num = num[:n]
for i in num:
print(i)
|
p02608 | s652644580 | Wrong Answer | N = int(input())
for n in range(1,N+1):
ans = 0
check = False
for x in range(1,42):
for y in range(x,42):
for z in range(y,42):
if (x**2 + y**2 + z**2 + x*y + y*z + z*x) == n:
if x == y and y == x and z == x:
ans += 1
elif x == y or z == x or y == z:
ans += 3
elif x != y and y != z and z != x:
ans += 6
print(ans) |
p02608 | s328526539 | Wrong Answer | n = int(input())
for i in range(1, n+1):
cnt = 0
for x in range(1, 33):
for y in range(1, 33):
for z in range(1, 33):
n = x*x + y*y + z*z + x*y + y*z + z*x
if i == n:
cnt += 1
print(cnt) |
p02608 | s039179123 | Wrong Answer | import sys
import numpy as np
import math
import collections
import copy
from collections import deque
from functools import reduce
from itertools import product
# input = sys.stdin.readline
N = int(input())
ans = [0 for _ in range(10050)]
for i in range(1, 105):
for j in range(1, 105):
for k in range(1, 105):
idx = i**2 + j**2 + k **2 + i*j + i*k + j*k
for i in range(N):
print(ans[i])
|
p02608 | s607762772 | Wrong Answer | import math
N = int(input())
enter = int(math.sqrt(N))
value_array = []
for x in range(7, enter+1):
for y in range(7, enter+1):
for z in range(7, enter+1):
value_array.append(x**2 + y **2 + z ** 2 + x*y + y*z + z*x)
for i in range(1, N+1):
print(value_array.count(i)) |
p02608 | s916028708 | Wrong Answer | #!/usr/bin/env python3
n = int(input())
cnt = [0] * (1 + n)
for a in range(1, 33):
for b in range(1, 33):
for c in range(1, 33):
k = a ** 2 + b ** 2 + c ** 2 + a * b + b * c + c * a
if k > n:
continue
else:
cnt[k] += 1
for i in range(1, n + 1):
print(cnt[i])
|
p02608 | s473515406 | Wrong Answer | from itertools import combinations_with_replacement
N = int(input())
ans = list(0 for _ in range(N))
for L in combinations_with_replacement(range(1, 6), 3):
x = L[0]
y = L[1]
z = L[2]
A = x**2 + y**2 + z**2 + x*y + y*z + z*x
if A <= N:
if x == y and y == z:
ans[A - 1] += 1
elif x == y or y == z or z == x:
ans[A - 1] += 3
else:
ans[A - 1] += 6
for a in ans:
print(a) |
p02608 | s930964958 | Wrong Answer | import math
N = int(input())
A = 8
for n in range(1, N+1):
num = 0
for i in range(1, A):
for j in range(1, A):
for k in range(1, A):
if math.pow(i + j + k, 2) == (i * j + j * k + k * i) + n:
num += 1
print(num)
|
p02608 | s947189746 | Wrong Answer | N=int(input())
cnt=[0]*(N+1)
li=[]
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
li.append(x**2+y**2+z**2+x*y+y*z+z*x)
for i in li:
if i<=N:
cnt[i]+=1
print(*cnt,sep='\n') |
p02608 | s886102157 | Wrong Answer | from collections import Counter
def main():
n = int(input())
ans = []
for x in range(1, n):
for y in range(1, n):
for z in range(1, n):
ans.append(x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x)
counter = Counter(ans)
for i in range(1, n):
print(counter[i])
if __name__ == '__main__':
main() |
p02608 | s417833849 | Wrong Answer | N = int(input())
x, y, z = 1,1,1
ans_dict = {}
for x in range(1,100):
for y in range(1,100-x):
for z in range(1,100-x):
ans = (x + y)**2 + (y + z)**2 + (z + x)**2
if ans in ans_dict:
ans_dict[ans] += 1
else:
ans_dict[ans] = 1
for n in range(1, N+1):
if 2*n in ans_dict:
print(ans_dict[2*n])
else:
print(0)
|
p02608 | s896505853 | Wrong Answer | N = int(input())
A = []
for i in range(1,46):
for j in range(1,46):
for k in range(1,46):
A.append(i**2+j**2+k**2+i*j+i*k+j*k)
A = sorted(A)
B = [0]*N
for i in range(N):
if A[i] < N:
B[A[i]] += 1
C = B[1:]
[print(i) for i in C] |
p02608 | s872687241 | Wrong Answer | def func(x,y,z):
return x**2+y**2+z**2+x*y+y*z+z*x
n = int(input())
ans = 0
arr = []
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
arr.append(func(x,y,z))
for i in range(n):
print(arr.count(i)) |
p02608 | s197292205 | Wrong Answer | #import sys
#input = sys.stdin.readline
import math
from collections import defaultdict,deque
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()
"""========main code==============="""
n=ii()
d=defaultdict(int)
for i in range(1,90):
for j in range(1,90):
for k in range(1,90):
w=i*i+j*j+k*k+i*j+i*k+j*k
d[w]+=1
for i in range(1,n+1):
print(d[i]) |
p02608 | s580548038 | Wrong Answer | input_number = input()
for n in range(int(input_number)):
n += 1
count = 0
for x in range(1,101):
for y in range(101):
for z in range(101):
function = x*x+y*y+z*z+x*y+y*z+x*z
if n == function:
count += 1
print(count) |
p02608 | s569798411 | Wrong Answer | N = int(input())
A = [0]*(N+1)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
i = x**2 + y**2 + z**2 + x*y + y*z + z*x
if i < N:
A[i] += 1
for i in range(1, N+1):
print(A[i]) |
p02608 | s407323334 | Wrong Answer | n=int(input())
for i in range(n+1):
ans=0
for x in range(1,i):
for y in range(1,i):
for z in range(1,i):
if i==x*x+y*y+z*z+x*y+x*z+y*z:
ans+=1
print(ans) |
p02608 | s655811392 | Wrong Answer | n=int(input())
ans=[0]*10001
for x in range(1,46):
for y in range(1,46):
for z in range(1,46):
f= x**2 + y**2 + z**2 +x*y + y*z + z*x
if f<=n:
ans[f]+=1
for i in range(1,n):
print(ans[i])
|
p02608 | s579071943 | Wrong Answer | N = int(input())
ans = [0] * 10050
for x in range(1, 1105):
for y in range(1, 1105):
for z in range(1, 1105):
f = x**2 + y**2 + z**2 + x*y + y*z + z*x
if f < 10000:
ans[f-1] = ans[f-1] + 1
if f > N:
break
if f > N:
break
for i in range(N):
print(ans[i]) |
p02608 | s343759863 | Wrong Answer | n = int(input())
ans = [0 for _ in range(n+1)]
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
a = x**2+y**2+z**2+x*y+y*z+z*x
if a <= n:
ans[a] += 1
for i in range(n+1):
print(ans[i])
|
p02608 | s573501076 | Wrong Answer | n = int(input())
li = [0]*n
for i in range(1,32):
for j in range(1,32):
for k in range(1,32):
if i**2 + j**2 + k**2 + i*j + j*k + k*i <= n:
li[i**2 + j**2 + k**2 + i*j + j*k + k*i -1] += 1
for i in range(n):
print(li[i]) |
p02608 | s989319008 | Wrong Answer | import sys
import collections
n = int(sys.stdin.readline().rstrip("\n"))
l = []
for a in range(1,42):
for b in range(1,42):
for c in range(1,42):
l.append(a**2+b**2+c**2+a*b+b*c+c*a)
c = collections.Counter(l)
for i in range(1,n+1):
print(c[i]) |
p02608 | s571444815 | Wrong Answer | # coding: utf-8
N = int(input())
ANS = [0] * (N+1)
for i in range(1,101):
for j in range(1,101):
for k in range(1,101):
a = i**2 + j**2 + k**2 + i*j + j*k + k*i
if a <= N:
ANS[a] += 1
for a in ANS:
print(a) |
p02608 | s158209437 | Wrong Answer | #!/usr/bin/env python3
def func(n):
cnt = 0
for x in range(1, 20):
for y in range(1, 20):
for z in range(1, 20):
if x * x + y * y + z * z + x * y + y * z + z * x == n:
cnt += 1
return cnt
def main():
N = int(input())
for i in range(1, N + 1):
print(func(i))
if __name__ == "__main__":
main()
|
p02608 | s653616103 | Wrong Answer | n=int(input())
num=1
while True:
if (num*num)*6>n:
break
num=num+1
num=2*num
d={}
for i in range(1,n+1):
d[i]=0
for i in range(1,num+1):
for j in range(1,num+1):
for k in range(1,num+1):
val=(i*i)+(j*j)+(k*k)+(i*j)+(j*k)+(k*i)
if val>n:
continue
d[val]=d[val]+1
for i in range(1,n+1):
print(d[i]) |
p02608 | s494213408 | Wrong Answer | N = int(input())
f = {}
for x in range(1, 110):
for y in range(1, 110):
for z in range(1, 110):
t = x*x+y*y+z*z+x*y+y*z+z*x
f[t] = (f[t]+1 if t in f.keys() else 1)
for i in range(1, N):
print(f[i] if i in f.keys() else 0) |
p02608 | s540951814 | Wrong Answer | N = int(input())
d = {i+1: 0 for i in range(N)}
for i in range(1, int(N**0.5)):
for j in range(1, i+1):
for k in range(1, j+1):
n = i**2 + j**2 + k**2 + i*j + j*k + k*i
if n > N:
continue
if len(set([i, j, k])) == 1:
d[n] += 1
else:
d[n] += 3
for i in range(N):
print(d[i+1]) |
p02608 | s766217395 | Wrong Answer | N = int(input())
from collections import defaultdict
ansd = defaultdict(int)
def calc(x,y,z):
return x**2 + y**2 + z **2 + x*z + y*z + y*x
for x in range(1,45):
for y in range(1, 45):
for z in range(1,45):
ansd[calc(x,y,z)] += 1
for k in range(1, N+1):
print(ansd[k]) |
p02608 | s672273295 | Wrong Answer | N = int(input().strip())
s=[]
n=int(N**(0.34)//1)
for a in range (1,n+1):
for b in range(1,n+1):
for c in range(1,n+1):
s.append(a*a+b*b+c*c+a*b+b*c+c*a)
s.sort()
for l in range(1,N+1):
print(s.count(l)) |
p02608 | s589438856 | Wrong Answer | import math
n = int(input())
highest = int(math.sqrt(n))
print(highest)
l = [0]*n
cal = 0
for x in range(1, highest+1):
for y in range(1, highest+1):
for z in range(1, highest+1):
cal = x**2 + y**2 + z**2 + x*y + y*z + z*x
if cal > n:
continue
else:
l[cal-1] += 1
for i in range(len(l)):
print(l[i])
|
p02608 | s120345248 | Wrong Answer | from math import sqrt
N = int(input())
ans = [0] * (N+1)
for x in range(1, int(sqrt(N)) + 1):
for y in range(1,int(sqrt(N)) + 1):
for z in range(1, int(sqrt(N)) + 1):
n = x**2 + y**2 + z**2 + x*y + y*z + z*x
if n <= N:
ans[n] += 1
for a in ans:
print(a) |
p02608 | s605309057 | Wrong Answer | a = int(input())
b = round(a**0.5) + 1
print(b)
x = []
for i in range(1,b):
for j in range(1,b):
for k in range(1,b):
l = i**2 + j**2 + k**2 + i*j + j*k + k*i
x.append(l)
print(x)
t = [0] * a
for i in range(0,len(x)):
if x[i] <= a:
t[x[i]-1] = t[x[i]-1] + 1
print(t,len(t))
for i in t:
print(i) |
p02608 | s676348732 | Wrong Answer | def f(n):
cnt = 0
for x in range(1,3):
for y in range(1, 3):
for z in range(1,3):
if (((x**2 )+(y**2) +(z**2) +x*y +y*z+ z*x)) == n:
cnt += 1
return cnt
N=int(input())
for i in range(1,N+1):
print(f(i)) |
p02608 | s733406360 | Wrong Answer | from itertools import product
n = int(input())
for num in range(1, n+1):
count = 0
prod = product([1,2,3], repeat=3)
for i in prod:
x = i[0]
y = i[1]
z = i[2]
if x**2 + y**2 + z**2 +x*y + y*z + z*x == num:
count += 1
print(count)
|
p02608 | s526666141 | Wrong Answer | N = int(input())
ans = [0] * (N)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
n = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x - 1
if n <= N:
ans[n-1] += 1
for i in ans:
print(i)
|
p02608 | s276940157 | Wrong Answer | from math import sqrt
N = int(input())
ans = [0 for _ in range(N)]
num_m = (N-4)//2
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
n = x**2+y**2+z**2+x*y+y*z+z*x
if n <= N-1:
ans[n-1] += 1
print(*ans, sep="\n") |
p02608 | s909816235 | Wrong Answer | import math
N = int(input())
zeros = [0 for i in range(N+1)]
for x in range(1,int(math.sqrt(N))+1):
for y in range(1,int(math.sqrt(N))+1):
for z in range(1,int(math.sqrt(N))+1):
n = x**2 + y**2 + z**2 + x*y + y*z + z*x
if n < N:
zeros[n]+=1
for i in range(N):
print(zeros[i+1]) |
p02608 | s524473539 | Wrong Answer | n = int(input())
ans = [0 for i in range(n)]
for x in range(1,41):
for y in range(1,41):
for z in range(1,41):
n_2 = x ** 2 + y ** 2 + z ** 2 + x*y + x*z + y*z
if n_2 > int(len(ans)):
continue
ans[n_2-1] += 1
for i in range(n):
print(ans[i])
|
p02608 | s181442508 | Wrong Answer | import math
n = int(input())
highest = int(math.sqrt(n))
l = [0]*n
cal = 0
for x in range(1, highest+1):
for y in range(1, highest+1):
for z in range(1, highest+1):
cal = x**2 + y**2 + z**2 + x*y + y*z + z*x
if cal > n-1:
continue
else:
l[cal-1] += 1
for i in range(len(l)):
print(l[i]) |
p02608 | s451150786 | Wrong Answer | n = int(input())
ans = [0 for _ in range(n+1)]
def calc(n):
for x in range(1, int(n**0.5)):
for y in range(1, int(n**0.5)):
for z in range(1, int(n**0.5)):
v = x**2 + y**2 + z**2 + x*y + y*z + z*x
if v < n+1:
ans[v] += 1
calc(n)
for i in range(1, n):
print(ans[i+1])
|
p02608 | s001687594 | Wrong Answer | from itertools import product
n = int(input())
pro = product([x for x in range(1,7)],repeat=3)
lst = [0]*n
for p in pro:
for i in range(1,n+1):
if ((p[0]**2) + (p[1]**2) + (p[2]**2) + (p[0]*p[1]) + (p[1]*p[2]) + (p[2]*p[0])) == i:
lst[i-1]+=1
for i in lst:
print(i) |
p02608 | s271493316 | Wrong Answer | import itertools
import pprint
n = int(input())
result = [0]*15000
maxnum = 50
xlist, ylist, zlist = range(1, maxnum), range(1, maxnum), range(1, maxnum)
p = itertools.product(xlist, ylist, zlist)
for each in p:
x, y, z = each
result[x*x+y*y+z*z+x*y+y*z+z*x] += 1
print('\n'.join(str(each) for each in result[1:n+1])) |
p02608 | s566783189 | Wrong Answer | n=int(input())
for i in range(n):
ans=0
for x in range(1,i):
for y in range(1,i):
for z in range(1,i):
if i==x*x+y*y+z*z+x*y+x*z+y*z:
ans+=1
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.