problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02608 | s525430838 | Accepted | n=int(input())
squre=int(n**0.5)
A=[0 for _ in range(10**6)]
for x in range(1,squre+1):
for y in range(1,squre+1):
for z in range(1,squre+1):
num=x**2+y**2+z**2+x*y+y*z+z*x
A[num] +=1
for i in range(n):
print(A[i+1]) |
p02608 | s830144866 | Accepted | 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 i in range(1,n+1):
print(d[i]) |
p02608 | s488883727 | Accepted | n=int(input())
a=[0]*10001
for i in range(1,101):
for j in range(1,101):
for k in range(1,101):
v=i**2+j**2+k**2+i*j+j*k+k*i
if v<10001:
a[v]+=1
for m in range(n):
print(a[m+1]) |
p02608 | s693495361 | Accepted | n = int(input())
a = [0] * 10010
# x,y,z
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 > n:
continue
a[x*x + y*y + z*z + x*y + y*z + z*x] += 1
for i in range(1, n+1):
print(a[i])
|
p02608 | s311854915 | Accepted | N = int(input())
ans = [0] * (N+1)
for x in range(1, 10**2):
for y in range(1, 10**2):
for z in range(1, 10**2):
try:
ans[(x+y+z)**2 - (x*y+y*z+z*x)] += 1
except:
pass
for i in range(1, N+1):
print(ans[i])
|
p02608 | s139400952 | Accepted | from collections import defaultdict
d = defaultdict(int)
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*k+k*j+j*i
d[a] += 1
n = int(input())
for i in range(1,n+1):
print(d[i]) |
p02608 | s415041415 | Accepted | import math
n=int(input())
dp=[0]*(n+2)
sq=int(math.sqrt(n))
for x in range(1,sq+1):
for y in range(1,sq+1):
for z in range(1,sq+1):
aa=(x*x+y*y+z*z+x*y+y*z+z*x)
if aa<=n:
dp[aa]+=1
for i in range(1,n+1):
print(dp[i]) |
p02608 | s133623289 | Accepted | 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 > 10001:
break
for i in range(N):
print(o[i+1])
|
p02608 | s336451592 | Accepted | # C - XYZ Triplets
from collections import Counter
def main():
N = int(input())
calc = lambda x, y, z: x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
lim = int(N ** 0.5) + 1
cnt = Counter(
calc(i, j, k)
for i in range(1, lim + 1)
for j in range(1, lim + 1)
for k in range(1, lim + 1)
)
res = [cnt[i] for i in range(1, N + 1)]
print("\n".join(map(str, res)))
if __name__ == "__main__":
main()
|
p02608 | s265429745 | Accepted | N = int(input())
res = {i+1: 0 for i in range(N)}
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)):
n = i**2 + j**2 + k**2 + i*j + j*k + k*i
if n in res:
res[n] += 1
for r in res.values():
print(r)
|
p02608 | s007753218 | Accepted | N = int(input())
def cal(a,b,c):
return(a**2+b**2+c**2 + a*b+b*c+c*a)
memo = [0]*(10**4)
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
temp = cal(i,j,k)
if temp <= 10**4:
memo[temp-1] += 1
for i in memo[:N]:
print(i) |
p02608 | s114452760 | Accepted | #!/usr/bin/env python3
import math
n = int(input())
result = [0] * (n + 1)
border = 0
if n>=3:
border = int(math.sqrt(n - 2))
for x in range(1, border):
for y in range(1, border):
for z in range(1, border):
r = ((x + y) ** 2 + (y + z) ** 2 + (z + x) ** 2) // 2
if r > n:
break
else:
result[r] += 1
for num in result[1::]:
print(num) |
p02608 | s220360185 | Accepted |
n = int(input())
ans = [0]*10001
for i in range(1, 101):
for j in range(1, 101):
for z in range(1, 101):
aaa = i**2+j**2+z**2+i*j+j*z+z*i
if aaa <= 10**4:
ans[aaa] += 1
for i in range(n):
print(ans[i+1])
|
p02608 | s768936039 | Accepted | n = int(input())
count = [0] * (10**6)
s = 0
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
s = i * i + j * j + k * k + i * j + j * k + k * i
count[s - 1] += 1
for i in range(n):
print(count[i])
|
p02608 | s250480479 | Accepted | n = int(input())
ans = [0]*10001
for a in range(1,101):
for b in range(1,101):
for c in range(1,101):
x = a**2+b**2+c**2+a*b+b*c+a*c
if x<10001:
ans[x] += 1
else:
break
for i in range(1,n+1):
print(ans[i]) |
p02608 | s417038820 | Accepted | N = int(input())
ans = [0 for i in range(10 ** 4 + 1)]
for i in range(1,100):
for i2 in range(1,100):
for i3 in range(1,100):
k = i**2 + i2 ** 2 + i3 ** 2 + i * i2 + i2 * i3 + i3 * i
if k <= 10 ** 4:
ans[k] += 1
for i in range(N):
print(ans[i+1])
|
p02608 | s891953997 | Accepted | from collections import defaultdict
from sys import stdin
def main():
input = lambda: stdin.readline()[:-1]
N = int(input())
ans = 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
ans[n] += 1
for i in range(1, N + 1):
print(ans[i])
main()
|
p02608 | s458871396 | Accepted | # 初期入力
import sys
input = sys.stdin.readline
N = int(input())
ans ={i:0 for i in range(1,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]) |
p02608 | s858216162 | Accepted | N = int(input())
cnt = [0] * (N+1)
for x in range(1, int(N**0.5)+1):
for y in range(1, int(N**0.5)+1):
fxy = x**2 + y**2 + x*y
if N < fxy: break
for z in range(1, int(N**0.5)+1):
f = fxy + z**2 + y*z + z*x
if N < f: break
cnt[f] += 1
print(*cnt[1:], sep='\n') |
p02608 | s818926865 | Accepted | from numba import jit
N = int(input())
@jit
def f():
ret = [0] * 10001
for i in range(1, 200):
for j in range(1, 200):
for k in range(1, 200):
z = i**2 + j**2 + k**2 + i*j + j*k + k*i
if z < 10001:
ret[z] += 1
return ret
ans = f()
for x in range(1, N+1):
print(ans[x])
|
p02608 | s118133844 | Accepted | n = int(input())
a = int(n**0.5+1)
ans = [0]*n
for x in range(1, a):
for y in range(1, a):
for z in range(1, a):
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
[print(i) for i in ans] |
p02608 | s202174950 | Accepted | n = int(input())
ans = [0 for i in range(10050)]
for x in range(1, 105):
for y in range(1, 105):
for z in range(1, 105):
f = x**2 + y**2 + z**2 + x*y + y*z + z*x
if f < 10050:
ans[f] += 1
for i in range(n):
print(ans[i+1]) |
p02608 | s126765565 | Accepted | n=int(input())
l=[0]*(n)
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+x*z+y*z
if k<=n:
l[k-1]+=1
print(*l,sep="\n") |
p02608 | s429767019 | Accepted | 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())
n_np = np.zeros(105**3)
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
n_np[idx-1] += 1
for i in range(N):
print(int(n_np[i]))
|
p02608 | s060999489 | Accepted | #!/usr/bin/env python3
n = int(input())
cnt = [0] * (1 + n)
for a in range(1, 100):
for b in range(1, 100):
for c in range(1, 100):
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 | s928118786 | Accepted | from collections import defaultdict
def f(x,y,z):
return x**2 + y**2 + z**2 + x*y + y*z + z*x
N = int(input())
i = 1
dic = defaultdict(lambda: set())
dic[6].add((1,1,1))
while i <= N:
if i in dic:
print(len(dic[i]))
for trio in dic[i]:
x,y,z = trio
dic[f(x,y,z+1)].add((x,y,z+1))
dic[f(x,y+1,z)].add((x,y+1,z))
dic[f(x+1,y,z)].add((x+1,y,z))
else:
print(0)
i += 1 |
p02608 | s576057466 | Accepted | n = int(input())
a = [0 for i in range(10000)]
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
w = (x+y+z)**2-z*x-z*y-x*y
if w <= 10000:
a[w-1] += 1
for i in range(n):
print(a[i]) |
p02608 | s868328500 | Accepted | import math
import collections
n=int(input())
c = []
m = int(math.sqrt(n))
for x in range(1,m+1):
for y in range(1,m+1):
for z in range(1,m+1):
tmp = x*x + y*y + z*z + x*y + y*z + z*x
c.append(tmp)
cc = collections.Counter(c)
#print(cc)
for i in range(1,n+1):
if i in cc:
print(cc[i])
else:
print(0) |
p02608 | s101752709 | Accepted | M = 10**2 + 1
N = int(input())
L = [0 for _ in range(M**2+10)]
for i in range(1,M):
for j in range(1,M):
for k in range(1,M):
n = i**2 + j**2 + k**2 + i*j + j*k + k*i
if n>N:
break
L[n] += 1
for i in range(1,N+1):
print(L[i])
|
p02608 | s029542843 | Accepted | # coding:utf-8
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: #vはnを表していて、vのところで与式を満たす
ans[v] += 1
for i in range(n):
print(ans[i+1]) |
p02608 | s041229072 | Accepted | n = int(input())
ans = [0 for _ in range(10001)]
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
v = i**2 + j**2 + k**2 + i*j + j*k + k*i
if v < 10001:
ans[v] += 1
for i in range(n):
print(ans[i+1]) |
p02608 | s321733242 | Accepted | 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, 101):
x2 = x**2
for y in range(1, 101):
y2 = y**2
for z in range(1, 101):
a = x2+y2+z**2+x*y+y*z+x*z
if a <= N:
f[a-1] += 1
else:
break
for i in f:
print(i)
|
p02608 | s622413383 | Accepted | # -*- coding: utf-8 -*-
def score(x,y,z):
return pow(x,2)+pow(y,2)+pow(z,2)+(x*y)+(y*z)+(z*x)
N = int(input())
num = [0 for i in range(N)]
# x,y,zは高々10^2
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
value = score(x,y,z)
if value <= N:
num[value-1] += 1
for n in num:
print(n) |
p02608 | s382635076 | Accepted | N = int(input())
cnt = [0] * (10 ** 4 + 1)
for x in range(1, 3333):
for y in range(1, 3333):
for z in range(1, 3333):
check = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if check > 10000:
break
else:
cnt[check - 1] += 1
for i in range(N):
print(cnt[i])
|
p02608 | s607359372 | Accepted | n = int(input())
ans = [0 for i in range(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 | s964013269 | Accepted | import itertools
n = int(input())
lst = [0] * 10 ** 5
combs = list(itertools.combinations_with_replacement([_ for _ in range(1, 100)], 3))
st = {1:1, 2:3, 3:6}
for _ in combs:
x, y, z = _[0], _[1], _[2]
num = x ** 2 + y ** 2 + z ** 2 + (x * y) + (y * z) + (z * x)
lst[num-1] += st[len(set(_))]
for _ in range(n):
print(lst[_]) |
p02608 | s844381919 | Accepted | N = int(input())
L = [0]*N
for X in range(1,101):
for Y in range(1,101):
for Z in range(1,101):
Num = X*X+Y*Y+Z*Z+X*Y+X*Z+Y*Z
if Num>N: break
else: L[Num-1] += 1
print('\n'.join(str(X) for X in L)) |
p02608 | s262136228 | Accepted | n = int(input())
a =[0]*10001
for x in range(1,100,1):
for y in range(1,100,1):
for z in range(1,100,1):
i = x*x+y*y+z*z+x*y+y*z+z*x
if i <=10000:
a[i]=a[i]+1
for i in range(1,n+1,1):
print(a[i]) |
p02608 | s989458100 | Accepted | N = int(input())
ans = [0 for _ in range(N)]
for x in range(1, 1000):
if x**2 > N:
continue
for y in range(1, 1000):
if x**2 + y**2 > N:
break
for z in range(1, 1000):
n = x**2 + y**2 + z**2 + x*y + y*z + z*x
if n <= N:
ans[n-1] += 1
if n > N:
break
for a in ans:
print(a) |
p02608 | s918974088 | Accepted | def calc(x, y, z):
return x**2 + y**2 + z**2 + x*y + y*z + z*x
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 = calc(x, y, z)
if a <= n:
ans[a-1] += 1
b = [str(i) for i in ans]
print('\n'.join(b))
|
p02608 | s712314701 | Accepted | n = int(input())
f = []
for _ in range(10000):
f.append(0)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
id = x*x + y*y + z*z + x*y + y*z + z*x
if id <= 10000:
f[id-1] += 1
for i in range(n):
print(f[i])
|
p02608 | s536208959 | Accepted | n = int(input())
ans = [0 for _ in range(10050)]
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
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 | s984993568 | 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 | s502829718 | Accepted | n=int(input())
d=[0 for i in range(10**7)]
def jud(l):
if len(set(l))==3:
return 6
if len(set(l))==2:
return 3
if len(set(l))==1:
return 1
for i in range(1,101):
for j in range(i,101):
for k in range(j,101):
l=[i,j,k]
p=i**2+j**2+k**2+i*j+j*k+k*i
d[p-1]+=jud(l)
for i in range(n):
print(d[i]) |
p02608 | s396296167 | Accepted | ## coding: UTF-8
N = int(input())
ans = [0] * (10**4+10)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
#print(x, y, z)
p = x*x + y*y + z*z + x*y + y*z + z*x
if(p < 10**4+10):
ans[p] += 1
#print(ans[:30])
for i in range(N):
print(ans[i+1])
|
p02608 | s600156061 | Accepted | # coding: utf-8
import math
import itertools
n = int(input())
ans = [0] * n
for x, y, z in itertools.product(range(1, int(math.sqrt(n))), range(1, int(math.sqrt(n))), range(1, int(math.sqrt(n)))):
idx = x**2 + y**2 + z**2 + x*y + y*z + z*x
if idx <= n:
ans[idx-1] += 1
print(*ans, sep="\n") |
p02608 | s254751700 | Accepted | N = int(input())
l = [0] + [0] * N
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
temp = x**2 + y**2 + z**2 + x * y + y * z + z * x
if temp <= N:
l[temp] += 1
# print(l)
for i in range(1, N + 1):
print(l[i])
|
p02608 | s302165640 | Accepted | n = int(input())
ans = [0] * (n + 1)
for i in range(1, 110):
for j in range(1, 110):
for k in range(1, 110):
tmp = i ** 2 + j ** 2 + k ** 2 + i * j + j * k + k * i
if tmp <= n:
ans[tmp] += 1
for i in range(1, n + 1):
print(ans[i])
|
p02608 | s910562686 | Accepted | n = int(input())
from collections import defaultdict
d = defaultdict(int)
ul=int(n**0.5)
for i in range(1,ul):
for j in range(1,ul):
for k in range(1,ul):
d[i**2+j**2+k**2+i*j+j*k+k*i]+=1
for j in range(1,n+1):
print(d.get(j,0))
# print(d[j] if d[j] else 0)
|
p02608 | s499470653 | Accepted | n = int(input())
ans = [0] * n
cnt = 0
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
f = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if f <= n:
ans[f - 1] += 1
ans.append(cnt)
for j in range(n):
print(ans[j]) |
p02608 | s981926445 | Accepted | n = int(input())
def main():
ans = [0]*(n+1)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
fn = x**2 + y**2 + z**2 + x*y + y*z + z*x
if fn > n:
break
else:
ans[fn] += 1
for i in range(1, n+1):
print(ans[i])
if __name__ == '__main__':
main() |
p02608 | s603253761 | Accepted | #!/usr/bin/env python3
N = int(input())
Ret = [0 for _ in range(10**5)]
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
r = i**2 + j**2 + k**2 + i*j + j*k + i*k
Ret[r] += 1
for r in Ret[1:N+1]:
print(r)
|
p02608 | s750179039 | Accepted | n = int(input())
li = [0]*(10001)
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>10000:
continue
li[tmp] += 1
for i in range(1, n+1):
print(li[i]) |
p02608 | s622377954 | Accepted | f = lambda x, y, z: (x + y + z) ** 2 - x * y - y * z - z * x - 1
n = int(input())
a = [0] * n
z = 1
while f(1, 1, z) < n:
y = 1
while f(1, y, z) < n:
x = 1
while f(x, y, z) < n:
a[f(x, y, z)] += 1
x += 1
y += 1
z += 1
print(*a, sep='\n')
|
p02608 | s804122121 | 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):
if x**2 + y**2 + z**2 + x*y + y*z + z*x <= n:
A[x**2 + y**2 + z**2 + x*y + y*z + z*x - 1] += 1
else:
break
for ans in A:
print(ans) |
p02608 | s463916140 | 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 | s190642723 | Accepted | 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:
continue
f[h - 1] += 1
for i in range(N):
print(f[i])
|
p02608 | s973418337 | Accepted | import sys
input = sys.stdin.readline
N=int(input())
ANS=[0]*(10**5+1)
for x in range(1,10**2+1):
for y in range(1,10**2+1):
for z in range(1,10**2+1):
ANS[x*x+y*y+z*z+x*y+y*z+z*x]+=1
print(*ANS[1:N+1])
|
p02608 | s198747913 | Accepted | N=int(input())
A=[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:
A[x**2+y**2+z**2+x*y+y*z+z*x-1]+=1
for i in range(N):
print(A[i]) |
p02608 | s702451562 | Accepted | n = int(input())
L = [0 for i in range(10**4+1)]
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
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 | s831093936 | Accepted | n = int(input())
count = 0
a = [0]*(10**5)
for i in range(1, 100):
for j in range(1, 100):
for k in range(1, 100):
a[(i+j+k)**2-(i*j+j*k+i*k)] += 1
for i in range(n):
print(a[i+1]) |
p02608 | s904684898 | Accepted | from math import sqrt
n = int(input())
sqn_int = int(sqrt(n))
a = [0] * n
for x in range(1, 1 + sqn_int):
for y in range(1, 1 + sqn_int):
for z in range(1, 1 + sqn_int):
left = x**2 + y**2 + z**2 + x*y + y*z + z*x
if left <= n:
a[left - 1] += 1
for i in a[:n]:
print(i)
|
p02608 | s580527993 | Accepted | n = int(input())
A = [0]*10**7
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
print(*A[1:n+1],sep='\n') |
p02608 | s243050906 | Accepted | N = int(input())
cnt = [0] * 10001
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
value = x*x + y*y + z*z + x*y + y*z + z*x
if value <= 10000:
cnt[value] += 1
for i in range(1,N+1):
print(cnt[i]) |
p02608 | s940110154 | Accepted | '''Author- Akshit Monga'''
list=[0 for i in range(10**4+1)]
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
var=x**2 +y**2 +z**2 +x*y +y*z +z*x
if var<=10**4:
list[var]+=1
n=int(input())
for i in range(1,n+1):
print(list[i]) |
p02608 | s829231581 | Accepted | from itertools import permutations
from functools import reduce
n = int(input())
rn = int(n **.5) + 1
ptn = permutations([i for i in range(1, rn + 1)], 3)
ans = [0] * (n + 1)
for i in range(1, rn + 1):
for j in range(1, rn + 1):
for k in range(1, rn + 1):
idx = i**2 + j**2 + k**2 + i*j + j*k + k*i
if idx <= n:
ans[i**2 + j**2 + k**2 + i*j + j*k + k*i] += 1
for an in ans[1:]:
print(an) |
p02608 | s662360479 | 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 | s605166236 | Accepted | N = int(input())
chk = [0] * (10 ** 4 + 2)
for i in range(1, 100):
for j in range(1, 100):
for k in range(1, 100):
a = i**2 + j**2 + k**2 + i*j + j*k + i*k
if a > 10001:
break
chk[a] += 1
for i in range(N):
print(chk[i+1]) |
p02608 | s106962725 | Accepted | 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] += 1
for i in range(N):
print(num[i])
|
p02608 | s839771196 | Accepted | import itertools
import collections
N = int(input())
count = [0]*N*100
m = int(N**0.5)
for x, y, z in itertools.combinations_with_replacement(range(1, m+1), 3):
n = x**2+y**2+z**2+x*y+y*z+z*x
k = len(set({x, y, z}))
if k == 1:
count[n] += 1
elif k == 2:
count[n] += 3
else:
count[n] += 6
for n in range(1, N+1):
print(count[n])
|
p02608 | s297719981 | Accepted | from collections import defaultdict
ans = defaultdict(int)
N = int(input())
for i in range(1, 100):
for j in range(1, 100):
for k in range(1, 100):
ans[i*i+j*j+k*k+i*j+j*k+k*i] += 1
for i in range(N):
print(ans[i+1])
|
p02608 | s387377732 | Accepted | n=int(input())
l=[0]*10**7
s=int(n**0.65)+1
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 | s676225930 | Accepted | N = int(input())
from itertools import product
count_dic = {i: 0 for i in range(1, N+1)}
def func(x, y, z):
return x**2 + y**2 + z**2 + x*y + y*z + z*x
for x, y, z in list(product(range(1, 101), repeat=3)):
res = func(x, y, z)
if res > N:
continue
count_dic[res] += 1
for i in range(1, N+1):
print(count_dic[i]) |
p02608 | s513869442 | Accepted | n=int(input())
ans = [0]*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 + i*k + j*k
if v<10050:
ans[v]+=1
for i in range(1,n+1):
print(ans[i])
|
p02608 | s597020859 | 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 | s641372842 | Accepted | n = int(input())
ans = [0 for a 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 | s680455232 | Accepted | def main():
ans = [0] *100000
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
n = int(input())
for i in range(n):
print(ans[i])
if __name__ == "__main__":
main() |
p02608 | s283411064 | Accepted | 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):
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 item in ans[1:]:
print(item)
|
p02608 | s302993942 | Accepted | n=int(input())
a = [0]*(20000)
for i in range(1,101):
for j in range(1,101):
for k in range(1,101):
if i**2+j**2+k**2 >= n:
break
a[i**2+j**2+k**2+i*j+j*k+i*k]+=1
for i in range(1,n+1):
print(a[i])
|
p02608 | s998810051 | Accepted | n=int(input())
r=range(1,100)
l=[0]*n
for x in r:
for y in r:
for z in r:
t=x*x+y*y+z*z+y*z+z*x+x*y-1
if t<n: l[t]+=1
for i in l: print(i) |
p02608 | s512471793 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
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
print(*ans[1:n + 1], sep='\n')
|
p02608 | s350034458 | Accepted | import math
N = int(input())
ans = [0 for _ in range(10050)]
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
if a < 10050:
ans[a] +=1
for i in range(N):
print(ans[i+1])
|
p02608 | s221248975 | Accepted | N=int(input())
count=[0]*(N+1)
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
n=x*x+y*y+z*z+x*y+y*z+z*x
if(n<=N):
count[n]+=1
for i in range(1,N+1):
print(count[i]) |
p02608 | s910305364 | 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*x + y*y + z*z + x*y + y*z + z*x
if n <= N:
ans[n] += 1
print(*ans[1:], sep='\n') |
p02608 | s761288514 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(input())
CNT = [0] * 10010
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
f = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if f > N:
continue
CNT[f] += 1
for i in range(1, N + 1):
print(CNT[i])
|
p02608 | s563880268 | Accepted | import math
n = int(input())
ans = [0]*n
root = n ** 0.5
for x in range(1, math.floor(root) + 1):
for y in range(1, math.floor(root) + 1):
for z in range(1, math.floor(root) + 1):
result = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if result <= n:
ans[result - 1] += 1
for num in ans:
print(num) |
p02608 | s301312245 | Accepted | N=int(input())
ans=[0]*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
tmp+=x*y+y*z+z*x
if tmp<=N:
ans[tmp]+=1
for i in range(1,N+1):
print(ans[i])
|
p02608 | s803599676 | Accepted | N = int(input())
ans = [0] * (N + 1)
for i in range(1, 100):
for j in range(1, 100):
for k in range(1, 100):
a = i**2 + j**2 + k**2 + i*j + j*k + k*i
if a <= N:
ans[a]+=1
for i in range(1, N+1):
print(ans[i]) |
p02608 | s193018905 | Accepted | def main():
N = int(input())
ans = [0 for _ in range(10005)]
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
v = i**2 + j**2 + k**2 + i*j + j*k + k*i
if v < 10005:
ans[v]+=1
for i in range(1,N+1):
print(ans[i])
if __name__ == "__main__":
main() |
p02608 | s282779415 | Accepted | #!/usr/bin/env python3
n = int(input())
list_ = [0]*(10**4)
for x in range(1, 105):
for y in range(1, 105):
for z in range(1, 105):
a = x**2+y**2+z**2+x*y+y*z+z*x
if a <= 10**4:
list_[a-1] += 1
for i in range(n):
print(list_[i])
|
p02608 | s499397071 | 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):
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 | s274023698 | Accepted | N = int(input())
from collections import deque
tmp = []
tmp = deque(tmp)
num = [0]*(10**4*7)
for i in range(1,10**2+1):
tmp.append(i**2)
for x in tmp:
xx = int(x**0.5)
for y in tmp:
yy = int(y**0.5)
for z in tmp:
zz = int(z**0.5)
ans = x + y + z + xx*yy + yy*zz + zz*xx
num[ans] += 1
for i in range(1,N+1):
print(num[i]) |
p02608 | s023730818 | Accepted | N=int(input())
r=[0]*N
from itertools import product
for x,y,z in product(range(1,100),repeat=3):
p=x*x+y*y+z*z+x*y+y*z+z*x
if 0<p<=N:
r[p-1]+=1
print(*r,sep='\n') |
p02608 | s637580967 | Accepted | def main_v2():
N = int(input())
f_list = [0 for _ in range(N)]
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
ans = x*x + y*y + z*z + x*y + y*z + z*x
if ans <= N:
f_list[ans - 1] += 1
for i in range(N):
print(f_list[i])
if __name__ == "__main__":
main_v2()
|
p02608 | s902245572 | Accepted | import math
N = int(input())
S = [0]*N
lim = math.sqrt(N)
lim = math.floor(lim)
for i in range(1,lim):
for j in range(1,lim):
for k in range(1,lim):
temp = int(i**2+ j**2 + k**2 + i*j + j*k + k*i)
if temp <N+1:
S[temp-1] += 1
for i in range(N):
print(S[i])
|
p02608 | s711255860 | Accepted | 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):
c = x * x + y * y + z * z + x * y + y * z + z * x
if c <= n:
a[c] +=1
else:
break
for i in a[1:]:
print(i)
|
p02608 | s855603922 | Accepted | n=int(input())
ans=[0]*(n+1)
r=int(n**0.5)+1
for x in range(1,r):
for y in range(1,r):
for z in range(1,r):
t=x**2+y**2+z**2+x*y+y*z+z*x
if t <= n:
ans[t]+=1
for i in ans[1:]:
print(i)
|
p02608 | s865715635 | Accepted | n=int(input())+1
table0=[0]*10001
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
r=x*x+y*y+z*z+x*y+y*z+x*z
if r<n:
table0[r]+=1
for i in range(1,n):
print(table0[i]) |
p02608 | s565672037 | Accepted | n = int(input())
ans = [0 for i in range(n)]
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
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 | s935964386 | Accepted | import math
N = int(input())
fn = {i+1:0 for i in range(N)}
rtN = int(math.sqrt(N))+1
def n(x,y,z):
return x**2 + y**2 + z**2 + x*y + y*z + z*x
for x in range(1, rtN):
for y in range(1, rtN):
for z in range(1, rtN):
n_ = n(x,y,z)
try:
fn[n_] += 1
except KeyError:
pass
for k in fn.values():
print(k) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.