problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02608 | s446521269 | Wrong Answer | N = int(input())
def Main(N):
B = 41
ans = [0]*(6*B*B+1)
for i in range(1, B+1):
for j in range(1, B+1):
for k in range(1, B+1):
a = i*i+j*j+k*k+i*j+j*k+k*i
ans[a] += 1
return ans
out = Main(N)
for i in range(1, N+1):
print(out[i]) |
p02608 | s674714207 | Wrong Answer | n = int(input())
ans = [0 for _ in range(n)]
for i in range(1,32):
for j in range(1,32):
for k in range(1,32):
s = i**2 + j**2 + k**2 +i*j + j*k + k*i
if s <= n:
ans[s-1] += 1
for i in range(n):
print(ans[i]) |
p02608 | s130116263 | Wrong Answer | from collections import defaultdict,deque
from sys import stdin,setrecursionlimit
import heapq,bisect,math,itertools,string,queue,copy
setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, stdin.readline().split()))
N = int(input())
d = [0]*(10**6 + 1)
for x in range(101):
for y in range(101):
for z in range(101):
res = x**2 + y**2 + z**2 + x*y + y*z + z*x
d[res] += 1
for i in range(1,N+1):
print(d[i])
|
p02608 | s490555969 | Wrong Answer | from math import sqrt
N = int(input())
ans = [0 for _ in range(N)]
num_m = (N-4)//2
for x in range(1, int(sqrt(N))+1):
for y in range(1, int(sqrt(N))+1):
for z in range(1, int(sqrt(N))+1):
n = x**2+y**2+z**2+x*y+y*z+z*x
if n <= N-1:
ans[n-1] += 1
print(*ans, sep="\n") |
p02608 | s045367211 | Wrong Answer | 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(n+1):
print(d[i])
|
p02608 | s673252133 | Wrong Answer | n = int(input())
ans = [0 for i in range(n)]
for i in range(101):
for j in range(101):
for k in range(101):
a = i*i +j*j + k*k + i*j +j*k + k*i
if a < n:
ans[a]+=1
for i in ans:
print(i) |
p02608 | s136025550 | Wrong Answer | N = int(input())
ans = {}
for x in range(1, 42):
for y in range(1, 42):
for z in range(1, 42):
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 | s226157022 | Wrong Answer | N = int(input())
record = [0] * 1000000
for i in range(1,N+1):
for j in range(1,N+1):
sum = i**2 + i**2 + j**2 + i*i + i*j +j*i
if sum >= N: break
# print(i,j)
record[sum] += 3
for num in record[1:N+1]:
print(num)
|
p02608 | s611709313 | 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 x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x == i:
if (x+y+z)**2 - (x*y + y*z + z*x) == i:
cnt += 1
print(cnt)
|
p02608 | s902310547 | Wrong Answer | # C - XYZ Triplets
from collections import Counter
def main():
"""
if x = y = z and n = 1000,
6 * x^2 = 1000
x ≈ 13.038 -> lim = 14
"""
N = int(input())
calc = lambda x, y, z: x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
cnt = Counter(
calc(i, j, k) for i in range(1, 15) for j in range(1, 15) for k in range(1, 15)
)
res = [cnt[i] for i in range(1, N + 1)]
print("\n".join(map(str, res)))
if __name__ == "__main__":
main()
|
p02608 | s040574555 | Wrong Answer | N = int(input())
result = [0] * N
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
temp = pow(x+y, 2) + pow(y+z, 2) + pow(z+x, 2)
n = temp / 2
if not n.is_integer():
continue
n = int(n)
if n >= N:
break
result[n-1] += 1
for r in result:
print(r) |
p02608 | s358570155 | Wrong Answer | N = int(input())
def perfect_number(x, y, z):
n = x**2 + y**2 + z**2 + x*y + y*z + z*x
return n
l = []
for x in range(1, N):
for y in range(1, N):
for z in range(1, N):
n = perfect_number(x,y,z)
if n > N:
break
else:
l.append(n)
counts = [l.count(x) for x in sorted(set(l))]
d = dict(zip(l, counts))
for i in range(1, N+1):
if i in d:
print(d[i])
else:
print(0) |
p02608 | s388671397 | Wrong Answer | n = int(input())
ANS =[0 for _ in range(n)]
for x in range(1, int((n/2)**0.5) + 1):
for y in range(1, int((n/2)**0.5) + 1):
for z in range(1, int((n/2)**0.5) + 1):
if x**2 + y**2 + z**2 + x*y + y*z + z*x > n:
continue
ANS[(x**2 + y**2 + z**2 + x*y + y*z + z*x) - 1] += 1
for i in ANS:
print(i) |
p02608 | s459248980 | Wrong Answer | import math
N = int(input())
print(0)
print(0)
for i in range(3, N+1):
ra = math.sqrt(i - 2) - 1
ran = math.floor(ra)
ans = 0
for x in range(1, ran+1):
for y in range(1, ran+1):
for z in range(1, ran+1):
f = x**2 + y**2 + z**2 + x*y + y*z + z*x
if i == f:
ans += 1
print(ans) |
p02608 | s050432332 | Wrong Answer | N = int(input())
N_list = [0]*(N+1)
for i in range(1,11):
for j in range(1,11):
for k in range(1,11):
if(i**2+j**2+k**2+i*j+j*k+k*i<=N):
N_list[i**2+j**2+k**2+i*j+j*k+k*i]+=1
for i in N_list:
print(i) |
p02608 | s256493706 | Wrong Answer | import itertools
import math
a = int(input())
cnt = 0
ans = []
l = list(range(1,int(math.sqrt(a/2))))
for x,y,z in itertools.product(l, repeat=3):
ans.append(x*x+y*y+z*z+x*y+y*z+z*x)
for i in range(1,a+1):
print(ans.count(i)) |
p02608 | s247284118 | Wrong Answer | import sys
import bisect
from functools import lru_cache
from collections import defaultdict
inf = float('inf')
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**6)
def input(): return sys.stdin.readline().rstrip()
def read():
return int(readline())
def reads():
return map(int, readline().split())
N=read()
M=33
for n in range(1,N+1):
count=0
for i in range(1,M):
for j in range(1,M):
for k in range(1,M):
if i**2+j**2+k**2+i*j+j*k+i*k==n:
count+=1
print(count) |
p02608 | s852390675 | Wrong Answer | n = int(input())
count = [0] * 10001
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(1 <= temp and temp <= 10000):
count[temp] += 1
for i in range(n):
print(count[i]) |
p02608 | s989064911 | Wrong Answer | n = int(input())
l = int(n**(0.3))
for a in range(n):
s=0
for i in range(l):
if((3*i+3)**2-(3*(i**2)+6*i+3)==a+1):
s+=1
continue
for j in range(l-i):
for k in range(l-i-j):
if((i+j+k+3)**2-(i*j+j*k+k*i+2*i+2*j+2*k+3)==a+1):
s+=1
print(s) |
p02608 | s323180365 | 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)
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))
|
p02608 | s965938531 | Wrong Answer | #!/usr/bin/env python3
n = int(input())
cnt = [0] * (1 + n)
for a in range(1, 32):
for b in range(1, 32):
for c in range(1, 32):
k = a ** 2 + b ** 2 + c ** 2 + a * b + b * c + c * a
if k > n:
continue
cnt[k] += 1
for i in range(1, n + 1):
print(cnt[i])
|
p02608 | s704141937 | Wrong Answer | import itertools
N=int(input())
L=[0]*(10**4+10)
X=[x for x in range(1,11)]
plus=[0,1,3,6]
for v in itertools.combinations_with_replacement(X,3):
x,y,z=v[0],v[1],v[2]
temp=len(set(v))
L[x**2+y**2+z**2+x*y+y*z+z*x]+=plus[temp]
for i in range(1,N+1):
print(L[i])
|
p02608 | s615194184 | Wrong Answer | 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**2 + j**2 + k**2 + i*j + j*k + k*i
if v < 10050:
ans[v] += 1
for i in range(N+1):
print(ans[i+1])
|
p02608 | s501341294 | Wrong Answer | n = int(input())
ans = [0]*(n+5)
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
temp = x**2 + y**2 + z**2 + x*y + y*z + z*x
if n>=temp:
print(x,y,z, temp)
ans[temp]+=1
for i in range(1,n+1):
print(ans[i])
|
p02608 | s228092979 | Wrong Answer | n = int(input())
num = [0]*(10**5+1)
for i in range(1,51):
for j in range(1,51):
for k in range(1,51):
num[(i**2 + j**2 + k**2 + i*j + j*k + k*i)] += 1
for i in range(1,n+1):
print(num[i]) |
p02608 | s039715868 | Wrong Answer | n = int(input())
ans = [0] * n
loop = int((n/6) ** 1.5) + 1
def f(i, j, k):
return i ** 2 + j ** 2 + k ** 2 + i*j + j*k + k*i
for i in range(1, loop+1):
for j in range(1, loop+1):
for k in range(1, loop+1):
res = int(f(i, j, k))
if res <= n:
ans[res] += 1
for a in ans:
print(a) |
p02608 | s086709095 | Wrong Answer | 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(i,j)
if i == n:
break |
p02608 | s016606875 | Wrong Answer | import math
N = int(input())
enter = int(math.sqrt(N))
value_array = []
for x in range(7, enter):
for y in range(7, enter):
for z in range(7, enter):
value_array.append(x**2 + y **2 + z ** 2 + x*y + y*z + z*x)
for i in range(1, N+1):
print(value_array.count(i)) |
p02608 | s014306480 | Wrong Answer | n = int(input())
ans = []
for i in range(1, n + 1):
cnt = 0
for x in range(1, 65):
for y in range(x, 65):
for z in range(y, 65):
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 | s303500238 | Wrong Answer | from sys import stdin
N = int(stdin.readline().rstrip())
for i in range(1,N+1):
ans = 0
for x in range(1,32):
for y in range(1,32):
for z in range(1,32):
if x**2 + y**2 + z**2 + x*y + y*z + z*x == i:
ans += 1
print(ans) |
p02608 | s799735193 | Wrong Answer | import itertools
N = int(input())
lst = [0]*N
for x,y,z in itertools.product(list(range(1,int(N**0.5))),repeat=3):
val = x*x + y*y +z*z + x*y + y*z + z*x
if 6 <= val <= N:
lst[val-1] += 1
print(*lst[1:],sep="\n") |
p02608 | s745785301 | 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, 59):
for y in range(1, 59):
for z in range(1, 59):
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 | s721816692 | Wrong Answer | n=int(input())
from math import floor,sqrt
sqset=set()
for i in range(1,200):
sqset.add(i**2)
print(sqset)
def func(m):
r=0
for x in range(1,floor(sqrt(m))+1):
for y in range(1,floor(sqrt(m))+1):
a=x+y
b=x**2+y**2+x*y-m
d=a**2-4*b
if d in sqset:
if (sqrt(d)-a)>0 and (sqrt(d)-a)%2==0:
r+=1
return r
for i in range(1,n+1):
print(func(i)) |
p02608 | s802741218 | Wrong Answer | n = int(input())
result_list = [0] * n
half = int(n/2)
for x in range(1, half):
for y in range(1, half):
for z in range(1, half):
calculated_n = x**2 + y**2 + z**2 + x*y + y*z + z*x
if calculated_n <= n+1:
result_list[calculated_n-1] += 1
print(result_list) |
p02608 | s924959611 | Wrong Answer | def triplets_brute(n):
counter = 0
upper = round(n**0.5)
for x in range(1, upper+1):
for y in range(1, upper+1):
for z in range(1, upper+1):
if x**2+y**2+z**2+x*y+y*z+z*x==n:
counter += 1
return counter
print(triplets_brute(int(input()))) |
p02608 | s353054975 | 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):
cnt[x**2 + y**2 + z**2 + x*y + y*z + z*x -1] += 1
for i in range(N):
print(cnt[i])
|
p02608 | s292499044 | Wrong Answer | n=int(input())
import numpy as np
rn=n**0.5
for ii in range(n):
r=0
for xx in np.arange(1,rn+1):
for yy in np.arange(1,xx+1):
for zz in np.arange(1,yy+1):
if xx**2+yy**2+zz**2+xx*yy+xx*zz+yy*zz==n:
r+=1
print(r) |
p02608 | s847786175 | Wrong Answer | 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 * j
if v < 10050:
ans[v] += 1
for i in range(n):
print(ans[i + 1])
|
p02608 | s523462238 | Wrong Answer | from collections import Counter
def main():
n = int(input())
ans = []
for x in range(1, n):
for y in range(1, n):
for z in range(1, n):
ans.append(x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x)
counter = Counter(ans)
for i in range(1, n+1):
print(counter[i], i)
if __name__ == '__main__':
main() |
p02608 | s700143395 | Wrong Answer | 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 + k*j + i*k + i*j
if v < 10050:
ans[v] += 1
for i in range(N):
print(ans[i]) |
p02608 | s632214915 | Wrong Answer | n=int(input())
from math import floor,sqrt
sqset=set()
for i in range(1,101):
sqset.add(i**2)
def func(m):
r=0
for x in range(1,floor(sqrt(m))+1):
for y in range(1,floor(sqrt(m))+1):
a=x+y
b=x**2+y**2+x*y-m
d=a**2-4*b
if d in sqset:
if (sqrt(d)-a)>0 and (sqrt(d)-a)%2==0:
r+=1
return r
for i in range(1,n+1):
print(func(i)) |
p02608 | s525932879 | Wrong Answer | from collections import Counter
n=int(input())
cnt=0
ans=[]
for i in range(2,int((2*n)**0.5)+1):
for j in range(2,int((2*n)**0.5)+1):
for k in range(2,int((2*n)**0.5)+1):
if (i*i + j*j + k*k)%2==0 and (i*i + j*j + k*k)<=2*n and (i+j-k>1) and (i+k-j>1) and (k+j-i>1):
ans.append((i*i + j*j + k*k)//2)
ans.sort()
A=Counter(ans)
for i in range(n):
print(A[i]) |
p02608 | s127618200 | Wrong Answer | #! python3
# coding:utf-8
def main():
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):
eq = x**2 + y**2 + z**2 + x*y + y*z + z*x
if eq < n+1:
ans[eq]+=1
for i in ans:
print(i)
if __name__ == "__main__":
main() |
p02608 | s372382655 | Wrong Answer | N = int(input())
def func(n):
ret = 0
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):
if (i+j)**2+(j+k)**2+(k+i)**2 == 2*n:
ret += 1
return ret
for i in range(1,N):
print(func(i)) |
p02608 | s521414202 | Wrong Answer | 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:
arr[num - 1] += 1
print(*arr, sep='\n')
|
p02608 | s697839367 | Wrong Answer | #! python3
# coding:utf-8
def main():
n = int(input())
ans = [0 for _ in range(n+1)]
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
eq = x**2 + y**2 + z**2 + x*y + y*z + z*x
if eq < n+1:
ans[eq]+=1
for i in ans:
print(i)
if __name__ == "__main__":
main() |
p02608 | s003429537 | Wrong Answer | def main():
N = int(input())
ans = [0 for i in range(N + 1)]
for x in range(1, 45):
for y in range(1, 45):
for z in range(1, 45):
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 | s408107526 | Wrong Answer | N = int(input())
ans = list()
for i in range(N):
ans.append(0)
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 < N:
ans[tmp] += 1
for i in range(N):
print(ans[i]) |
p02608 | s486111394 | 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*(y+z)) + (y*z) == i:
cnt += 1
print(cnt)
|
p02608 | s391062363 | Wrong Answer | N = int(input())
def Main(N):
B = 43
ans = [0]*(6*B*B+10)
for i in range(1, B+1):
for j in range(1, B+1):
for k in range(1, B+1):
a = i*i+j*j+k*k+i*j+j*k+k*i
ans[a] += 1
return ans
out = Main(N)
for i in range(1, N+1):
print(out[i]) |
p02608 | s285324549 | Wrong Answer | N = 20
x,y,z = [0,0,0]
for i in range(1,N+1):
ans = 0
if i < 6:
print(0)
continue
for j in range(1,int(i**0.5)+1):
for k in range(1,int(i**0.5)+1):
for m in range(1,int(i**0.5)+1):
if j**2 + k**2 + m**2 +j*k + j*m + m*k == i:
ans += 1
print(ans) |
p02608 | s014093046 | Wrong Answer | import sys
import math
import statistics
import itertools
from collections import deque
N=int(input())
ans_lis =[0]*10000000
nn=math.sqrt(N)
n=int(nn)
#per_lis=itertools.permutations(list(range(1,4)))
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
tmp=0
tmp=i**2+j**2+k**2+i*j+j*k+k*i
ans_lis[tmp-1]+=1
for g in range(n):
print(ans_lis[g]) |
p02608 | s405211081 | Wrong Answer | n = int(input())
count = [0] * (10**6)
s = 0
for i in range(1, 10):
for j in range(1, 10):
for k in range(1, 10):
s = i * i + j * j + k * k + i * j + j * k + k * i
count[s - 1] += 1
# if s != 0:
# print(i,j,k)
for i in range(n):
print(count[i])
|
p02608 | s604333815 | Wrong Answer | def func(n):
cnt = 0
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
if x**2+y**2+z**3+x*y+y*z+z*x == n:
cnt += 1
return(cnt)
n = int(input())
for i in range(1, n+1):
print(func(i))
|
p02608 | s780344149 | Wrong Answer | n=int(input())
A=[0]*n
for i in range(3,int(n**0.5+150)):
for j in range(1,i-1):
for k in range(1,i-j):
if (x:=i*i-j*k-k*(l:=i-j-k)-l*j)<=n:
A[x-1]+=1
print(A[-30:-1]) |
p02608 | s739840509 | Wrong Answer | import itertools
import math
import collections
def func(x,y,z):
return x**2+y**2+z**2+x*y+y*z+z*x
n = int(input())
s = int(math.sqrt(n))
nums = list(range(1,s))
arr = []
com = list(itertools.product(nums, repeat=3))
for i in range(len(com)):
# print(com)
ans = func(com[i][0],com[i][1],com[i][2])
arr.append(ans)
c = collections.Counter(arr)
for i in range(n):
print(c[i]) |
p02608 | s916753526 | Wrong Answer | import itertools
n = int(input())
ans_d = {i: 0 for i in range(1,10087)}
p = itertools.product(range(1, 42), range(1, 42), range(1, 42))
for x, y, z in p:
cnt = (x ** 2) + (y ** 2) + (z ** 2) + (x * y) + (y * z) + (x * z)
ans_d[cnt] += 1
for i, j in ans_d.items():
print(j)
if i == n:
break |
p02608 | s460762891 | Wrong Answer | N = int(input())
L=[0]*N
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:
if x==y==z:
L[f-1]=1
else:
L[f-1]=3
for i in range(N):
print(L[i]) |
p02608 | s756348299 | Wrong Answer | from collections import Counter
n = int(input())
l = list()
for i in range(1,31):
l.append((i, i**2))
# print(l)
c = Counter()
for X in l:
for Y in l:
for Z in l:
x = X[0]
y = Y[0]
z = Z[0]
c[X[1]+Y[1]+Z[1]+x*y+y*z+x*z] += 1
for i in range(1, n+1):
print(c[i])
|
p02608 | s599486236 | Wrong Answer | n = int(input())
for i in range(1,n+1):
ans = 0
for x in range(50):
for y in range(50-x):
for z in range(50-x-y):
if (x+y+z)**2 -(x*y+y*z+z*x) == i and x>=1 and y>=1 and z>=1:
ans += 1
print(ans)
|
p02608 | s043164202 | Wrong Answer | n=int(input())
max_n=10**4+5
ans=[0]*(max_n)
for x in range(1,34):
for y in range(1,34):
for z in range(1,34):
total=x**2+y**2+z**2+x*y+y*z+z*x
if total<=max_n:
ans[total]+=1
for i in range(1,n+1):
print(ans[i])
|
p02608 | s837435527 | Wrong Answer | n = int(input())
f = [0] * (n + 1)
t = int(n ** .5) + 3
for i in range(1, t):
for j in range(1, t):
for k in range(1, t):
res = i ** 2 + j ** 2 + k ** 2 + i * j + j * k + k * i
if res <= n:
f[res] += 1
print('\n'.join(map(str, f)))
|
p02608 | s014356294 | Wrong Answer | import math
N=int(input())
ans=[0]*(N+1)
tempn=0
xmax=int(math.sqrt(N))+2
for x in range(1,xmax+2):
ymax=xmax-x
for y in range(1,ymax+1):
zmax=ymax-y
for z in range(1,zmax+1):
tempn=((x+y+z)**2-(x*y+y*z+z*x))
if tempn <= N:
ans[tempn]+=1
for i in range(1,(N+1)):
print(ans[i])
|
p02608 | s465724178 | Wrong Answer | N = int(input())
list=[0]*N
for x in range(1,N+1):
if x * x+2*x+3 > N:
break
for y in range(1,N+1):
if x * x + y * y + x * y+x+y+1 > N:
break
for z in range(1, N + 1):
val=x * x + y * y + z * z + x * y + y * z + z * x
if val >= N:
break
list[val - 1] += 1
for i in range(N):
print("{}".format(list[i]))
|
p02608 | s753664895 | Wrong Answer | N = int(input())
A = []
for i in range(1,46):
for j in range(1,46):
for k in range(1,46):
A.append(i**2+j**2+k**2+i*j+i*k+j*k)
A = sorted(A)
B = [0]*100000
for i in range(10000):
if A[i] < 10000:
B[A[i]] += 1
C = B[1:N+1]
[print(i) for i in C] |
p02608 | s678555991 | Wrong Answer | N = int(input())
a = [0]*(N+1)
for x in range(101):
for y in range(101):
for z in range(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 | s701046214 | Wrong Answer | N = int(input())
ans = [0] * 10000
for x in range(1, 1000):
for y in range(1, 1000):
for z in range(1, 1000):
f = x**2 + y**2 + z**2 + x*y + y*z + z*x
if f < 10000:
ans[f-1] = ans[f-1] + 1
if f > N:
break
for i in range(N):
print(ans[i]) |
p02608 | s369647845 | Wrong Answer | #C
n = int(input())
f = [0 for _ in range(10**5)]
for i in range(1,50):
for j in range(1,50):
for k in range(1,50):
f[i**2 + j**2 + k**2 + i*j + j*k + k*i] += 1
for l in range(n):
print(f[l+1]) |
p02608 | s732619953 | Wrong Answer | n=int(input())
ls=[0]*n
x=1
y=1
z=1
p=6
m=int(n**0.5)
for x in range(1,m):
for y in range(1,x+1):
for z in range(1,y+1):
k=3
if x==y and x==z:
k=1
j=x*x+y*y+z*z+x*y+y*z+x*z
if j<=n:
ls[j-1]+=k
else:
break
for i in ls:
print(i)
|
p02608 | s186251971 | Wrong Answer | n = int(input())
fn = [0] * (10**5)
def f(x, y, z):
return x**2 + y**2 + z**2 + x*y + y*z+ z*x
for x in range(1, 32):
for y in range(1, 32):
for z in range(1, 32):
idx = f(x, y, z)
fn[idx] += 1
for i in range(1, n+1):
print(fn[i])
|
p02608 | s043000268 | Wrong Answer | import numpy as np
N = int(input())
l = []
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
l.append(fn)
for i in range(N+1):
print(l.count(i))
|
p02608 | s166240828 | Wrong Answer | import math
N = int(input())
#Nは6以上
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 | s279110478 | Wrong Answer | N=int(input())
for i in range(N):
count=0
k=i//5+1
for x in range(k):
if(x==0):
continue
for y in range(k):
if(y==0):
continue
for z in range(k):
if(z==0):
continue
if((x+y)**2+(y+z)**2+(z+x)**2)//2==i:
#print(x,y,z)
count+=1
print(count) |
p02608 | s493420894 | Wrong Answer | n = int(input())
ans = 0
ans1 = [0] * n
for i in range(1,n):
for j in range(1,n):
for k in range(1,n):
ans = i**2 + j**2 +k**2 + i*j + j*k + k*i
for l in range(6,n-1):
if(l+1 == ans):
ans1[l] += 1
for i in range(n):
print(ans1[i]) |
p02608 | s630524053 | Wrong Answer | import math
N=int(input())
count=[0]*(N+1)
for i in range(N):
for x in range(1,int(math.sqrt(N+1)/3)):
for y in range(1,int(math.sqrt(N+1)/3)):
for z in range(1,int(math.sqrt(N+1)/3)):
if(x**2+y**2+z**2+x*y+y*z+z*x==i):
count[i]+=1
for j in range(1,N+1):
print(count[j]) |
p02608 | s979656497 | Wrong Answer | N = int(input())
a = [0]* N
x = [i for i in range(1,43)]
y = [i for i in range(1,43)]
z = [i for i in range(1,43)]
ans = []
for i in x:
for j in y:
for k in z:
t = (i**2+j**2+k**2+i*j+j*k+k*i)
if t <= N:
a[t-1] += 1
for i in range(N):
print(a[i]) |
p02608 | s733953203 | Wrong Answer | import math
n = int(input())
for i in range(1, 6):
print(0)
for i in range(6, n+1):
x = int(math.sqrt(i)) + 1
ans = 0
for j in range(1, x):
for f in range(1, x):
for k in range(1, x):
if (j + f + k) ** 2 - j*f - j*k - f*k == i:
ans += 1
print(ans) |
p02608 | s255969840 | Wrong Answer | n = int(input())
count =[0] * n
for f in range(1,n+1):
for x in range(1, f//5):
for y in range(1, f//5):
for z in range(1, f//5):
if(x*x+y*y+z*z+x*y+y*z+z*x == f):
count[f-1]+=1
for i in range(n):
print(count[i])
|
p02608 | s494095630 | Wrong Answer | n = int(input())
for i in range(1,n+1):
ans = 0
for x in range(35):
for y in range(35):
for z in range(35):
if (x+y+z)**2 -(x*y+y*z+z*x) == i and x>=1 and y>=1 and z>=1:
ans += 1
print(ans)
|
p02608 | s425258302 | Wrong Answer | n = int(input())
ans = [0]*n
for x in range(1,int(n**.5)+1):
for y in range(1,int(n**.5)+1):
for z in range(1,int(n**.5)+1):
a = x*x+y*y+z*z+x*y+y*z+z*x
if a < n:
ans[a] += 1
for i in range(n):
print(ans[i]) |
p02608 | s733320593 | Wrong Answer | n = int(input())
f = [0]*21600
for x in range(1,60):
for y in range(1,60):
for z in range(1,60):
f[x**2+y**2+z**2+x*y+y*z+z*x-1]+=1
for i in range(n):
print(f[i]) |
p02608 | s042250206 | Wrong Answer | n=int(input())
ls=[0]*n
x=1
y=1
z=1
p=6
m=int(n**0.5)
for x in range(1,m+3):
for y in range(1,x+1):
for z in range(1,y+1):
k=6
if x==y:
k=3
if x==z:
k=1
j=x*x+y*y+z*z+x*y+y*z+x*z
if j<=n:
ls[j-1]+=k
else:
break
for i in ls:
print(i) |
p02608 | s746525156 | Wrong Answer | import math
n=int(input())
ans=[0]*(10**5)
for x in range(int(math.sqrt(n))+1):
for y in range(int(math.sqrt(n))+1):
for z in range(int(math.sqrt(n))+1):
ans[((x+y)**2+(y+z)**2+(z+x)**2)//2-1]+=1
for i in range(n):
print(ans[i]) |
p02608 | s993857987 | Wrong Answer | n = int(input())
ans = [0] * 10001
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:
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 | s240108398 | 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 | s285948032 | Wrong Answer | 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):
tmp = x**2 + y**2 + z**2 + x*y + y*z + z*x
#print(x, y, z, tmp)
if 1 <= tmp and tmp <= n+1:
ans[tmp] += 1
for i in range(1, n+1):
print(ans[i]) |
p02608 | s455571800 | Wrong Answer | #C
import math
N = int(input())
count = [0] * (10010)
for j in range(1, 100):
for k in range(1, 100):
for l in range(1, 100):
v = (j+k+l) ** 2 - (j*k + k*l + l*j)
if v <= 10000:
count[v] += 1
for i in range(1, N):
print(count[i]) |
p02608 | s898998826 | Wrong Answer | def fx(n):
cnt = 0
for i in range(1,10000):
if (i+1+1)**2 - i*1 - 1*1 - 1*i > n: break
for j in range(1, 10000):
if (1+j+1)**2 - 1*j - j*1 - 1*1 > n : break
for k in range(1, 10000):
formula = (i+j+k)**2 - i*j - j*k - k*i
if formula == n:
cnt+=1
if formula >= n:
break
return cnt
n = int(input())
for i in range(1,n):
print(fx(i))
|
p02608 | s243100921 | Wrong Answer | t = int(input())
for i in range(t):
if i < 6:
print(0)
else:
tmp = i - 3
num = 0
for x in range(tmp):
x += 1
for y in range(tmp-x):
y += 1
for z in range(tmp-x-y):
z += 1
if i == x**2 + y**2 + z**2 + x*y + x*z + y*z:
num += 1
print(num) |
p02608 | s353541041 | Wrong Answer | n = int(input())
ans = [0]*(n+5)
for x in range(1,10):
for y in range(1,10):
for z in range(1,10):
temp = x**2 + y**2 + z**2 + x*y + y*z + z*x
if n>=temp:
print(x,y,z, temp)
ans[temp]+=1
for i in range(1,n+1):
print(ans[i])
|
p02608 | s809408132 | Wrong Answer | import itertools
N = int(input())
for n in range(1,N+1):
cnt = 0
for x,y in itertools.product(list(range(n)),repeat=2):
z = n - x - y
if n == x*x + y*y +z*z + x*y + y*z + z*x:
cnt += 1
print(cnt) |
p02608 | s988045401 | Wrong Answer | n = int(input())
ans = [0]*(10**4+1)
for x in range(10**2+1):
for y in range(10**2+1):
for z in range(10**2+1):
i = x*x + y*y + z*z + x*y + x*z + y*z
if i <= 10**4:
ans[i] += 1
else:
break
for i in range(1,n+1):
print(ans[i]) |
p02608 | s395843367 | Wrong Answer | import math
n = int(input())
max = int(math.sqrt(n) + 1)
L = [0] * (n + 1)
for x in range(1, max):
for y in range(1, max):
for z in range(1, max):
tmp = x * x + y * y + z * z + x * y + y * z + z * x
if tmp > n:
continue
L[tmp] += 1
for i in range(1, n):
print(L[i]) |
p02608 | s260155720 | Wrong Answer | from collections import defaultdict
N = int(input())
def fun(x, y, z):
return x**2 + y**2 + z**2 + x*y + y*z + z*x
res = defaultdict(int)
for x in range(1, 50):
for y in range(1, 50):
for z in range(1, 50):
res[fun(x, y, z)] += 1
for n in range(1, N+1):
print(res[n]) |
p02608 | s907824084 | Wrong Answer | def main():
n = int(input())
f = [0 for i in range(n+1)]
Max = n**0.5
Max = int(Max//1)
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+x*z
if tmp<n:
f[tmp] += 1
for i in range(1,n+1):
print(f[i])
main() |
p02608 | s627363204 | Wrong Answer | n = int(input())
for i in range(n):
if i < 6:
print(0)
else:
count=0
for j in range(100):
for k in range(100):
for l in range(100):
if ((j+1)**2 + (k+1)**2 + (l+1)**2 + (j+1)*(k+1) +(k+1)*(l+1) +(l+1)*(j+1)) == i:
count +=1
print(count) |
p02608 | s106584193 | Wrong Answer | from math import sqrt
l = [-1]+[0]*10**4
n = int(input())
for i in range(1,int(sqrt(n))+2):
for j in range(1,int(sqrt(n))+2):
for k in range(1,int(sqrt(n))+2):
ans = i**2+j**2+k**2+i*j+j*k+k*i
if ans <= 10*4:
l[ans] += 1
for i in range(1,n+1):
print(l[i]) |
p02608 | s352506417 | Wrong Answer | n = int(input())
fn = [0] * (10**5)
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)
if idx <= n:
fn[idx] += 1
for i in range(1, n+1):
print(fn[i])
|
p02608 | s525904874 | Wrong Answer | n=int(input())
for i in range(n+1):
ans=0
for x in range(i):
for y in range(i):
for z in range(i):
if i==x*x+y*y+z*z+x*y+x*z+y*z:
ans+=1
print(ans) |
p02608 | s358995962 | Wrong Answer | N = int(input())
ans = list()
for i in range(N+1):
ans.append(0)
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 < N:
ans[tmp] += 1
for i in range(N):
print(ans[i+1]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.