problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02608 | s703363185 | Accepted | N=int(input())
dic={}
for i in range(1,N+1):
dic[i]=0
for x in range(1,int(N**0.5)):
for y in range(1,N-x**2):
for z in range(1,N-(x**2+y**2+x*y)):
if x**2+y**2+z**2+x*y+x*z+y*z>N:break
if x**2+y**2+z**2+x*y+x*z+y*z in dic:
dic[x**2+y**2+z**2+x*y+x*z+y*z]+=1
for i in range(1,N+1):
print(dic[i]) |
p02608 | s536814627 | Accepted | N = int(input())
A = [0 for _ in range(N+1)]
n = int(N ** 0.5) + 1
for x in range(1, n):
for y in range(1, n):
for z in range(1, n):
v = x*x + y*y + z*z + x*y + y*z + z*x
if v <= N:
A[v] += 1
for i in range(1, N+1):
print(A[i])
|
p02608 | s044578080 | Accepted | 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+1):
print(dict[i]) |
p02608 | s604972909 | Accepted | N=int(input())
a=[]
for i in range(N):
a.append(0)
for x in range(1,N+1):
if x**2>=N:
break
for y in range(1,N+1):
if x**2 + y**2 >= N:
break
for z in range(1,N+1):
if x**2+y**2+z**2>=N:
break
t=x**2+y**2+z**2+x*y+y*z+z*x
if t<=N:
a[t-1] += 1
for m in range(N):
print(a[m]) |
p02608 | s798536535 | Accepted | 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):
n = x**2 + y**2 + z**2 + x*y + y*z + z*x
if n <= N:
ans[n] += 1
print(*ans[1:], sep='\n') |
p02608 | s298165778 | Accepted | import math
n = int(input())
ans = [0] * (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))):
a = x * x + y * y + z * z + x * y + y * z + z * x
if n >= a >= 1:
ans[a] += 1
print(*ans[1:],sep="\n") |
p02608 | s977158426 | Accepted | L=[]
i=0
while i <100001:
L.append(0)
i+=1
for x0 in range(1,100):
for y0 in range(1,100):
for z0 in range(1,100):
p=x0**2+y0**2+z0**2+x0*y0+y0*z0+z0*x0
if p<10001:
L[p]+=1
N=int(input())
for i in range(1,N+1):
print(L[i]) |
p02608 | s587912298 | Accepted | 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(1, n+1):
print(cnt[i])
|
p02608 | s871173585 | Accepted | n = int(input())
xyz = {}
for x in range(1, 10**2):
for y in range(1, 10**2):
for z in range(1, 10**2):
num = x**2 + y**2 + z**2 + x*y + y*z + z*x
if num in xyz.keys():
xyz[num] += 1
else:
xyz[num] = 1
for i in range(1, n + 1):
if i in xyz.keys():
print(xyz[i])
else:
print(0) |
p02608 | s587028407 | Accepted | n = int(input())
ans = [0] * (10**5)
for i in range(1,101):
for j in range(1,101):
for k in range(1,101):
ans[i ** 2 + j ** 2 + k ** 2 + i * j + j * k + k * i-1] += 1
for i in range(n):
print(ans[i]) |
p02608 | s360982628 | Accepted | n = int(input())
# 答え用の配列を準備しておく
ans = [0 for i 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)):
res = x**2+y**2+z**2+x*y+y*z+x*z
# resの値がn以下ならカウントする
if res<=n:
ans[res] += 1
for i in range(1,n+1):
print(ans[i]) |
p02608 | s158020713 | Accepted | 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 > 15000:
break
n = t1 - x * y - y * z - z * x - 1
if n >= N or n < 0:
break
res[n] += 1
for o in res:
print(o) |
p02608 | s867664677 | Accepted | n = int(input())
cont = [0 for i in range(10050)]
for x in range(1,105):
for y in range(1,105):
for z in range(1,105):
v = x**2 + y**2 + z**2 + z*x + y*z + x*y
if v <= 10001:
cont[v]+=1
for i in range(1,n+1):
print(cont[i])
|
p02608 | s202896846 | Accepted | n = int(input())
a = 2
res = dict()
for i in range(1, 142):
for j in range(1, 142):
for k in range(1, 142):
tmp = int(((i + j) ** 2 + (j + k) ** 2 + (k + i) ** 2) / 2)
res[tmp] = res.get(tmp, 0) + 1
for i in range(n):
print(res.get(i + 1, 0))
|
p02608 | s733245819 | Accepted | 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):
v = i*i+j*j+k*k+i*j+j*k+k*i;
if v<10050:
ans[v]+=1
for i in range(n):
print(ans[i+1])
|
p02608 | s591594673 | Accepted | n=int(input())
l=[0]*10**7
s=int(n**0.7)+10
for x in range(1,s):
for y in range(1,s-x):
for z in range(1,s-x-y):
l[x*x+y*y+z*z+x*y+y*z+z*x-1]+=1
for i in range(n):
print(l[i]) |
p02608 | s593872749 | Accepted | N = int(input())
ans = [0]*(N+1)
f = lambda x, y, z: x**2 + y**2 + z**2 + x*y + y*z + z*x
root_N = int(N**0.5)
for x in range(1, root_N+1):
for y in range(1, root_N+1):
for z in range(1, root_N+1):
i = f(x, y, z)
if i <= N:
ans[f(x, y, z)] += 1
print('\n'.join(map(str, ans[1:])))
|
p02608 | s466559436 | Accepted | n = int(input())
ans = [0 for i in range(n + 1)]
for x in range(1,int(pow(n, 0.5)+1)):
for y in range(1,int(pow(n, 0.5)+1)):
for z in range(1,int(pow(n, 0.5)+1)):
if x**2 + y**2+z**2 +x*y + x*z + y*z <= n:
ans [x**2 + y**2+z**2 +x*y + x*z + y*z] += 1
for i in range(1,n+1):
print(ans[i]) |
p02608 | s522696584 | Accepted | n = int(input())
lst = [0] * 10**6
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
t = (x**2 + y**2 + z**2 + (x+y+z)**2) // 2
lst[t] += 1
for i in range(1, n+1):
print(lst[i]) |
p02608 | s850803691 | Accepted | n = int(input())
ans = [0] * (10**5)
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
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 | s531051827 | Accepted | N = int(input())
fn = [0]*N
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
n=x**2+y**2+z**2+x*y+y*z+z*x
if n<=N:
fn[n-1]+=1
print(*fn,sep="\n") |
p02608 | s183107421 | Accepted | n = int(input())
L = [0]*(110**2*6+1)
for i in range(1,110):
for j in range(1,110):
for k in range(1,110):
a = i**2 + j**2 + k**2 + i*j +j*k + k*i
if a <= n:
L[a-1] +=1
for i in range(n):
print(L[:n+1][i]) |
p02608 | s651242017 | Accepted | N=int(input())
f=[0 for i in range(10001)]
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 >10000:
continue
f[tmp]+=1
for i in range(1,N+1):
print(f[i]) |
p02608 | s606857685 | Accepted | N=int(input())
M=int(pow(N, 1/2))
ans=[0]*(N+1)
for x in range(1, M+1):
for y in range(1, M+1):
for z in range(1, M+1):
tmp=x**2+y**2+z**2+x*y+y*z+z*x
if tmp<=N:
ans[tmp]+=1
print(*ans[1:], sep='\n') |
p02608 | s941849808 | Accepted | n = int(input())
import math
lim = math.ceil(math.sqrt(n))
l = [0]*n
for x in range(1, lim):
for y in range(1, lim):
for z in range(1, lim):
i = (x+y+z)**2 - (x*y + y*z + z*x)
if (0<i) and (i<n+1):
l[i-1] += 1
for i in l:
print(i) |
p02608 | s031105109 | Accepted | def resolve():
n=int(input())
a=[0]*(60000)
nn=int(n**0.5)
for x in range(1,nn):
for y in range(1, nn):
for z in range(1, nn):
a[x**2+y**2+z**2+x*y+y*z+z*x]+=1
for i in range(n):
print(a[i+1])
resolve() |
p02608 | s518960045 | Accepted | N = int(input())
A = [0]*N
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+z*x+y*z
if a <= N:
A[a-1]+= 1
for a in A:
print(a)
|
p02608 | s055048248 | Accepted | n = int(input())
ans = [0] * 10010
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
x = i * i + j * j + k * k + i * j + j * k + k * i
if x <= n:
ans[x] += 1
for i in range(1, n+1):
print(ans[i]) |
p02608 | s521380300 | Accepted | def resolve():
n = int(input())
ans = [0] * n
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] += 1
for i in ans:
print(i)
if __name__ == '__main__':
resolve()
|
p02608 | s074053585 | Accepted | n=int(input())
ans=[0]*n
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
v=x**2 + y**2 + z**2 + x*y +y*z +x*z
if v>n:
break
ans[v-1]+=1
print(*ans) |
p02608 | s421922245 | Accepted | n = int(input())
arr = [0] * 60000
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
n_ = x**2 + y**2 + z**2 + x*y + y*z + z*x
arr[n_-1] += 1
print(*arr[:n], sep='\n')
|
p02608 | s597097872 | Accepted | from itertools import combinations, combinations_with_replacement
from math import sqrt
n = int(input())
ans = [0] * (n + 1)
for x, y, z in combinations_with_replacement(range(1, int(sqrt(n))), 3):
i = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if i <= n:
if x == y == z:
ans[i] += 1
elif all([(s != t) for s, t in combinations([x, y, z], 2)]):
ans[i] += 6
else:
ans[i] += 3
for i in range(1, n + 1):
print(ans[i])
|
p02608 | s528486157 | Accepted | n = int(input())
ans = [0]*n
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
b = x**2 + y**2 + z**2 + x*y + x*z + y*z - 1
if b < n:
ans[b] += 1
for a in ans:
print(a) |
p02608 | s093944643 | Accepted | def main():
N = int(input())
ans = [0] * (N + 1)
for x in range(1, int(N ** 0.5) + 2):
for y in range(1, int(N ** 0.5) + 2):
for z in range(1, int(N ** 0.5) + 2):
n = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if n > N:
continue
ans[n] += 1
print(*ans[1:], sep="\n")
if __name__ == '__main__':
main() |
p02608 | s701547345 | Accepted | def main():
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):
a = x*x + y*y + z*z + x*y + y*z + z*x
if a <= N:
ans[a] += 1
for i in range(1, N+1):
print(ans[i])
if __name__ == "__main__":
main()
|
p02608 | s513119757 | Accepted | N = int(input())
ans = [0] * (N + 5)
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(1, N+1):
print(ans[i])
|
p02608 | s589250954 | Accepted | import math
import sys
n = int(input())
l = [0] * n
if n < 6:
for i in range(n):
print(0)
sys.exit()
y = int(math.sqrt(n-3))
if n <= 5:
for i in range(n):
print(0)
for i in range(1,y):
for j in range(1, y):
for k in range(1, y):
x = i ** 2 + j ** 2 + k ** 2 + i*j + i*k + j*k
if x % 1 == 0 and x <= n:
l[x-1] += 1
for i in l:
print(i) |
p02608 | s810182294 | Accepted | import time
import itertools
import collections
N = int(input())
start = time.time()
def function(x,y,z):
return pow(x,2) + pow(y,2) + pow(z,2) + (x * y) + (x * z ) + (y * z)
p = list(itertools.product(range(1,100),repeat=3))
a = []
for p_in in p:
a.append(function(p_in[0],p_in[1],p_in[2]))
dict = collections.Counter(a)
for n in range(1,N + 1):
print(dict[n])
|
p02608 | s464520639 | Accepted | # -*- coding: utf-8 -*-
N = int(input())
ans_list = [0 for i in range(N + 1)]
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
now_num = i ** 2 + j ** 2 + k ** 2 + i * j + j * k + k * i
if now_num > N:
break
ans_list[now_num] += 1
for i in range(1, N + 1):
print(ans_list[i]) |
p02608 | s088102043 | Accepted | N = int(input())
ans = [0 for _ in range(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
if n <= N:
ans[n-1] += 1
print(*ans, sep="\n") |
p02608 | s617663959 | Accepted | import numpy as np
n = int(input())
res = [0]*(n+1)
for i in range(1,101):
for j in range(1,101):
for k in range(1,101):
x = i*i + j*j + k*k + i*j + j*k + k*i
if x <= n:
res[x] += 1
for i in range(1,n+1):
print(res[i])
|
p02608 | s182018503 | Accepted | N = int(input())
ans = [0] * 10**4
for x in range(1, 110):
for y in range(1, 110):
for z in range(1, 110):
n = x**2 + y**2 + z**2 + x*y + y*z + z*x
if n <= 10**4:
ans[n-1] += 1
for i in range(N):
print(ans[i]) |
p02608 | s328374315 | Accepted | import itertools
n = int(input())
dic = {}
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
f_xyz = x**2 + y**2 + z**2 + x*y + y*z + z*x
if f_xyz in dic:
dic[f_xyz] += 1
else:
dic[f_xyz] = 1
for i in range(1, n+1):
if i in dic:
print(dic[i])
else:
print(0) |
p02608 | s491730690 | Accepted | N = int(input())
ans = [0]*(1+N)
for x in range(1, 10**2+1):
for y in range(1, 10**2+1):
for z in range(1, 10**2+1):
v = x*x+y*y+z*z+x*y+y*z+z*x
if v<=N:
ans[v] += 1
for i in range(1, N+1):
print(ans[i]) |
p02608 | s803317273 | Accepted | def main():
N = int(input())
ans = [0] * (10**4 + 1)
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
tmp = i**2 + j**2 + k**2 + i*j + j*k + k*i
if tmp < 10**4 + 1:
ans[tmp] += 1
for i in range(1, N+1):
print(ans[i])
if __name__ == "__main__":
main()
|
p02608 | s494378638 | Accepted | n = int(input())
ans = [0] * (n+1)
for x in range(1, 10**2+1):
for y in range(1, 10**2):
for z in range(1, 10**2):
num = x**2 + y**2 + z**2 + x*y + y*z + z*x
if num <= n:
ans[num] += 1
else:
break
for res in ans[1:n+1]:
print(res)
|
p02608 | s244752670 | Accepted | n = int(input())
a = [0] * 10**5
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] += 1
for i in range(1, n + 1):
print(a[i]) |
p02608 | s872366066 | Accepted | n = int(input())
l = {}
for i in range(1, n+1):
l[i] = 0
for x in range(1, min(101, n)):
for y in range(1, min(101, n)):
for z in range(1, min(101, n)):
m = (x + y + z) ** 2 - (x*y + y*z + z*x)
if m <= n:
l[m] += 1
for i in range(1, n+1):
print(l[i]) |
p02608 | s925909333 | Accepted | n = int(input())
cnt = [0 for i in range(n+1)]
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
ind = (x+y+z)**2-x*y-y*z-z*x
if ind > 0 and ind < n+1:
cnt[ind] += 1
for i in range(n):
print(cnt[i+1]) |
p02608 | s668460881 | Accepted | n = int(input())
lst = [0 for _ in range(n)]
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
num = i ** 2 + j ** 2 + k ** 2 + i * j + j * k + i * k
try:
lst[num - 1] += 1
except IndexError:
pass
for num in lst:
print(num) |
p02608 | s096664546 | Accepted | import numpy as np
N = int(input())
#N,K,d= map(int,input().split())
#A = list(map(int,input().split()))
#S = str(input())
#T = str(input())
num=np.zeros(10**4+1)
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
ans = x**2 + y**2 + z**2 + x*y + y*z + z*x
if ans < 10**4+1:
num[ans]+=1
for i in range(N):
print(int(num[i+1]))
|
p02608 | s407221566 | Accepted | n = int(input())
dp = [0 for i in range(n+1)]
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
res = x**2+y**2+z**2+x*y+y*z+z*x
if res<=n:
dp[res]+=1
for i in range(1,n+1):
print(dp[i])
|
p02608 | s608057869 | Accepted | n = int(input())
arr = [0]*10100
for i in range(1,110):
for j in range(1,110):
for k in range(1,110):
s = i*i+j*j+k*k+i*j+j*k+k*i;
if s<10100:
arr[s]+=1
for i in range(n):
print(arr[i+1])
|
p02608 | s198241360 | Accepted | n=int(input())
ans = [0 for _ in range(n+1)]
for i in range(1,int((n+1)**0.5)):
for j in range(1,n+1):
for k in range(1,n+1):
v = i*i+j*j+k*k+i*j+j*k+k*i
if v > n:
break
ans[v]+=1
for i in range(n):
print(ans[i+1]) |
p02608 | s669753933 | Accepted | n = int(input())
li = [0]*10050
for i in range(1,105):
for j in range(1,105):
for k in range(1,105):
s = i*i+j*j+k*k+i*j+j*k+i*k
if s<10050:
li[s]+=1
for i in range(1,n+1):
print(li[i]) |
p02608 | s809836157 | Accepted | # C XYZ Triplets
n = int(input())
ans = {}
for x in range(1, 99):
for y in range(1, 99):
for z in range(1, 99):
k = (x+y)**2+(y+z)**2+(z+x)**2
if k > 20000:
break
if k % 2 == 0:
if not k//2 in ans:
ans[k//2] = 1
else:
ans[k//2] += 1
for i in range(1, n+1):
if i in ans:
print(ans[i])
else:
print(0)
|
p02608 | s633585524 | Accepted | n = int(input())
ans = [0 for _ in range(10005)]
for i in range(1, 105):
for j in range(1, 105):
for k in range(1, 105):
m = i**2 + j**2 + k**2 + i*j + j*k + k*i
if m < 10005:
ans[m] += 1
for i in range(n):
i += 1
print(ans[i]) |
p02608 | s715106827 | Accepted | n=int(input())
ans=[0 for i in range(1+10**5)]
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
ans[a]+=1
for i in range(1,n+1):
print(ans[i]) |
p02608 | s220272171 | Accepted | N = int(input())
f = [0] * (10 ** 4 + 1)
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 <= 10 ** 4:
f[n] += 1
print(*f[1 : N + 1], sep="\n")
|
p02608 | s035729489 | Accepted | N = int(input())
n = int(N**(1/2))
ans_list = [0]*(N)
for i in range(1,n):
for j in range(1,n):
for k in range(1,n):
index = i**2+j**2+k**2+i*j+j*k+k*i
if index>N:
break
ans_list[index-1] += 1
for i in ans_list:
print(i)
|
p02608 | s165404595 | Accepted | n=int(input())
k=int(n**0.5)+1
num=[0 for i in range(n+1)]
for x in range(1,k):
for y in range(1,k):
for z in range(1,k):
w=x**2+y**2+z**2+x*y+y*z+z*x
if w<=n:
num[w]+=1
for i in range(1,n+1):
print(num[i]) |
p02608 | s825321432 | Accepted | N = int(input())
list = [0]*(N+1)
for i in range(1,100):
for j in range(1,100):
a = i*i + j*j + i*j
for k in range(1,100):
a = i*i + j*j + k*k + i*j +j*k + i*k
if a <= N:
list[a] += 1
for i in range(1,N+1):
print(list[i]) |
p02608 | s698902723 | Accepted | L = 10**2+10
n = int(input())
ans = [0] * n
for i in range(1, L):
for j in range(1, L):
for k in range(1, L):
x = i**2+j**2+k**2+i*j+j*k+i*k
if x <= n:
ans[x-1] += 1
print(*ans, sep="\n")
|
p02608 | s268909403 | Accepted | import sys
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(input())
c = collections.Counter()
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
c[x * x + y * y + z * z + x * y + y * z + z * x] += 1
for i in range(1, N + 1):
print(c[i])
if __name__ == '__main__':
main()
|
p02608 | s297722157 | Accepted | a = int(input())
b = round(a**0.5) + 1
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 | s786706180 | Accepted | import math
def f(x, y, z):
return(x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x)
n = int(input())
fs = [0] * n
lim = math.floor(math.sqrt(n))
rng = range(1, lim)
for x in rng:
for y in rng:
for z in rng:
v = f(x, y, z)
if v <= n:
fs[v - 1] += 1
for i in range(n):
print(fs[i]) |
p02608 | s189867977 | Accepted | N = int(input())
limit = 100
memo = {}
for a in range(1, limit):
for b in range(1, limit):
for c in range(1, limit):
t = a**2 + b**2 + c**2 + a*b + b*c + c*a
if not t in memo:
memo[t] = 1
else:
memo[t] += 1
for i in range(1, N+1):
if not i in memo:
print(0)
else:
print(memo[i]) |
p02608 | s279646761 | Accepted | n = int(input())
isEnd = False
sum = [0]*n
for x in range(1,100):
x2 = x*x
for y in range(1,100):
sum_xy = x2 + y*(x+y)
if sum_xy > n:
break
for z in range(1,100):
tmp = sum_xy + z*(x+y+z)
if tmp > n:
break
if tmp <= n:
sum[tmp-1]+=1
for s in sum:
print (s) |
p02608 | s662601675 | Accepted | 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 >= 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 | s873818136 | Accepted | n = int(input())
ans = [0] * (n+1)
for x in range(100):
for y in range(100):
for z in range(100):
m = x**2 + y**2 + z**2 + x*y + y*z + z*x
if 1 <= x * y * z and 0 <= m <= n:
ans[m] += 1
for i in range(n):
print(ans[i+1]) |
p02608 | s758736154 | Accepted | #
import sys
input=sys.stdin.readline
def main():
N=int(input())
cnt=[0]*(8*N)
r=int(N**0.5)+1
for x in range(1,r):
for y in range(1,r):
for z in range(1,r):
cnt[x*x+y*y+z*z+x*y+y*z+z*x]+=1
for i in range(1,N+1):
print(cnt[i])
if __name__=="__main__":
main()
|
p02608 | s706973131 | Accepted | n = int(input())
l = [0] * (10**5)
N = 10**4
for i in range(1, 10**2+1):
for j in range(1, 10**2+1):
for k in range(1, 10**2+1):
a = i*i + j*j + k*k + i*j + j*k + k*i
l[a] += 1
for i in range(n):
print(l[i+1]) |
p02608 | s230169037 | Accepted | import itertools
N = int(input())
tbl = [0]*N
for x in range(1,N):
for y in range(1,N):
for z in range(1,N):
p = x*x + y*y + z*z + x*y + y*z + z*x
if p > N:
break
tbl[p-1] += 1
for i in range(N):
print(tbl[i])
|
p02608 | s534349414 | Accepted | n=int(input())
N=10**4+1
lst=[0]*N
s=0
for i in range(1,10**2+1):
for j in range(1,10**2+1):
for k in range(1,10**2+1):
s=i**2+j**2+k**2+i*j+j*k+k*i
if s<10**4+1:
lst[s]+=1
for i in range(1,n+1):
print(lst[i])
|
p02608 | s150160012 | Accepted | from collections import defaultdict
n = int(input())
d = defaultdict(lambda: 0)
for a in range(1, 10**2):
for b in range(1, 10**2):
for c in range(1, 10**2):
t = a**2+b**2+c**2+a*b+b*c+c*a
if t <= n:
d[t] += 1
else:
break
for i in range(1, n+1):
print(d[i])
|
p02608 | s634170891 | Accepted | n = int(input())
ans_list = [0 for i in range(10**6 + 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 + z*y + x*z
ans_list[a] += 1
for i in range(1,n+1):
print(ans_list[i]) |
p02608 | s532892105 | Accepted | def resolve():
N = int(input())
ans = [0 for _ in range(100005)]
for x in range(1, 105):
for y in range(1, 105):
for z in range(1, 105):
tmp = x * x + y * y + z * z + x * y + y * z + z * x
if tmp < 10005:
ans[tmp] += 1
for i in range(1, N+1):
print(ans[i])
return
resolve() |
p02608 | s173841372 | Accepted | N = int(input())
C = {i:0 for i in range(1,N+1)}
for x in range(1,142):
for y in range(1,142):
for z in range(1,142):
a = (x+y)**2+(y+z)**2+(z+x)**2
if a%2==0 and a//2<=N:
C[a//2] += 1
for i in range(1,N+1):
print(C[i])
|
p02608 | s916758977 | Accepted | n = int(input())
table = [0] * 10001
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
k = (x * x) + (y * y) + (z * z) + (x * y) + (y * z) + (z * x)
if k < 10001:
table[k] += 1
for i in range(1, n + 1):
print(table[i])
|
p02608 | s658522151 | Accepted | N = int(input())
counts = [0 for i in range(N+1)]
for i in range(1,150):
for j in range(1,150):
for k in range(1,150):
now = i**2 + j**2 + k**2 + i*j + j*k + k*i
try:
counts[now] += 1
except:
pass
for i in range(1,N+1):
print(counts[i]) |
p02608 | s021022101 | Accepted | N = int(input())
ans = [0 for _ in range(N)]
for z in range(1, 101):
for y in range(1, 101):
for x in range(1, 101):
i = x**2 + y**2 + z**2 + x*y + y*z + z*x
if i <= N:
ans[i-1] += 1
for j in ans:
print(j) |
p02608 | s642553045 | Accepted | def main():
import math
N = int(input())
ans_list = [0 for i in range(N)]
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
left_eq = x * x + y * y + z * z + x * y + y * z + z * x
if (left_eq <= N):
ans_list[left_eq - 1] += 1
for i in range(N):
print(ans_list[i])
if __name__ == '__main__':
main()
|
p02608 | s942650097 | Accepted | N=int(input())
dp=[0]*(10**4+1)
for i in range(1,100+1):
for j in range(1,100+1):
for k in range(1,100+1):
a=(i+j)**2+(k+j)**2+(i+k)**2
if 10**4<a//2:
break
dp[a//2]+=1
for l in range(1,N+1):
print(dp[l]) |
p02608 | s442510658 | Accepted | from collections import Counter
n = int(input())
ans_list = [0]*(10**6)
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 + k*i
ans_list[ans-1] += 1
for i in ans_list[:n]:
print(i) |
p02608 | s133968835 | Accepted | n = int(input())
a = [0 for i in range(n)]
for z in range(1, int(n**0.5+1)):
for y in range(1, int(n**0.5+1)):
for x in range(1, int(n**0.5+1)):
i = x*x + y*y + z*z + x*y + y*z + x*z
if i <= n: a[i-1] += 1
for i in range(n):
print(a[i])
|
p02608 | s578147083 | Accepted | N=int(input())
r=[0]*10000
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
v = i*i + j*j + k*k + i*j + i*k + k*j
if v <= 10000:
r[v-1] += 1
for i in range(N):
print(r[i]) |
p02608 | s390322803 | Accepted | #coding: UTF-8
import math
N = int(input())
#print(N)
ans = [0]*10001
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 <=10000:
ans[a] += 1
for i in range(1,N+1):
print(ans[i]) |
p02608 | s047282668 | Accepted | import collections
n = int(input())
ans_list = []
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
ans_list.append(x*x+y*y+z*z+x*y+y*z+z*x)
counter = collections.Counter(ans_list)
for i in range(1,n+1):
print(counter[i]) |
p02608 | s227940524 | Accepted | n=int(input())
cnt=[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 tmp <=n:
cnt[tmp]+=1
for i in range(1, n+1):
print(cnt[i]) |
p02608 | s677399387 | Accepted | import math
N = int(input())
ans = [0] *(N+1)
a = int(math.sqrt(N)) + 1
for i in range(1,a) :
for j in range(1,a) :
for k in range(1,a) :
n = i**2 + j**2 + k**2 + i*j + i*k + j*k
if n <= N :
ans[n] += 1
for m in range(N) :
print(ans[m+1])
|
p02608 | s245660212 | Accepted | # from pprint import pprint
# import math
# import collections
from numba import jit
N = int(input())
# n, k = map(int, input().split(' '))
# a = list(map(int, input().split(' ')))
@jit(cache=True)
def calc(x, y, z):
return x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
res = [0] * 1000009
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
n = calc(x, y, z)
res[n - 1] += 1
for i in range(N):
print(res[i])
|
p02608 | s734140408 | Accepted | N = int(input())
ans = [0] * (N+1)
for a in range(1, 105):
if a*a > N :
break
for b in range(1, 105):
if a*a + b*b > N:
break
for c in range(1, 105):
if a*a + b*b + c*c + a*b + b*c + c*a > N:
break
ans[a*a + b*b + c*c + a*b + b*c + c*a] += 1
for i in range(1, N+1):
print(ans[i])
|
p02608 | s807487461 | Accepted | # vim: fileencoding=utf-8
def main():
N = int(input())
ans = [0] * N
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
t = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x - 1
if t >= len(ans):
break
ans[t] += 1
print(*ans)
if __name__ == "__main__":
main()
|
p02608 | s046958445 | Accepted | nn=int(input())
nc = [0] * (nn + 1)
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
a = x * x + y * y + z * z + x * y + x * z + y * z
if a > nn:
break
nc[a] += 1
for i in range(1, nn + 1):
print(nc[i]) |
p02608 | s112841776 | Accepted | from collections import Counter
N = int(input())
N_ = int(N**0.5)+2
counter = Counter()
for x in range(1,N_):
for y in range(1,N_):
if N <= x**2+y**2+x*y:
break
for z in range(1,N_):
tmp = x**2+y**2+z**2+x*y+y*z+z*x
if N < tmp:
break
counter[tmp] += 1
for i in range(1,N+1):
print(counter[i])
|
p02608 | s414099670 | Accepted | 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):
v = i*i+j*j+k*k+i*j+j*k+k*i;
if v<10050:
ans[v]+=1
for i in range(n):
print(ans[i+1]) |
p02608 | s949837579 | Accepted | 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):
v = i*i+j*j+k*k+i*j+j*k+k*i
if v < 10050:
ans[v] += 1
for i in range(n):
print(ans[i+1]) |
p02608 | s245127908 | Accepted | from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
n = int(stdin.readline().rstrip())
li = [0]*1000000
for i in range(1,101):
for j in range(1,101):
for k in range(1,101):
li[i**2+j**2+k**2+i*j+j*k+k*i] += 1
for i in range(1,n+1):
print(li[i]) |
p02608 | s184022731 | Accepted | 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):
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 | s083265191 | Accepted | def main():
n = int(input())
ans = [0] * n
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
m = x**2+y**2+z**2+x*y+y*z+z*x
if m <= n:
ans[m-1] += 1
for i in range(n):
print(ans[i])
main() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.