problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02608 | s315973647 | Wrong Answer | n = int(input())
ans = [0] * (n+1)
def f(x, y, z):
return x**2+y**2+z**2+x*y+y*z+x*z
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
c = f(x, y, z)
if c <= n:
ans[c] += 1
for a in ans:
print(a)
|
p02608 | s247588732 | Wrong Answer | from itertools import combinations_with_replacement
n = int(input())
for i in range(1, n+1):
ans = 0
for v in combinations_with_replacement(range(1, 30), 3):
x, y, z = v
if x**2 + y**2 + z**2 + x*y + y*z + z*x == i:
if x == y == z:
ans = 1
else:
ans = 3
break
print(ans) |
p02608 | s959110871 | Wrong Answer | N = int(input())
for n in range(1,N+1):
ans = 0
check = False
for x in range(1,min(n,42)):
for y in range(x,min(n,42)):
for z in range(y,min(n,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 | s974765924 | Wrong Answer | #coding:utf-8
import itertools
def calculate(x,y,z):
return x**2+y**2+z**2+x*y+y*z*x
n = int(input())
result_lst = [0] * n
for i,j,k in itertools.product(range(1,n+2),repeat=3):
result = calculate(i,j,k)
if result < n:
result_lst[result] += 1
for i in result_lst:
print(str(i))
|
p02608 | s858129853 | Wrong Answer | n = int(input())
x = int(n**0.5)+1
cnt = [0]*(n+1)
for i in range(1,x):
for j in range(1,x):
for k in range(1,x):
res = i**2+j**2+k**2+i*j+j*k+k*i
if res < n: cnt[res] += 1
for i in range(1,n+1): print(cnt[i]) |
p02608 | s021013110 | Wrong Answer | N = int(input())
from collections import defaultdict
res = defaultdict(list)
# 解の候補を生成
# x,y,zそれぞれに対して√1000位までやればよさそう
limit = int(1000**.5)+1
for x in range(1, limit):
for y in range(1, limit):
for z in range(1, limit):
f = x**2 + y**2 + z**2 + x*y + y*z + z*x
res[f].append((x,y,z))
for i in range(1, N+1):
print(len(res[i])) |
p02608 | s457272333 | Wrong Answer | N = int(input())
res = [0] * N
for x in range(1, 102):
for y in range(1, 102):
for z in range(1, 102):
t1 = (x + y + z) ** 2
if t1 > 11000:
break
n = t1 - x * y - y * z - z * x - 1
if n >= N:
break
res[n] += 1
for o in res:
print(o) |
p02608 | s647142863 | Wrong Answer | N = int(input())
from collections import defaultdict
res = defaultdict(list)
# 解の候補を生成
# x,y,zそれぞれに対して√1000位までやればよさそう
limit = int(1000**.5)+1
for x in range(1, limit):
for y in range(1, limit):
for z in range(1, limit):
f = x**2 + y**2 + z**2 + x*y + y*z + z*x
res[f].append((x,y,z))
for i in range(1, N+1):
# 重複組み合わせは除外する
print(len(set(res[i]))) |
p02608 | s961934429 | Wrong Answer | n = int(input())
ans = [0] * (n + 1)
for x in range(1, 33):
for y in range(1, 33):
for z in range(1, 33):
if x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x < n:
ans[x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x] += 1
for i in range(1, n + 1):
print(ans[i]) |
p02608 | s537573932 | Wrong Answer | n = int(input())
for i in range(1, n+1):
cnt = 0
for x in range(1, 34):
for y in range(1, 34):
for z in range(1, 34):
n = x*x + y*y + z*z + x*y + y*z + z*x
if i == n:
cnt += 1
print(cnt) |
p02608 | s632210175 | Wrong Answer | n = int(input())
c = [0]*10001
for x in range(1,101):
if(x > n):
break
for y in range(x,101):
for z in range(y,101):
p = int(((x+y)*(x+y) + (y+z)*(y+z) + (z+x)*(z+x))/2)
if(n >= p):
c[p] += 1
for i in range(1,n+1):
print(c[i])
|
p02608 | s200521926 | 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):
d = x * x + y * y + z * z + x * y + y * z + z * x
if d < n:
ans[d - 1] += 1
for i in ans:
print(i)
|
p02608 | s721974934 | Wrong Answer | N = int(input())
num = [0]*N
for i in range(1,10**2 + 1):
for j in range(1,10**2 + 1):
for k in range(1,10**2 + 1):
ans = i**2 + j**2 + k**2 + i*j + j*k + k*i
if ans < N:
num[ans] += 1
for i in range(N):
print(num[i])
|
p02608 | s531958616 | Wrong Answer | #coding: UTF-8
import math
N = int(input())
#print(N)
for i in range(5):
print(0)
for i in range(6,N+1):
cnt = 0
m = int(math.sqrt(i))
#平方根までやればよい
for x in range(1,m):
for y in range(1,m):
for z in range(1,m):
a = (x+y+z)**2 -x*y -y*z - z*x
if a == i:
cnt += 1
print(cnt) |
p02608 | s601385556 | Wrong Answer | N=int(input())
for h in range(1,N+1):
num=0
for i in range(1,h-6):
for j in range(1,h-6):
for k in range(1,h-6):
if i**2+j**2+k**2+i*j+j*k+k*i==h:
num+=1
print(num)
|
p02608 | s256730307 | Wrong Answer | N=int(input())
C=[0]*(2*N + 1)
l=10**2
for i in range(l):
for j in range(l):
for k in range(l):
x=i+1
y=j+1
z=k+1
s=(x+y)*(x+y)+(x+z)*(x+z)+(z+y)*(z+y)
if(s<2*N):
C[s]+=1
for i in range(N):
print(C[2*(i+1)])
|
p02608 | s027818267 | Wrong Answer | N = int(input())
#A = list(map(int, input().split()))
ans = [0 for _ in range(N)]
for x in range(1, 151):
for y in range(1, 151):
for z in range(1, 151):
k = (x+y)**2+(y+z)**2+(z+x)**2
if k % 2 == 0 and k < 2*N:
ans[((x+y)**2+(y+z)**2+(z+x)**2)//2-1] += 1
for i in range(N):
print(ans[i]) |
p02608 | s375907880 | Wrong Answer | n = int(input())
L = [0 for i in range(10**4+1)]
for x in range(1, 45):
for y in range(1, 45):
for z in range(1, 45):
r = x**2 + y**2 + z**2 + x*z + x*y + z*y
if r <= 10000:
L[r] += 1
for i in range(1, n+1):
print(L[i])
|
p02608 | s179622600 | Wrong Answer | n = int(input())
f = [0]*15000
for x in range(1,50):
for y in range(1,50):
for z in range(1,50):
f[x**2+y**2+z**2+x*y+y*z+z*x-1]+=1
z+=1
y+=1
x+=1
for i in range(n):
print(f[i]) |
p02608 | s035214279 | Wrong Answer | import math
n = int(input())
ans = [0]*n
for i in range(n):
for x in range(1,math.floor(math.sqrt(n))):
for y in range(1,math.floor(math.sqrt(n))):
for z in range(1,math.floor(math.sqrt(n))):
if pow(x,2) + pow(y,2) + pow(z,2) + x*y + y*z + z*x == i:
ans[i] += 1
for i in range(n):
print(ans[i]) |
p02608 | s970042044 | Wrong Answer | import math
n = int(input())
n_2 = math.floor((n)**(1/2))
cnt = 0
for n in range(1,n+1):
cnt = 0
for x in range(1,n_2 +1):
for y in range(1, n_2 +1-x):
for z in range(1, n_2 +1-y-x):
if x+y+z == ((n + x*y + y*z + z*x)**(1/2)):
cnt +=1
print(cnt*3)
|
p02608 | s693549898 | Wrong Answer | n = int(input())
nums = [0]*n
m = n//6
for i in range(1,m+1):
if i**2//6 >= n: continue
for j in range(i, m+1):
if i**2 + j**2 + i*j >= n//2: break
for k in range(j, m+1):
t = i**2 + j**2 + k**2 + i*j + j*k + i*k
if t <= n:
if i == j and i == k: nums[t-1] += 1
else: nums[t-1] += 3
print(*nums, sep="\n") |
p02608 | s035840991 | Wrong Answer | n=int(input())
j=10501
l=[0 for i in range(j)]
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
v=x*x+y*y+z*z+y*x+x*z+z*y
if(v<j):
l[v]+=1
for i in range(n+1):
print(l[i+1]) |
p02608 | s984117696 | Wrong Answer | from itertools import product
N = int(input())
cnt = [0]*10000000
for x in range(1,51):
for y in range(1,51):
for z in range(1,51):
cnt[x**2 + y**2 + z**2 + x*y + y*z + z*x -1] += 1
for i in range(N):
print(cnt[i])
|
p02608 | s034518882 | Wrong Answer | n=int(input())
A=[0]*(n+1)
a=round(n**0.5)+1
for x in range(1,a):
for y in range(1,a):
for z in range(1,a):
b=x*x+y*y+z*z+x*y+y*z+z*x
if b<n:
A[b]+=1
for i in range(1,n+1):
print(A[i]) |
p02608 | s827260436 | Wrong Answer | def main():
N = int(input())
ans = [0 for i in range(N + 1)]
for x in range(1, 50):
for y in range(1, 50):
for z in range(1, 50):
s = x**2 + y**2 + z**2 + x*y + y*z + z*x
if 1 <= s <= N:
ans[s] += 1
for i in range(1, N + 1):
print(ans[i])
if __name__ == "__main__":
main() |
p02608 | s604870379 | Wrong Answer | n = int(input())
ans = [0 for i in range(10100)]
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
if x*x+y*y+z*z+x*y+y*z+z*x < 10000:
ans[x*x+y*y+z*z+x*y+y*z+z*x-1] += 1
for i in range(n):
print(ans[i])
|
p02608 | s907694963 | Wrong Answer | import math
def main():
N = int(input())
ans = [0]*(N+1)
rn = math.ceil(math.sqrt(N))
for x in range(1,rn):
for y in range(1,rn):
for z in range(1,rn):
k = x**2 + y**2 + z**2 + x*y + y*z + z*x
if k <= N:
ans[k-1] += 1
for i in range(len(ans)):
print(ans[i])
main() |
p02608 | s987274251 | Wrong Answer | N = int(input())
answer = 0
for n in range(1, N+1):
for x in range(1, 50):
for z in range(1, 50):
if 3* x**2 + z**2 + 2*x*z == n:
num_pair = [x, z]
if num_pair[0] == num_pair[1]:
answer = 1
break
else:
answer = 3
break
if answer != 0:
break
print(answer) |
p02608 | s430295599 | Wrong Answer | n = int(input())
ans = []
for i in range(n):
cnt = 0
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
if (x + y) ** 2 + (y + z) ** 2 + (z + x) ** 2 == i * 2:
cnt += 1
ans.append(cnt)
for i in range(n):
print(ans[i]) |
p02608 | s450955016 | Wrong Answer | import sys
import numpy as np
N = int(input())
o = [0] * (N+1)
for i in range(1, 100):
for j in range(1, 100):
for k in range(1, 100):
n = int(i*i + j*j + k*k + i*j + j*k + k*i)
if n > 1001:
break
if n < (N+1):
o[n] += 1
for i in range(N):
print(o[i+1])
|
p02608 | s941715632 | Wrong Answer | n = int(input())
memo = {}
for i in range(1,n//2+1):
for j in range(1,n//2+1-i):
for k in range(1,n//2+1-i-j):
key = str(i)+str(j)+str(k)
memo[key] = i**2+j**2+k**2+i*j+j*k+k*i
print(memo)
val = [num for num in memo.values()]
for i in range(1,n+1):
print(val.count(i)) |
p02608 | s763650147 | Wrong Answer | n = int(input())
ans = []
for i in range(1, n + 1):
cnt = 0
for x in range(1, 35):
for y in range(x,35):
for z in range(y, 100):
if (x + y) ** 2 + (y + z) ** 2 + (z + x) ** 2 == i * 2:
if x != y and y != z and z != x:
cnt += 6
elif x == y == z:
cnt += 1
else:
cnt += 3
ans.append(cnt)
for j in range(n):
print(ans[j]) |
p02608 | s350212772 | Wrong Answer | #!/usr/bin/env python3
def func(n):
cnt = 0
N = min(n, 18)
for x in range(1, N):
for y in range(1, N):
for z in range(1, N):
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 | s498039660 | Wrong Answer | n = int(input())
nums = [0]*n
m = int(n**0.5)+1
for i in range(1,m+1):
for j in range(i, m+1):
for k in range(j, m+1):
t = i**2 + j**2 + k**2 + i*j + j*k + i*k
if t <= n:
if i == j and i == k: nums[t-1] += 1
else: nums[t-1] += 3
print(*nums, sep="\n")
|
p02608 | s933509972 | Wrong Answer | N=int(input())
ans=[0]*N
hani=int(N**(0.5))+1
for i in range(1,hani):
for j in range(1,hani):
for k in range(1,hani):
v=i**2+j**2+k**2+i*j+j*k+k*i
if(v<N):
ans[v-1]=ans[v-1]+1
for i in ans:
print(i)
|
p02608 | s316143826 | Wrong Answer | n=int(input())
for i in range(1,n+1):
lim=int(i**(0.5))//int(6**(0.5))
ans=0
for x in range(1,lim+1):
for y in range(1,lim+1):
for z in range(1,lim+1):
if x**2+y**2+z**2+x*y+y*z+z*x==i:
ans+=1
if x**2+y**2+z**2+x*y+y*z+z*x>i:
break
print(ans) |
p02608 | s235224273 | Wrong Answer | N=int(input())
C=[0]*(2*N + 1)
l=10**2
for i in range(l):
for j in range(l):
for k in range(l):
x=i+1
y=j+1
z=k+1
s=(x+y)*(x+y)+(x+z)*(x+z)+(z+y)*(z+y)
if(s<2*N):
C[s]+=1
for i in range(N):
print(C[2*(i+1)])
|
p02608 | s233366246 | Wrong Answer | from itertools import combinations_with_replacement
n = int(input())
for i in range(1, n+1):
ans = 0
for v in combinations_with_replacement(range(1, 35), 3):
x, y, z = v
if x**2 + y**2 + z**2 + x*y + y*z + z*x == i:
if x == y == z:
ans = 1
else:
ans = 3
break
print(ans) |
p02608 | s187262018 | Wrong Answer | n = int(input())
for i in range(1,n+1):
cnt = 0
for x in range(1,30):
for y in range(1,30):
for z in range(1,30):
if x**2 + y**2 + z**2 + (x*z) + (x*y) + (y*z) == i:
cnt += 1
print(cnt)
|
p02608 | s453390128 | Wrong Answer | n = int(input())
answer_list = []
for x in range(1, 99, 1):
for y in range(1, 99, 1):
for z in range(1, 99, 1):
formula = (x+y+z)**2 - (x*y + y*z + z*x)
if formula >= n:
continue
else:
answer_list.append(formula)
answer_list = sorted(answer_list)
for i in range(0, n+1, 1):
print(answer_list.count(i)) |
p02608 | s570960354 | Wrong Answer | n = int(input())
l = []
ls = [0]*(n+1)
def cul(x,y,z):
return x**2+y**2+z**2+x*y+y*z+z*x
for i in range(1,int(n**0.5)):
for j in range(1,int(n**0.5)):
for k in range(1,int(n**0.5)):
a = cul(i,j,k)
if a < n:
ls[a] += 1
for i in ls[1::]:
print(i) |
p02608 | s870478586 | Wrong Answer | N = int(input())
num = [0]*N
for i in range(1,10**2):
for j in range(1,10**2):
for k in range(1,10**2):
ans = i**2 + j**2 + k**2 + i*j + j*k + k*i
if ans < N:
num[ans] += 1
for i in range(N):
print(num[i])
|
p02608 | s979112782 | Wrong Answer | import sys
import numpy as np
N = int(input())
o = [0] * (N+1)
for i in range(1, 100):
for j in range(1, 100):
for k in range(1, 100):
n = int( ((i+j) * (j+k)) + i*i + k*k)
if n < (N+1):
o[n] += 1
if n > 1001:
break
for i in range(N):
print(o[i+1]) |
p02608 | s782728348 | Wrong Answer | import itertools
n = int(input())
N = 1
while N**2 < n:
N += 1
if N ** 2 > n: N-=1
ans = [0] * n
for x,y,z in itertools.combinations_with_replacement(list(range(1,N+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 | s934964719 | Wrong Answer | n = int(input())
arr = [0] * (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*z + y*z + x*z
if a<= n:
arr[a] += 1
for i in range(1,n+1):
print(arr[i]) |
p02608 | s552380790 | Wrong Answer |
n = int(input())
#print(n)
ptn = [0 for _ in range(20000)]
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
if x+y+z <= 101:
ptn[x**2 + y**2 + z**2 + x*y + y*z + x*z] += 1
for i in range(1, n+1):
print(ptn[i])
|
p02608 | s561936214 | Wrong Answer | N = int(input())
A = []
for i in range(1,105):
for j in range(1,105):
for k in range(1,105):
A.append(i**2+j**2+k**2+i*j+i*k+j*k)
A = sorted(A)
B = [0]*10050
for i in range(10050):
B[A[i]] += 1
C = B[1:N+1]
[print(i) for i in C] |
p02608 | s860813604 | Wrong Answer | n = int(input())
for i in range(1,n+1):
cnt = 0
for x in range(1,14):
for y in range(1,14):
for z in range(1,14):
if x**2 + y**2 + z**2 + (x*z) + (x*y) + (y*z) == i:
cnt += 1
print(cnt)
|
p02608 | s719229970 | Wrong Answer | N=int(input())
sum=[0]*N
for x in range(1,N):
for y in range(1,N):
for z in range(1,N):
a=x*x+y*y+z*z+x*y+y*z+x*z
if a<=N:
sum[a-1]=sum[a-1]+1
for i in sum:
print(sum) |
p02608 | s170007777 | Wrong Answer | N = int(input())
cnt = 0
for i in range(1, N+1):
for x in range(100):
for y in range(100):
for z in range(100):
if (x+y)^2 + (y+z)^2 + (z+x)^2 == 2*i:
cnt += 1
print(cnt)
|
p02608 | s156559283 | 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):
if i == ((x+y+z)**2 - z*(x+y) - (x*y)):
cnt += 1
print(cnt) |
p02608 | s016982050 | Wrong Answer | n=int(input())
ans=[0]*(n+1)
for x in range(1,51):
for y in range(1,51):
for z in range(1,51):
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+1):
print(ans[i])
|
p02608 | s697920034 | Wrong Answer | import itertools
N = int(input())
n = int(N ** (1/2))
C = itertools.combinations_with_replacement(range(1, n + 1), 3)
ans = [0 for i in range(N)]
x, y, z = 1, 1, 1
def check(c):
x, y, z = c
global N
t = x * x + y * y + z * z + x * y + y * z + z * x
if t > N:
return
if x == y and y == z:
ans[t - 1] += 1
elif x == y and y != z or y == z and z != x or z == x and x != y:
ans[t - 1] += 3
else:
ans[t - 1] += 6
for c in list(C):
check(c)
print(ans)
|
p02608 | s389889942 | Wrong Answer | import math
N = int(input())
for i in range(1, N+1):
cnt = 0
for x in range(1, int(math.pow(i, 1.0/3.0))):
for y in range(1, int(math.pow(i, 1.0/3.0))):
for z in range(1, int(math.pow(i, 1.0/3.0))):
if ((x+y+z)**2)-x*y-y*z-z*x == i:
cnt += 1
print(cnt)
|
p02608 | s941016651 | Wrong Answer | import math
N = int(input())
for n in range(1,N):
r_n = math.floor(math.sqrt(N))
count = 0
for x in range(1,r_n):
for y in range(1,r_n):
for z in range(1,r_n):
if (x*x + y*y + z*z + x*y + y*z + z*x) == n:
count+=1
print(count) |
p02608 | s185694136 | Wrong Answer | n = int(input())
f = [0]*48600
for x in range(1,90):
for y in range(1,90):
for z in range(1,90):
f[x**2+y**2+z**2+x*y+y*z+z*x-1]+=1
for i in range(n):
print(f[i]) |
p02608 | s049425010 | Wrong Answer | import numpy as np
def ff(x,y,z):
return(x**2+y**2+z**2+x*y+y*z+z*x)
n=int(input())
a=[ff(i,j,k) for i in range(1,42) for j in range(1,42) for k in range(1,42)]
an=np.array(a)
for i in range(1,n+1):
print(np.count_nonzero(an==(i))) |
p02608 | s443352882 | Wrong Answer | import math
import itertools
n=int(input())
a=[0]*n
b=[]
for i in range(1,35):
b.append(i)
lst=list(itertools.product(b,repeat=3))
for i in range(len(lst)):
x,y,z=lst[i][0],lst[i][1],lst[i][2]
c=(x+y+z)**2-(x*y+y*z+z*x)
if c<=n:
a[c-1]+=1
for i in range(n):
print(a[i]) |
p02608 | s999023073 | Wrong Answer | from itertools import combinations_with_replacement
N = int(input())
def calc(x: int, y: int, z: int) -> int:
return x**2 + y**2 + z**2 + x*y + y*z + z*x
memo = {}
for x,y,z in combinations_with_replacement(range(1, 43), 3):
l = len(set([x,y,z]))
num = calc(x,y,z)
if l == 1:
memo[num] = 1
elif l == 2:
memo[num] = 3
else:
memo[num] = 6
for i in range(1, N+1):
print(memo.get(i, 0)) |
p02608 | s152275603 | 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):
s = x**2 + y**2 + z**2
s += x*y + y*z + z*x
if s > N:
continue
ans[s] += 1
for i in ans:
print(i) |
p02608 | s743246604 | Wrong Answer | n = int(input())
ans = [0 for _ in range(n+1)]
for x in range(1, int(n ** 0.5) + 1):
for y in range(1, int(n ** 0.5) + 1):
for z in range(1, int(n ** 0.5) + 1):
a = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if a <= n:
ans[a] += 1
for i in ans:
print(i)
|
p02608 | s315688780 | 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)
t = [0] * a
for i in range(0,len(x)):
if x[i] <= a:
t[x[i]-1] = t[x[i]-1] + 1
for i in t:
print(i) |
p02608 | s518178280 | Wrong Answer | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import defaultdict
def main():
n_in = int(input().strip())
n_to_xyz = defaultdict(set)
for x in range(1, 70):
for y in range(1, 70):
for z in range(1, 70):
n = x * x + y * y + z * z + x * y + y * z + z * x
n_to_xyz[n].add((x, y, z))
for i in range(1, n_in + 1):
print(len(n_to_xyz[i]))
if __name__ == '__main__':
main()
|
p02608 | s127884104 | Wrong Answer | N = int(input())
result = [0 for x in range(1000000)]
l = 0
p=0
for i in range(1,100):
if p>10000:
break
for j in range(1,100):
if p>10000:
break
for k in range(1,100):
p = int(i*i+i*j+j*j+j*k+k*k+k*i )
if p>10000:
break
result[l] = p
l+=1
for i in range(1,N+1):
print(result.count(i)) |
p02608 | s900812852 | Wrong Answer | N = int(input())
n = N ** (1/2)
n = int(n)
for nn in range(N):
a = 0
for x in range(1, n + 1):
for y in range(1, n + 1):
for z in range(1, n + 1):
if x**2 + y**2 + z**2 + x*y + y*z + z*x == nn:
a += 1
print(a)
|
p02608 | s502289586 | Wrong Answer | n = int(input())
arr = [0 for x in range(n)]
sq = int(n ** 0.5)
for i in range(1, sq):
for j in range(1, sq):
for k in range(1, sq):
ans = i ** 2 + j ** 2 + k ** 2 + i * j + j * k + k * i
if ans < n:
arr[ans-1] += 1
for i in arr:
print(i)
|
p02608 | s513208150 | Wrong Answer | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N = int(readline())
f = [0] * (N+1)
for x in range(1,50):
for y in range(1,50):
for z in range(1,50):
tmp = x**2 + y**2 + z**2 + x*y + y*z + z*x
if tmp <= N:
f[tmp] += 1
print("\n".join(map(str, f[1:])))
if __name__ == "__main__":
main()
|
p02608 | s214526738 | Wrong Answer | n = int(input())
for i in range(1, n+1):
cnt = 0
for x in range(1, 34):
for y in range(1, 34):
for z in range(1, 34):
n = x*x + y*y + z*z + x*y + y*z + z*x
if i == n:
cnt += 1
print(cnt) |
p02608 | s231523188 | Wrong Answer | n=int(input())
a=[0]*10050
for i in range(105):
for j in range(105):
for k in range(105):
v=i**2+j**2+k**2+i*j+j*k+k*i
if v<10050:
a[v]+=1
for m in range(n):
print(a[m+1]) |
p02608 | s469497728 | Wrong Answer | n=int(input())
res=[0]*(n+1)
for x in range(1,50):
for y in range(1,50):
for z in range(1,50):
t = x**2+y**2+z**2+x*y+y*z+z*x
if t > n:
continue
res[t]+=1
for i in range(1,n+1):
print(res[i]) |
p02608 | s621896002 | Wrong Answer | from collections import defaultdict
N = int(input())
d = defaultdict(int)
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
n = x*x+y*y+z*z+x*y+y*z+z*x
if(n<N):
d[n]+=1
for i in range(1,N+1):
print(d[i]) |
p02608 | s852665525 | Wrong Answer | n = int(input())
n_list = [0]*50000
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
if (x+y+z)*(x+y+z) >= 150:
break
index = x*x + y*y + z*z + x*y + y*z + z*x
n_list[index] = n_list[index]+1
for i in range(1,n+1):
print(n_list[i]) |
p02608 | s300202299 | Wrong Answer | from itertools import product
N = int(input())
cnt = [0]*100000000
for x in range(1,81):
for y in range(1,81):
for z in range(1,81):
if x==y and y==z:
cnt[x**2 + y**2 + z**2 + x*y + y*z + z*x -1] = 1
else:
cnt[x**2 + y**2 + z**2 + x*y + y*z + z*x -1] += 1
for i in range(N):
print(cnt[i])
|
p02608 | s717599315 | Wrong Answer | n = int(input())
ans = [0] * (n + 1)
for x in range(1, n):
for y in range(1, n):
for z in range(1, n):
if x**2 + y**2 + z**2 + x*y + y*z + z*x <= n:
ans[x**2 + y**2 + z**2 + x*y + y*z + z*x] += 1
print(*ans, sep='\n') |
p02608 | s972495429 | Wrong Answer | n = int(input())
cnt = [0] * 11000
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
value = x*x + y*y + z*z + x*y + y*z + z*x
if value <= n:
cnt[value] += 1
for i in range(n+1):
print(cnt[i])
|
p02608 | s026949921 | Wrong Answer | n = int(input())
count = 0
i = 1
count = 0
limit = 100
nums = [0] * n
for x in range(limit):
for y in range(limit):
for z in range(limit):
cal = (x + 1) ** 2 + (y + 1) ** 2 + (z + 1) ** 2 + (x + 1) * (y + 1) + (y + 1) * (z + 1) + (z + 1) * (x + 1)
if(cal > n):
break
nums[cal - 1] += 1
for x,n in enumerate(nums,1):
if ( n > 0 ):
print(f'{x}:{n}')
|
p02608 | s651887936 | Wrong Answer | import math
N=int(input())
d=int(math.sqrt(N)+1)
bucket=[0 for i in range(N)]
for i in range(d):
for j in range(d):
for k in range(d):
if(i**2+j**2+k**2<=2*N and (i**2+j**2+k**2)%2==0 and i+j-k>=2 and j+k-i>=2 and k+i-j>=2):
bucket[(i**2+j**2+k**2)//2-1]+=1
for i in range(N):
print(bucket[i])
|
p02608 | s381784965 | Wrong Answer | n = int(input())
cnt = [0] * n
for x in range(1, int(n ** 0.5) + 1):
for y in range(1, int(n ** 0.5) + 1):
for z in range(1, int(n ** 0.5) + 1):
num = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if num <= n:
print(num)
cnt[num - 1] += 1
print(*cnt, sep="\n")
|
p02608 | s634585702 | Wrong Answer | def main():
n = int(input())
count_list = [0] * n
upper = int(n**0.5) + 1
for x in range(1, upper):
for y in range(1, upper):
for z in range(1, upper):
num = x**2 + y**2 + z**2 + x*y + y*z + z*x
if num < n:
count_list[num-1] += 1
for count in count_list:
print(count)
if __name__ == '__main__':
main()
|
p02608 | s287211990 | Wrong Answer | N = int(input().strip())
s=[]
n=int(N**(0.352))
for a in range (1,n+2):
for b in range(1,n+2):
for c in range(1,n+2):
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 | s548075880 | Wrong Answer | n = int(input())
from collections import defaultdict
d = defaultdict(int)
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
d[i**2+j**2+k**2+i*j+j*k+k*i]+=1
for j in range(1,n):
if d[j]:
print(d[j])
else:
print(0)
|
p02608 | s700930900 | Wrong Answer | import itertools
n = int(input())
N = int(n**0.5)
ans = [0] * n
for x,y,z in itertools.combinations_with_replacement(list(range(1,N+1)),3):
a = x**2 + y**2 + z**2 + x*y + y*z + z*x
if a > n: continue
if z==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 | s840407346 | Wrong Answer | N=int(input())
count=[0]*(10**4+1)
for x in range(1,10**2):
for y in range(1,10**2):
for z in range(1,10**2):
n=x**2+y**2+z**2+x*y+y*z+z*x
if n<=10**4:
count[n]+=1
for i in range(1,N):
print(count[i]) |
p02608 | s474285539 | Wrong Answer | N = int(input())
def ff(x,y,z):
n = x**2+y**2+z**2+x*y+y*z+z*x
return n
maxx=30
c=[]
ans = [0]*N
for i in range(1,maxx+1):
for j in range(1,maxx+1):
for k in range(1,maxx+1):
r=ff(i,j,k)
c.append(r)
cc = [i for i in c if i<=N]
for i in cc:
ans[i-1] += 1
for i in ans:
print(i) |
p02608 | s871510569 | Wrong Answer | n = int(input())
arr = [0] * 25000
for x in range(1, 50):
for y in range(1, 50):
for z in range(1, 50):
n_ = x**2 + y**2 + z**2 + x*y + y*z + z*x
arr[n_-1] += 1
print(*arr[:n], sep='\n')
|
p02608 | s106972962 | Wrong Answer | from sys import stdin
import sys
import math
import random
from decimal import Decimal
import itertools as it
N = int(input())
# for i in range(1,N+1):
f = [0 for i in range(N)]
# print(f)
for x in range(1, 51):
x2 = x**2
for y in range(1, 51):
y2 = y**2
for z in range(1, 51):
a = x2+y2+z**2+x*y+y*z+x*z
if a <= N:
f[a-1] += 1
for i in f:
print(i)
|
p02608 | s797324540 | Wrong Answer | n = int(input())
fn = [0] * (10**6+1)
def f(x, y, z):
return x**2 + y**2 + z**2 + x*y + y*z + z*x
for x in range(1, 35):
for y in range(1, 35):
for z in range(1, 35):
idx = f(x, y, z)
fn[idx] += 1
for i in range(1, n+1):
print(fn[i])
|
p02608 | s057852503 | Wrong Answer | N = int(input())
ans = {}
for x in range(1, 50):
for y in range(1, 50):
for z in range(1, 50):
tmp = x**2+y**2+z**2+x*y+x*z+y*z
if not(tmp in ans):
ans[tmp] = 1
else:
ans[tmp] += 1
for i in range(1, N+1):
if i in ans:
print(ans[i])
else:
print(0)
|
p02608 | s991885673 | Wrong Answer | n = int(input())
for a in range(n+1):
ans = 0
for i in range(1,100):
for j in range(1,100):
if i*2 + j*2 + i*j >= a:
break
for k in range(1,100):
if i**2 + j**2 + k**2 +i*j + j*k + k*i == a:
ans += 1
print(ans)
|
p02608 | s313647780 | Wrong Answer | N = int(input())
k = 1
for i in range(1,N+1):
if i == 6*k**2:
print(1)
elif i == (2*k)**2 + 3 * k**2 + 2*(k*(k+1)):
print(3)
elif i == 3*((2*k)**2) + 2*k*(k+1) + k**2:
print(3)
elif i == (k+2)**2 + 3*k**2 + 2*k*(k+2):
print(3)
k +=1
else:
print(0)
|
p02608 | s332176709 | Wrong Answer | N=int(input())
ans=[0]*(N+5)
for i in range(100) :
for j in range(100) :
for k in range(100) :
n=i*i+j*j+k*k+i*j+j*k+k*i
if N>=n :
ans[n]+=1
for i in range(1,N+1) :
print(ans[i])
|
p02608 | s141177440 | Wrong Answer | n=int(input())
l=[0]*(n+1)
for i in range(1,10**2+1):
for j in range(1,10**2+1):
for k in range(1,10**2+1):
tmp=i**2+j**2+k**2+i*j+j*k+k*i
if tmp<=n:
l[tmp]+=1
for li in l:
print(li)
|
p02608 | s182503080 | Wrong Answer | import itertools
n = int(input())
max_list_size = (25 + 25 + 25) ** 3
results = [0] * max_list_size
combinations = list(itertools.product(range(1, 26), repeat=3))
for x, y, z in combinations:
calc_result = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
results[calc_result] += 1
for i in range(1, n + 1):
print(results[i]) |
p02608 | s790079027 | 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):
if x**2+y**2+z**2+x*y+y*z+z*x < n:
ans[x**2+y**2+z**2+x*y+y*z+z*x-1]+=1
for i in range(n):
print(ans[i]) |
p02608 | s812421341 | Wrong Answer | def f(n):
cnt = 0
for x in range(1,6):
for y in range(1,6):
for z in range(1,6):
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 | s349412223 | Wrong Answer | N = int(input())
ans = [0]*(N+1)
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
num = x*x + y*y + z*z + x*y + y*z + z*x
if num>N:
break
ans[num] = ans[num] + 1
for m in ans:
print(m)
|
p02608 | s280382107 | Wrong Answer | import time
import itertools
N = int(input())
def function(x,y,z):
return pow(x,2) + pow(y,2) + pow(z,2) + (x * y) + (x * z ) + (y * z)
count = 0
start = time.time()
p = list(itertools.product(range(1,25),repeat=3))
a = []
for p_in in p:
a.append(function(p_in[0],p_in[1],p_in[2]))
for n in range(1,N + 1):
print(a.count(n))
elapsed_time = time.time() - start
# print("elapsed_time:{0}".format(elapsed_time) + "[sec]")
|
p02608 | s956610755 | Wrong Answer | n=int(input())
a = [0]*(1000000)
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+i*k]+=1
for i in range(n+1):
print(a[i])
|
p02608 | s173292940 | Wrong Answer | n = int(input())
ans = [0] * 10010
def get_ans(n):
cnt = 0
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
k = x**2 + y**2 + z**2 + x*y + y*z + z*x
if(k <= 10000):
ans[k] += 1
return ans
ans = get_ans(n)
for i in range(n+1):
print(ans[i]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.