problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02608 | s481199221 | Accepted | n = int(input())
ans = [0 for _ in range(n)]
for x in range(1, 101):
if x*x > n:
break
for y in range(1, 101):
if x*x + y*y + x*y > n:
break
for z in range(1, 101):
a = x*x + y*y + z * z + x*y + y*z + z*x
if a > n:
break
ans[a-1] += 1
for a in ans:
print(a)
|
p02608 | s610098790 | Accepted | N = int(input())
cnt = [0] * (N + 1)
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
check = x*x + y*y + z*z + x*y + y*z + z*x
if check <= N:
cnt[check] += 1
else:
break
for i in range(1,N+1):
print(cnt[i]) |
p02608 | s582890568 | Accepted | N = int(input())
N_MAX = 10 ** 4
cnt = [0] * (N_MAX + 1)
for x in range(1, N + 1):
if x ** 2 > N:
break
for y in range(1, N + 1):
if x ** 2 + y ** 2 + x * y > N:
break
for z in range(1, N + 1):
a = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + x * z
if a > N:
break
cnt[a] += 1
for i in range(1, N + 1):
print(cnt[i])
|
p02608 | s248393788 | Accepted | N = int(input())
MAX = 10**4
ANS = [0]*(MAX+1)
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 <= MAX):
ANS[k] += 1
for i in range(1, N+1):
print(ANS[i]) |
p02608 | s592367175 | 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 | s244228621 | Accepted | N=int(input())
f=[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:
f[n-1]+=1
print(*f,sep="\n") |
p02608 | s586792987 | Accepted | n = int(input())
ans = [0 for _ in range(10001)]
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
s = x*x + y*y + z*z + x*y + y*z + z*x
if s <= 10000:
ans[s] += 1
for i in range(1, n+1):
print(ans[i])
|
p02608 | s591903973 | Accepted | N = int(input())
res = [0]*20000
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)):
idx = x**2 + y**2 + z**2 + x*y + y*z + z*x
if idx < 20000:
res[idx] += 1
for r in res[1:N+1]:
print(r) |
p02608 | s128633024 | Accepted | n=int(input())
end=int(n**0.5)+1
cnt=0
l=[0 for i in range(6*end*end)]
for i in range(1,end):
for j in range(1,end):
for k in range(1,end):
now=i*i+j*j+k*k+i*j+i*k+j*k
l[now-1]+=1
for i in range(n):
print(l[i])
|
p02608 | s936697041 | Accepted | N = int(input())
memo = [0]*(N+1)
for i in range(1,150):
for j in range(1,150):
for k in range(1,150):
n = (i+j)**2 + (j+k)**2 + (k+i)**2
if n <= 2*N and n%2 == 0:
memo[n//2] += 1
for i in memo[1:]:
print(i) |
p02608 | s185272189 | Accepted | n = int(input().rstrip())
ans = [0 for x in range(10000)]
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
f = ((x+y)**2 + (y+z)**2 + (z+x)**2)//2
if f <= 10000:
ans[f-1] += 1
for i in range(n):
print(ans[i]) |
p02608 | s190699661 | 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):
d = x*x+y*y+z*z+x*y+y*z+x*z
if d <= N:
a[d] += 1
for i in range(1, N+1):
print(a[i])
|
p02608 | s342855905 | Accepted | n=int(input())
a=[0]*n
for x in range(1,120):
for y in range(1,120):
for z in range(1,120):
i=(x+y+z)**2-x*y-y*z-z*x
if i<=n:
a[i-1]+=1
print(*a,sep="\n") |
p02608 | s105219162 | Accepted | def solve(n):
li = [0] * (n ** 3 + 1)
for x in range(1, n + 1):
for y in range(1, n + 1):
for z in range(1, n + 1):
li[x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x] += 1
return li
N = int(input())
ans = solve(100)
[print(ans[i]) for i in range(1, N + 1)]
|
p02608 | s402265701 | Accepted | (N, ) = [int(n) for n in input().split()]
F = [0 for _ in range(N)]
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
val = x * x + y * y + z * z + x * y + y * z + z * x
if val <= N:
F[val-1] += 1
for f in F:
print(f)
|
p02608 | s193841064 | Accepted | from collections import defaultdict as dd
n = int(input())
counter = dd(int)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
ans = x**2 + y**2 + z**2 + x*y + y*z + z*x
counter[ans] += 1
for num in range(1, n+1):
print(counter[num])
|
p02608 | s708631483 | Accepted | N = int(input())
anslist = [0] * N
for i in range(1,int(N**0.5)+1):
for j in range(1,int(N**0.5)+1):
for k in range(1,int(N**0.5)+1):
a = i**2 + j**2 + k**2 + i*j + j*k + k*i
if a <= N:
anslist[a-1] += 1
for i in range(N):
print(anslist[i])
|
p02608 | s205337768 | Accepted | n=int(input())
l=[0]*(10**4+1)
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
f=i**2+j**2+k**2+i*j+j*k+k*i
if f<=10**4:
l[f]+=1
for i in range(1,n+1):
print(l[i]) |
p02608 | s746697211 | Accepted | N = int(input())
ans = [0]*N
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):
a = x**2 + y**2 + z**2 + x*y + y*z + z*x
if a <= N:
ans[a-1] += 1
for i in range(N):
print(ans[i]) |
p02608 | s745469632 | Accepted | n = int(input())
fn = [0] * (n+1)
def f(x, y, z):
return x**2 + y**2 + z**2 + x*y + y*z + z*x
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
idx = f(x, y, z)
if idx <= n:
fn[idx] += 1
for i in range(1, n+1):
print(fn[i])
|
p02608 | s411866136 | Accepted | n = int(input())
res = [0] * 100001
for x in range(1,110):
for y in range(1,110):
for z in range(1,110):
v = x*x + y*y + z*z + x*y + y*z + x*z
if v < 100001:
res[v] += 1
for i in range(n):
print(res[i+1]) |
p02608 | s626554851 | Accepted | # (x + y + z) ** 2 == n + xy + yz + zx\
ans = [0] * 10010
n = int(input())
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:
ans[value] += 1
for i in range(1, n+1):
print(ans[i]) |
p02608 | s055506082 | Accepted | ar = [0 for a in range(10001)]
for a in range(1,100):
for b in range(1,100):
for c in range(1,100):
if a*a + b*b + c*c +a*b + b*c + c*a <=10**4:
ar[a*a + b*b + c*c +a*b + b*c + c*a]+=1
n = int(input())
for i in range(1,n+1):
print(ar[i],end= " ") |
p02608 | s275410958 | Accepted | n = int(input())
cnt = [0] * 10**5
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
cnt[x**2 + y**2 + z**2 + x*y + y*z + z*x] += 1
for i in range(1,n+1):
print(cnt[i]) |
p02608 | s492623900 | Accepted | N = int(input())
ans = [0]*(10**5)
for x in range(1,110):
for y in range(1,110):
for z in range(1,110):
cnt = x**2 + y**2 + z**2 + x*y + y*z + z*x
ans[cnt] += 1
for i in range(1,N+1):
print(ans[i])
|
p02608 | s545667286 | Accepted | N = int(input())
X = [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 + i * k
if a <= N:
X[a] += 1
for a in X[1:]:
print(a) |
p02608 | s241414234 | Accepted | n=int(input())
lis=[0]*(n+1)
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+x*z
if k<=n:
lis[k]+=1
for i in range(1,n+1):
print(lis[i]) |
p02608 | s372032810 | Accepted | from collections import defaultdict
import math
n=int(input())
d=defaultdict(int)
if n>2:
m=int(math.sqrt(n))
for k in range(1,m):
for i in range(1,m):
for j in range(1,m):
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 | s844570355 | 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):
key = x**2+y**2+z**2+x*y+y*z+z*x
if key <= 10000:
ans[key] += 1
for i in range(1, n+1):
print(ans[i]) |
p02608 | s933562462 | Accepted | N = int(input())
A = [0] * (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 - 1] += 1
for i in range(0, N):
print(A[i])
|
p02608 | s716450597 | Accepted | import math
N = int(input())
ans = [0]*N
l = int(math.sqrt(N))
for i in range(1,l):
for j in range(1,l):
for k in range(1,l):
a = (i+j+k)**2-(i*j+j*k+k*i)
if a <= N:
ans[a-1] += 1
print(*ans, sep='\n')
|
p02608 | s704244291 | Accepted | import sys
input = sys.stdin.readline
N=int(input())
s= [0 for i in range(10002)]
for x in range(1,100):
for y in range(1,100):
if x*x + y*y>10000:break
for z in range(1,100):
a = x*x + y*y + z*z +x*y + y*z + z*x
if a >10000:break
s[a] +=1
for i in range(N):
print(s[i+1]) |
p02608 | s975498118 | Accepted | def main():
N = int(input())
ans = [0] * 10001
for i in range(1, 101):
for j in range(1, 101):
if i**2 + j**2 < 10001:
for k in range(1, 101):
tmp = i**2 + j**2 + k**2 + i*j + j*k + i*k
if tmp < 10001:
ans[tmp] += 1
for i in range(1, N+1):
print(ans[i])
if __name__ == '__main__':
main()
|
p02608 | s956446396 | Accepted | import math
n = int(input())
lst = [0]*n
const = int(math.sqrt(n))
if n < 6:
for i in range(n):
print(0)
exit()
for x in range(1, const):
for y in range(1, const):
for z in range(1, const):
s = x*x + y*y + z*z + x*y + y*z + z*x
if s > n:
continue
else:
lst[s-1] += 1
for i in lst:
print(i) |
p02608 | s740477053 | 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())
ans = [0 for _ in range(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
ans[idx-1] += 1
for i in range(N):
print(ans[i])
|
p02608 | s532168082 | Accepted | #!/usr/bin/env python3
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):
w = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if w <= n:
ans[w] += 1
for i in range(1, n + 1):
print(ans[i])
|
p02608 | s900030315 | Accepted | n = int(input())
cnt = [set() for i in range(n+1)]
def f(x, y, z):
return x*x+y*y+z*z+x*y+y*z+x*z
for x in range(1, n+1):
if f(x,1,1) > n: break
for y in range(1, n+1):
if f(x,y,1) > n: break
for z in range(1, n+1):
t = f(x,y,z)
if t > n: break
cnt[t].add((x,y,z))
for i in range(1, n+1):
print(len(cnt[i])) |
p02608 | s068305624 | Accepted | import math
n = int(input())
arr = [0] * n
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
ans = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if ans <= n:
arr[ans - 1] += 1
for i in range(n):
print(arr[i]) |
p02608 | s248225163 | Accepted | cnt=[0] * 11000
n = int(input())
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
value = (x+y+z)**2 -(x*y+y*z+z*x)
if value <= n:
cnt[value] += 1
for i in range(1,n+1):
print(cnt[i])
|
p02608 | s197527395 | Accepted | import math
n = int(input())
arr = [0] * n
for x in range(1,500):
for y in range(1,500):
for z in range(1,501):
ans = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if ans <= n:
arr[ans - 1] += 1
for i in range(n):
print(arr[i]) |
p02608 | s698598481 | 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 | s215055768 | Accepted | import math
N = int(input())
ans = [0]*(N+1)
owari = math.sqrt(N)
owari = math.ceil(owari)
for x in range(1, owari):
a = x*x
for y in range(1, owari):
b = y*y
c = x*y
for z in range(1, owari):
hantei = z*(z+x+y)+a+b+c
if hantei > N:
break
ans[hantei] += 1
for i in range(1, N+1):
print(ans[i])
|
p02608 | s698631541 | Accepted | N = int(input())
ans = [0 for _ in range(10**4+50)]
for x in range(1, 105):
for y in range(1, 105):
for z in range(1, 105):
tmp = x**2 + y**2 + z**2 + x*y + y*z + z*x
if tmp < 10**4+50:
ans[tmp] += 1
for i in range(1, N+1):
print(ans[i]) |
p02608 | s497861090 | Accepted | n = int(input())
ans = [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)):
a = x**2 + y**2 + z**2 + x*y + y*z + z*x
if a <= n:
ans[a-1] += 1
[print(x) for x in ans] |
p02608 | s530359311 | Accepted | N = int(input())
ans = [0] * 100000
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
ans[x*x+y*y+z*z+x*y+y*z+z*x-1] += 1
for i in range(N):
print(ans[i])
|
p02608 | s993895460 | Accepted | import math
N = int(input())
MAX = min(math.ceil(math.sqrt(N)),101)
d = {}
for i in range(10001):
d[i] = 0
for x in range(1,MAX):
for y in range(1,MAX):
for z in range(1,MAX):
tmp = x**2 + y**2 + z**2 + x*y + y*z + z*x
if tmp in d.keys():
d[tmp] += 1
else:
d[tmp] = 1
for i in range(1,N+1):
print(d[i]) |
p02608 | s978907271 | Accepted | import sys
input = sys.stdin.readline
n = int(input())
dp = [0]*(n+1)
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
tmp = x*x + y*y + z*z + x*y + y*z + z*x
if tmp <= n:
dp[tmp] += 1
for i in range(1, n+1):
print(dp[i]) |
p02608 | s563855016 | Accepted | n=int(input())
k=int(n**0.5)+1
a=[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):
g=x*x+y*y+z*z+x*y+y*z+x*z
if g<=n:
a[g]+=1
print(*a[1:],sep='\n') |
p02608 | s786568850 | Accepted | def F(x,y,z):
return x**2+y**2+z**2+x*y+y*z+z*x
dic = [0]*(10**4+1)
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
temp = F(x,y,z)
if temp<10**4+1:
dic[temp] += 1
N = int(input())
for x in range(1,N+1):
print(dic[x])
|
p02608 | s674623617 | Accepted | N=int(input())
ans_dist={}
for n in range(1,N+1):
ans_dist[n]=0
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 + x*z
if a <= N:
ans_dist[a]+=1
for k in ans_dist.keys():
print(ans_dist[k]) |
p02608 | s788116127 | Accepted | N = int(input())
li = [0]*(pow(10,6))
max_ = int(N**(1/2))+1
from itertools import combinations_with_replacement
for i in combinations_with_replacement(range(1,max_),3):
a,b,c = i
sum_ = a**2+b**2+c**2 + a*b+b*c+c*a
if sum_>N:
continue
if a==b==c:
li[sum_]+=1
elif (not a==b) and (not b==c) and (not c==a):
li[sum_]+= 6
else:
li[sum_]+= 3
for i in range(1,N+1):
print(li[i]) |
p02608 | s373684424 | Accepted | n = int(input())
ans = [0 for i in range(10001)]
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
v = x**2+y**2+z**2+x*y+y*z+z*x
if v<=10000:
ans[v]+=1
for i in range(n):
print(ans[i+1]) |
p02608 | s827187110 | Accepted | 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)
N = int(input())
c = collections.Counter(ans_list)
for i in range(1, N + 1):
print(c[i])
|
p02608 | s895487965 | 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):
X = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if X <= n:
ans[X-1] += 1
for ansi in ans:
print(ansi) |
p02608 | s712066765 | Accepted | import math
n = int(input())
answer_lists = [0 for i in range(10001)]
for x in range(1, int(math.sqrt(n+1)), 1):
for y in range(1, int(math.sqrt(n+1)), 1):
for z in range(1, int(math.sqrt(n+1)), 1):
formula = (x+y+z)**2 - (x*y + y*z + z*x)
if formula <= n:
answer_lists[formula] += 1
else:
break
for i in range(1, n+1, 1):
print(answer_lists[i]) |
p02608 | s807469094 | Accepted | N = int(input())
ans = [0] * (10 ** 4 + 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):
tmp = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if tmp <= N:
ans[tmp] += 1
print (*ans[1:N + 1], sep = '\n')
|
p02608 | s721431059 | Accepted | n = int(input())
dic = {}
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):
ans = x**2 + y **2 + z**2 +x*y+y*z+z*x
if ans in dic:
dic[ans] +=1
else:
dic[ans] = 1
for i in range(n):
if i+1 in dic:
print(dic[i+1])
else:
print(0) |
p02608 | s686729259 | Accepted | import sys
input=sys.stdin.readline
import math
N=int(input().rstrip('\n'))
n = math.floor(math.sqrt(N))
res_dict={i:0 for i in range(1,N+1)}
for x in range(1,n):
for y in range(1,n):
for z in range(1,n):
ans = x**2 +y**2+z**2+x*y+y*z+x*z
if ans in res_dict:
res_dict[ans] += 1
else:
res_dict[ans] = 1
for i in range(1,N+1):
print(res_dict[i]) |
p02608 | s485811337 | Accepted | n = int(input())
table = [0]*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):
a = (x+y+z)**2 - x*y - y*z - z*x
if a <= n:
table[a-1] += 1
for a in table:
print(a) |
p02608 | s677792421 | Accepted | N = int(input())
ls = [0]*(N+2)
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
t = i**2 + j**2 + k**2 + i*j + j*k + k*i
if t <= N :
ls[t] += 1
for p in range(1,N+1):
print(ls[p]) |
p02608 | s127823999 | Accepted | n=int(input())
p=round(n**0.5)+1
ans=[0]*n
for x in range(1,p):
for y in range(1,p):
for z in range(1,p):
k=x**2+y**2+z**2+x*y+y*z+z*x
k-=1
if 0<=k<=n-1:
ans[k]+=1
for i in ans:
print(i) |
p02608 | s040293926 | Accepted | import sys
readline = sys.stdin.readline
N = int(readline())
ans = [0] * (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):
val = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if val <= N:
ans[val] += 1
for i in range(1, len(ans)):
print(ans[i]) |
p02608 | s383351386 | 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 | s487939477 | Accepted | N = int(input())
F = [0]*(N+1)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
c = x**2 + y**2 + z**2 + x*y + y*z + z*x
if (c <= N):
F[c] += 1
print(*F[1:], sep='\n') |
p02608 | s952403588 | 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 | s412533520 | Accepted | cnt = [0] * 11000
n = int(input())
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 | s006131100 | Accepted | N = int(input())
from math import sqrt
from collections import defaultdict
ans = defaultdict(int)
k = int(sqrt(N)) + 5
for x in range(1, k):
for y in range(1, k):
for z in range(1, k):
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 | s437805841 | Accepted | def main():
N = int(input())
ans = [0 for i in range(N + 1)]
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
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 | s492693488 | Accepted | N = int(input())
a = [0]*(N + 1)
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 + i*j + j*k + k*i <= N:
a[i**2 + j**2 + k**2 + i*j + j*k + k*i] += 1
for i in range(N):
print(a[i + 1]) |
p02608 | s325430472 | Accepted | N = int(input())
A = [0]*(N+1)
L = int(N**0.5)+1
for x in range(1,L+1):
for y in range(1,L+1):
for z in range(1,L+1):
num = x*x+y*y+z*z+x*y+y*z+z*x
if num <= N:
A[num] += 1
for i in range(1,N+1):
print(A[i])
|
p02608 | s721428975 | Accepted | n=int(input())
lis=[0 for i in range(n)]
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
ni=x*x+y*y+z*z+x*y+y*z+z*x
if ni<=n:
lis[ni-1]+=1
for i in range(n):
print(lis[i]) |
p02608 | s274296649 | Accepted | n=int(input())
ans=[0]*(10**7)
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+i*k)-1]+=1
for l in range(n):
print(ans[l]) |
p02608 | s216918814 | Accepted | from collections import defaultdict
n = int(input())
d = defaultdict(int)
for i in range(1, 120):
for j in range(1, 120):
for k in range(1, 120):
num = i**2 + j ** 2 + k ** 2 + i * j + j * k + k * i
d[num] += 1
for i in range(1,n+1):
print(d[i])
|
p02608 | s082749742 | Accepted | N = int(input())
def count(a, b, c):
return (a+b+c)**2-a*b-b*c-c*a
table = [0] * (N+1)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
tmp = count(x, y, z)
if tmp <= N:
table[tmp] += 1
print(*table[1:], sep="\n") |
p02608 | s101695424 | Accepted | n=int(input())
d=dict({i:0 for i in range(1,n+1)})
for s in range(3,201):
for x in range(1,s+1-2):
for y in range(1,s+1-x-1):
z=s-x-y
v=x**2+y**2+z**2+x*y+y*z+z*x
if not v in d:
continue
d[v]+=1
for k in d.keys():
print(d[k])
|
p02608 | s811649075 | Accepted | n=int(input())
a=[0]*(n+1)
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
t=x**2+y**2+z**2+x*y+y*z+z*x
if t<=n:
a[t-1]+=1
print(*a[:n],sep='\n') |
p02608 | s026115925 | Accepted | N = int(input())
def f(a, b, c):
return a**2 + b**2 + c**2 + a*b + b*c + c*a
ans = [0] * N
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
n = f(x,y,z)
if n <= N:
ans[n-1] += 1
for a in ans:
print(a)
|
p02608 | s447862106 | Accepted | n = int(input())
a = [0] * (n + 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):
tmp = x**2 + y**2 + z**2 + x*y + y*z + z*x
if tmp <= n:
a[tmp] += 1
for i in range(1, n + 1):
print(a[i]) |
p02608 | s731162033 | Accepted | def main():
num = int(input())
counter = [0] * (num + 1)
# func(41, 41, 41) = 10086
# func(99, 1, 1) = 10002
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 123 - x - y + 1):
tmp = (x + y + z) ** 2 - x * y - y * z - z * x
if tmp <= num:
counter[tmp] += 1
for count in counter[1:]:
print(count)
if __name__ == '__main__':
main()
|
p02608 | s660739463 | Accepted | 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(1,n+1):
print(ans[i])
|
p02608 | s567207250 | Accepted | N=int(input())
ans=[0]*(N+1)
to=int((N)**(1/2))+2
for x in range(1,to):
for y in range(1,to):
for z in range(1,to):
temp=x*x+y*y+z*z+x*y+y*z+z*x
if temp<=N:
ans[temp]+=1
for i in range(1,N+1):
print(ans[i]) |
p02608 | s824885100 | Accepted | n = int(input())
answer = [0 for _ in range(n)]
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 + i * j + j * k + k * i <= n:
answer[i ** 2 + j ** 2 + k ** 2 + i * j + j * k + k * i - 1] = answer[i ** 2 + j ** 2 + k ** 2 + i * j + j * k + k * i - 1] + 1
for i in range(n):
print(answer[i])
|
p02608 | s085652992 | Accepted | import numpy as np
n = int(input())
max_n = int(n ** 0.5)
memo = np.zeros((max_n, max_n, max_n))
ans = [0]*(n+1)
for x in range(1, max_n):
for y in range(1, max_n):
for z in range(1, max_n):
s = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if s < n+1:
ans[s] += 1
for i in range(1, n+1):
print(ans[i])
|
p02608 | s792708477 | Accepted | import itertools
n = int(input())
ans_d = {i: 0 for i in range(1,10001)}
p = itertools.product(range(1, 100), range(1, 100), range(1, 100))
for x, y, z in p:
cnt = (x ** 2) + (y ** 2) + (z ** 2) + (x * y) + (y * z) + (x * z)
if cnt <= 10000:
ans_d[cnt] += 1
for i, j in ans_d.items():
print(j)
if i == n:
break |
p02608 | s098759656 | Accepted | from itertools import product
N = int(input())
ans = [0] * (N + 1)
for x, y, z in product(range(1, 101), repeat=3):
f = x**2 + y**2 + z**2 + x * y + y * z + z * x
if f <= N:
ans[f] += 1
print(*ans[1:], sep='\n')
|
p02608 | s656524957 | 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(N):
print(ans[i+1])
|
p02608 | s391588947 | Accepted | from itertools import combinations_with_replacement
n = int(input())
res = [0] * n
for x, y, z in combinations_with_replacement(range(1, int(n**0.5)), 3):
val = x**2 + y**2 + z**2 + x*y + y*z + z*x
if val > n:
continue
if (l := len(set([x, y, z]))) == 1:
res[val-1] += 1
elif l == 2:
res[val-1] += 3
else:
res[val-1] += 6
print('\n'.join(map(str, res)))
|
p02608 | s422622525 | Accepted | n = int(input())
ans = [0]*(10**4+1)
for i in range(1,200):
for j in range(1,200):
for k in range(1,200):
a = i**2 + j**2 + k**2 + (i*j) + (j*k) + (k*i)
if a <= 10**4:
ans[a] += 1
for i in range(1,n+1):
print(ans[i]) |
p02608 | s195506852 | Accepted | def main():
n = int(input())
d = dict()
for i in range(1, 10001):
d[i] = 0
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
r = x**2+y**2+z**2+x*y+y*z+z*x
if r <= 10000:
d[r] += 1
for i in range(1, n+1):
print(d[i])
main()
|
p02608 | s693127024 | Accepted | import math
N = int(input())
ans_list = [0 for i in range(N)]
index = int(math.sqrt(N))
for x in range(1,index):
for y in range(1,index):
for z in range(1,index):
n = x**2 + y**2 + z**2 + x*y + y*z + z*x
if (n <= N):
ans_list[n-1] += 1
for i in range(N):
print(ans_list[i]) |
p02608 | s909802730 | Accepted | n = int(input())
rootn = int(n**0.5) +1
ans = [0] * (n+1)
for x in range(1, rootn):
for y in range(1, rootn):
for z in range(1, rootn):
cur = x**2 + y**2 + z**2 + x*y + y*z + z*x
if cur <= n:
ans[cur] += 1
print('\n'.join(map(str, ans[1:]))) |
p02608 | s095440887 | Accepted | n = int(input())
dp = [0 for i in range(n+1)]
maxn = n**0.5
maxn = int(maxn)+1
for x in range(1,maxn):
for y in range(1,maxn):
for z in range(1,maxn):
p = x*x + y*y + z*z + x*y + y*z +z*x
if p<=n:
dp[p]+=1
for i in dp[1::]:
print(i) |
p02608 | s442171253 | Accepted | n = int(input())
ans=[0]*(n+100000)
import math
for x in range(1,int(math.sqrt(n+1)+1)):
if x**2 > n:
break
for y in range(1,int(math.sqrt(n+1)+1)):
if x**2 +y**2 + x*y> n:
break
for z in range(1,int(math.sqrt(n+1)+1)):
calc = x**2+y**2+z**2+x*y+y*z+z*x
ans[calc]+=1
for i in range(1,n+1):
print(ans[i]) |
p02608 | s652121342 | Accepted | N=input()
L=[ 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 1<=a<=N:
L[a]+=1
for i in range(1,N+1):
print L[i] |
p02608 | s176380271 | Accepted | N = int(input())
N2 = int(N**0.5)
cnt = [0] * (90000)
for x in range(1,N2+1):
for y in range(1,N2+1):
for z in range(1,N2+1):
xyz = x*x + y*y + z*z + x*y + y*z + z*x
cnt[xyz] += 1
#
for i in range(1,N+1):
print( cnt[i] )
|
p02608 | s906380758 | 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:
continue
ans[n] += 1
for a in ans[1:]:
print(a)
|
p02608 | s734621438 | Accepted | N = int(input())
arr = [0]*(N)
lim = int(N**0.5 + 1)
for i in range(1,lim):
for j in range(1,lim):
for k in range(1,lim):
num = i**2 + j**2 + k**2 + i*j + j*k + k*i - 1
if num <= N-1:
arr[num] += 1
print(*arr, sep='\n')
|
p02608 | s340894137 | Accepted | n = int(input())
X = [0]*(10**4+1)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
t = (x+y)**2+(y+z)**2+(z+x)**2
if t%2 == 0:
if 0 <= t//2 <= 10**4:
X[t//2] += 1
for i in range(1, n+1):
print(X[i])
|
p02608 | s009080580 | Accepted | #!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
N = int(input())
ans = [0] * (6 * 10**4 + 10)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
ans[x**2 + y**2 + z**2 + x * y + y * z + x * z - 1] += 1
for i in range(N):
print(ans[i])
if __name__ == "__main__":
main()
|
p02608 | s426637322 | Accepted | n = int(input())
ans = [0 for i in range(n+1)]
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
#print(x, y, z, tmp)
if 1 <= tmp and tmp <= n:
ans[tmp] += 1
for i in range(1, 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.