problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02608 | s841042867 | Wrong Answer | import math
n = int(input())
count = 0
for i in range (1,n):
for x in range (1,n):
for y in range (1,n):
for z in range (1,n):
if x*x + y*y + z*z + x*y + y*z + z*x == i:
count = count + 1
count = 0
print(count)
|
p02608 | s702895417 | Wrong Answer | import itertools
n = int(input())
cnt = [0] * (10 ** 4 + 1)
for x, y, z in itertools.product(range(1, 10 ** 2), repeat=3):
idx = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if idx <= 10 ** 4:
cnt[idx] += 1
for num in cnt[1:]:
print(num)
|
p02608 | s621316538 | Wrong Answer | from math import sqrt
n = int(input())
for I in range(1, n+1):
c = 0
a = int(sqrt(I))
for i in range(1, a-2-2*a):
for j in range(1, a-2-2*a):
for k in range(1, a-2-2*a):
if i**2 + j**2 + k**2 + i*j + j*k + k*i == I:
c += 1
print(c) |
p02608 | s108545567 | Wrong Answer |
n = int(input())
for i in range(n):
count = 0
for x in range(1,i//3+1):
for y in range(1, i//3+1):
for z in range(1,i//3+1):
if x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x > i:
break
elif x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x == i:
count += 1
print(count) |
p02608 | s125464549 | Wrong Answer | n=int(input())
ans=0
for N in range(1,n+1):
for i in range(1,2*10**2+1):
for j in range(1,2*10**2+1):
for k in range(1,2*10**2+1):
if (i+j)**2+(j+k)**2+(k+i)**2==2*N:
ans+=1
print(ans)
|
p02608 | s496462396 | Wrong Answer | from itertools import product
N = int(input())
cnt = [0]*1000000
for x in range(1,21):
for y in range(1,21):
for z in range(1,21):
cnt[x**2 + y**2 + z**2 + x*y + y*z + z*x -1] += 1
for i in range(N):
print(cnt[i])
|
p02608 | s670350549 | Wrong Answer | n = int(input())
ans = 0
ans1 = [0] * 10000
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
if(ans < 10000):
ans1[ans] += 1
for i in range(n):
print(ans1[i]) |
p02608 | s302843038 | Wrong Answer | N = int(input())
for n in range(1, N+1):
for x in range(1, 10**2):
for y in range(1, 10**2):
answer = 0
if 3* x**2 + y**2 + 2*x*y == n:
num_pair = [x, y]
if num_pair[0] == num_pair[1]:
answer = 1
break
else:
answer = 3
break
break
print(answer) |
p02608 | s833175402 | Wrong Answer | from collections import defaultdict
ans = defaultdict(int)
N = int(input())
for i in range(1, N):
for j in range(1, N):
for k in range(1, N):
ans[i*i+j*j+k*k+i*j+j*k+k*i] += 1
for i in range(N):
print(ans[i])
|
p02608 | s631070599 | Wrong Answer | N = int(input())
a = [0 for x in range(N)]
for i in range(1,N+1):
for j in range(1,N+1):
for k in range(1,N+1):
n = i*i+j*j+k*k+i*j+j*k+i*k
if n <= N:
a[n] += 1
for i in range(N):
print(a[i])
|
p02608 | s621854007 | Wrong Answer | import math
N = int(input())
for i in range(1, N+1):
cnt = 0
if i < 6:
print(0)
for x in range(1, int(math.sqrt(i))):
for y in range(1, int(math.sqrt(i))):
for z in range(1, int(math.sqrt(i))):
if ((x+y+z)**2)-x*y-y*z-z*x == i:
cnt += 1
print(cnt) |
p02608 | s543912750 | Wrong Answer | N = int(input())
ans = 0
tmp = []
for i in range(1,10):
for j in range(1,10):
for h in range(1,10):
num = i*i + j*j + h*h + i*j + j*h +h*i
tmp.append(num)
num = 0
tmp.sort()
for i in range(1,N+1):
print(tmp.count(i))
|
p02608 | s786176281 | Wrong Answer | N=int(input())
a=[0]*N
x=1
while x<N:
y=1
while x*x+y*y+x*y<N:
z=1
while z*z+x*x+y*y+x*y+z*y+z*x<N:
a[z*z+x*x+y*y+x*y+z*y+z*x]+=1
z+=1
y+=1
x+=1
for n in a:
print(n)
|
p02608 | s405129180 | Wrong Answer | import math
n = int(input())
ans = 0
for i in range(1,n+1):
r = math.floor(math.sqrt(i))
for x in range(1,r+1):
for y in range(x,r+1):
for z in range(y,r+1):
if x**2 + y**2 + z**2 + x*y + y*z + z*x == i:
if x == y and y == z:
ans += 1
elif x == y or y == z or z == x:
ans += 3
else:
ans += 6
print(i,ans)
ans = 0 |
p02608 | s866540714 | Wrong Answer | from collections import defaultdict
import math
n=int(input())
d=defaultdict(int)
if n>2:
m=int(math.sqrt(n))
for l in range(3,m+2):
for i in range(1,l-1):
for j in range(1,l-i):
k=l-i-j
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 | s724899222 | Wrong Answer | N = int(input())
ans = [0]*(N+1)
for x in range(1,46):
for y in range(1,46):
for z in range(1,46):
tmp = x**2 + y**2 + z**2 +x*y + y*z + z*x
if tmp > N:
continue
ans[tmp]+=1
for i in range(1,N+1):
print(ans[i]) |
p02608 | s643705796 | 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=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 | s050577942 | Wrong Answer | from itertools import combinations_with_replacement
N = int(input())
ans = [0] * (N + 1)
for x, y, z in combinations_with_replacement(list(range(1, 50)), 3):
val = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + x * z
n_diff = len(set([x, y, z]))
if n_diff == 3:
cnt = 6
if n_diff == 2:
cnt = 3
if n_diff == 1:
cnt = 1
# print(val)
if val <= N:
ans[val] += cnt
print('\n'.join(map(str, ans[1:])))
|
p02608 | s088426996 | Wrong Answer | N = int(input())
x, y, z = 1,1,1
ans_dict = {}
for x in range(1,110):
for y in range(1,110-x):
for z in range(1,110-x-y):
ans = (x + y)**2 + (y + z)**2 + (z + x)**2
if ans in ans_dict:
ans_dict[ans] += 1
else:
ans_dict[ans] = 1
for n in range(1, N+1):
if 2*n in ans_dict:
print(ans_dict[2*n])
else:
print(0)
|
p02608 | s507232985 | Wrong Answer | N = int(input())
L=[0]*N
for x in range(1,150):
for y in range(x,150):
for z in range(y,150):
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 | s631798832 | Wrong Answer | import math
n = int(input())
for i in range(n):
cnt = 0
for x in range(1,n):
for y in range(1,n):
b = x + y
c = x**2+y**2+x*y-i
buf = b**2-4*c
if buf >= 0:
z = -b + math.sqrt(buf)
if z.is_integer() and z > 0:
cnt += 1
print(cnt) |
p02608 | s462239965 | Wrong Answer | n = int(input())
for i in range(n):
ans=0
for j in range(1,101):
for k in range(1,101):
if j * j + j * j + k * k + j * j + j * k + k * j == i+1:
if j!=k:
ans += 3
else:
ans += 1
print(ans) |
p02608 | s252303963 | Wrong Answer | #!/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
for i in range(N):
print(ans[i])
if __name__ == "__main__":
main()
|
p02608 | s880470773 | Wrong Answer | N = int(input())
ans = [0]*(N+1)
print(ans)
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
num = x*x + y*y + z*z + x*y + y*z + z*x
if num>N:
break
ans[num] = ans[num] + 1
for m in ans:
print(m)
|
p02608 | s824212283 | Wrong Answer | import math
import itertools
import sys
input = sys.stdin.readline
def f(x, y, z):
return x**2+y**2+z**2+x*y+y*z+z*x
N = int(input())
NL = []
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
NL.append(f(x, y, z))
for i in range(1, N):
print(NL.count(i))
|
p02608 | s644215343 | Wrong Answer | n = int(input())
for i in range(1,n+1):
ans = 0
for x in range(37):
for y in range(37):
for z in range(37):
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 | s764495838 | Wrong Answer | def main():
n = int(input())
for i in range(n):
calc(i)
def calc(n):
count = 0
for x in range(1, n + 1):
for y in range(1, n + 1):
for z in range(1, n + 1):
if x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x == n:
count += 1
print(count)
return
if __name__ == '__main__':
main()
|
p02608 | s102023611 | Wrong Answer | import sys
import itertools
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
# n = 1700 ** 0.5
# print(n)
l = [0]*(10**5)
for x in range(1, 50):
for y in range(1, 50):
for z in range(1, 50):
i = x ** 2 + y ** 2 + z ** 2 + x*y + y*z + z*x
l[i] += 1
for j in range(1, n+1):
print(l[j])
|
p02608 | s645398406 | Wrong Answer | N = int(input())
ans = [0] * 10000
for x in range(1, 1105):
for y in range(1, 1105):
for z in range(1, 1105):
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 | s320835584 | Wrong Answer | N = int(input())
cnt = 0
for i in range(1, N+1):
for x in range(100):
for y in range(100):
for z in range(100):
if (x+y)^2 + (y+z)^2 + (z+x)^2 == 2*i:
cnt += 1
print(cnt) |
p02608 | s034690859 | 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 | s388405811 | Wrong Answer | n=int(input())
def f(i):
co=0
for z in range(1,5):
for y in range(1,5):
for x in range(1,5):
if x**2+y**2+z**2+z*y+z*x+y*x==i:
co+=1
return co
for i in range(1,n+1):
co=f(i)
print(co) |
p02608 | s891576778 | Wrong Answer | n = int(input())
for i in range(1, n+1):
cnt = 0
for x in range(1, 31):
for y in range(1, 31):
for z in range(1, 31):
if i == ((x+y+z)**2 - z*(x+y) - (x*y)):
cnt += 1
print(cnt) |
p02608 | s933826798 | Wrong Answer | N = int(input())
ans = [0]*(N+1)
for i in range(1, int(N**0.5)+1):
for j in range(1, 101 - i):
for k in range(1, 101 - i - j):
f = i*i + j*j + k*k +i*j + j*k + k*i
if f <= N:
ans[f] += 1
print(*ans[1:], sep='\n')
|
p02608 | s171887972 | Wrong Answer | N=int(input())
for n in range(N):
ans = 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**2+j**2+k**2+i*j+j*k+k*i==n:
ans += 1
print(ans)
|
p02608 | s420928388 | Wrong Answer | from itertools import combinations_with_replacement
N = int(input())
choise = [1]
for i in range(1,N+1):
if (choise[-1]*6) < i:
choise.append(choise[-1]+1)
for j in combinations_with_replacement(choise,3):
n = j[0]**2+j[1]**2+j[2]**2+j[0]*j[1]+j[1]*j[2]+j[0]*j[2]
if n == i:
if j[0]==j[1] and j[1]==j[2]:print(1)
else:print(3)
break
|
p02608 | s778758395 | Wrong Answer | N=int(input())
sum=[0]*N
for x in range(1,N):
for y in range(1,N):
for z in range(1,N):
a=x*x+y*y+z*z+x*y+y*z+x*z
if a<=N:
sum[a-1]=sum[a-1]+1
for i in range(N):
print(sum[i-1]) |
p02608 | s237054997 | Wrong Answer | import math
n = int(input())
cnts = [0] * (n + 1)
for s in range(int(math.sqrt(n)) + 1 + 1):
for x in range(1, s + 1):
for y in range(1, s - x + 1):
z = s - x - y
if 1 <= z:
f = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if 1 <= f <= n:
cnts[f] += 1
for i in range(1, n + 1):
print(cnts[i])
|
p02608 | s582209181 | Wrong Answer | N = int(input())
ans = [0]*(N+1)
for i in range(1, int(N**0.5)+1):
for j in range(1, 101 - i):
for k in range(1, 101 - i - j):
f = i*i + j*j + k*k +i*j + j*k + k*i
if f <= N:
ans[f] += 1
print(*ans, sep='\n')
|
p02608 | s761016803 | Wrong Answer | import math
n=int(input())
z=0
d=0
ans=0
for i in range(1,n+1):
for x in range(1,int(math.sqrt(n)+1)):
d=4*x*x-4*(3*x*x-i)
if d<0:
continue
z=(math.sqrt(d)-2*x)/2
if z.is_integer():
if x==int(z) and int(z)>=1:
ans+=1
continue
elif int(z)>=1:
ans+=3
continue
else:
continue
print(ans)
ans=0 |
p02608 | s245286191 | Wrong Answer | import math
import sys
N = int(sys.stdin.readline())
for i in range(1,N+1):
ans = 0
n = math.ceil(math.sqrt(i))
for j in range(1,n):
wan = n - j
for k in range(1,wan):
n_sub = i -j*j - k*(j + k)
if n_sub <= 0:
break
b = j + k
check = ((b**2 + 4*n_sub) ** (1/2) - b)
if check % 2 == 0:
ans +=1
break
print(ans)
|
p02608 | s290552975 | Wrong Answer | from itertools import product
n = int(input())
pro = product([x for x in range(1,5)],repeat=3)
lst = [0]*n
for p in pro:
for i in range(1,n+1):
if ((p[0]**2) + (p[1]**2) + (p[2]**2) + (p[0]*p[1]) + (p[1]*p[2]) + (p[2]*p[0])) == i:
lst[i-1]+=1
for i in lst:
print(i) |
p02608 | s542166380 | Wrong Answer | #C
n = int(input())
f = [0 for _ in range(10**5)]
for i in range(1,60):
for j in range(1,60):
for k in range(1,60):
f[i**2 + j**2 + k**2 + i*j + j*k + k*i] += 1
for l in range(n):
print(f[l+1]) |
p02608 | s543041511 | Wrong Answer | 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):
v = x * x + y * y + z * z + x * y + y * z + z * x
if v > N:
continue
ans[v] += 1
for i in range(N):
print(ans[i]) |
p02608 | s482904758 | Wrong Answer | #!/usr/bin/env python3
import math
n = int(input())
result = [0] * (n + 1)
border = int(math.sqrt(n) / 2) + 1 + 1
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 | s754631381 | Wrong Answer | def main():
n = int(input())
res = [0]*(n+1)
for i in range(1,33):
for j in range(1,33):
for k in range(1,33):
if(i**2 + j**2 + k**2 + i*j + j*k + k*i<=n):
res[i**2 + j**2 + k**2 +i*j+j*k + k*i]+=1
for i in range(1,n+1):
print(res[i])
if __name__ == '__main__':
main()
|
p02608 | s573803987 | Wrong Answer | #! python3
# coding:utf-8
def main():
n = int(input())
ans = [0 for _ in range(n)]
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]+=1
print(ans)
for i in range(len(ans)):
print(i,ans[i])
if __name__ == "__main__":
main() |
p02608 | s956185344 | Wrong Answer | def main():
n = int(input())
f = [0 for i in range(n+1)]
Max = n**0.5
Max = int(Max//1) +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 | s638346988 | Wrong Answer | N = int(input())
cnt = 0
for i in range(1, N+1):
for x in range(10):
for y in range(10):
for z in range(10):
if (x+y)^2 + (y+z)^2 + (z+x)^2 == 2*i:
cnt += 1
print(cnt) |
p02608 | s060389231 | Wrong Answer | N=1000
for i in range(N):
ret=0
x=1
y=1
z=1
while x*x+y*y+z*z+x*y+y*z+z*x <= i:
if x*x+y*y+z*z+x*y+y*z+z*x==i:
ret=ret+1
if x==y:
x+=1
elif y==z:
y+=1
else :
z+=1
print(ret)
|
p02608 | s165220622 | Wrong Answer | ### Problem C
import math
N = int(input())
rt = []
for i in range(1,N+1):
if i <= 3000:
rt.append(int(math.sqrt(i)))
elif i > 3000:
rt.append(int(math.sqrt(i)/1.4))
for x in range(0,N):
cnt = 0
for i in range(1,rt[x]):
for j in range(1,rt[x]):
for k in range(1,rt[x]):
if (i + j + k)**2 == x + (i*j + j*k + k*i):
cnt += 1
print(cnt) |
p02608 | s729555243 | Wrong Answer | import itertools
n = int(input())
N = 1
while N**2 < n:
N += 1
if N ** 2 > n: N-=1
ans = [0] * n
for x,y,z in itertools.combinations_with_replacement(list(range(1,N+1)), 3):
a = x**2+y**2+z**2 + x*y+y*z+z*x
if a > n: continue
if x==y==z: b = 1
elif x==y or x==z or y==z: b = 3
elif x!=y and y!=z and x!=z: b = 6
ans[a-1] = b
for i in ans: print(i) |
p02608 | s641270830 | Wrong Answer | from collections import defaultdict
n = int(input())
res = defaultdict(int)
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
res[v] += 1
for i in range(n):
print(res.get(i, 0))
|
p02608 | s441674006 | 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)
if i==j: record[sum] += 1
else: record[sum] += 3
for num in record[1:N+1]:
print(num) |
p02608 | s708255260 | Wrong Answer | N = int(input())
keys = [i for i in range(1, N+1)]
values = [0] * N
count_dict = dict(zip(keys, values))
for x in range(1, N//6+7):
for y in range(x, N//6+7):
for z in range(y, N//6+7):
n = x**2 + y**2 + z**2 + x*y + y*z + z*x
if n > N:
break
count_dict[n] += 3
if x == y and y == z:
count_dict[n] -= 2
for v in count_dict.values():
print(v) |
p02608 | s059513893 | Wrong Answer | def f(n):
cnt = 0
for x in range(1,5):
for y in range(1, 5):
for z in range(1,5):
if (((x**2 )+(y**2) +(z**2) +x*y +y*z+ z*x)) == n:
cnt += 1
return cnt
N=int(input())
for i in range(1,N+1):
print(f(i)) |
p02608 | s522710104 | Wrong Answer | from collections import defaultdict
n = int(input())
d = defaultdict(int)
for i in range(1, 33):
for j in range(1, 33):
for k in range(1, 33):
d[i ** 2 + j ** 2 + k ** 2 + i * j + j * k + i * k] += 1
for i in range(n):
print(d[i + 1]) |
p02608 | s913907787 | Wrong Answer | from itertools import product
from math import *
N = int(input())
pro = list(product(range(1, int(sqrt(N))), repeat=3))
for i in range(1, N+1):
ans = 0
for j in range(len(pro)):
x = pro[j][0]; y = pro[j][1]; z = pro[j][2]
if x*x + y*y + z*z + x*y + y*z + z*x == i:
ans += 1
print(ans)
print(pro, len(pro))
|
p02608 | s377415813 | Wrong Answer | N=int(input())
for i in range(1, N+1, 1):
print(len([[x,y,z] for x in range(1,(i+1)%6,1) for y in range(1,i-x*x,1) for z in range(1,i-x*x-y*y-x*y,1) if x*x+y*y+z*z+x*y+y*z+z*x == i]))
|
p02608 | s479468954 | Wrong Answer | 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, 10):
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 | s911524560 | Wrong Answer | from math import sqrt
from math import floor
n = int(input())
for i in range(n + 1):
n2 = floor(sqrt(i))
ans = 0
for x in range(1, n2):
for y in range(1, n2):
for z in range(1, n2):
if i == pow(x, 2) + pow(y, 2) + pow(z, 2) + x * y + y * z + z * x:
ans += 1
print(ans)
|
p02608 | s649599701 | Wrong Answer | n = int(input())
from itertools import product
l = list(range(1, 100+1))
f = [0 for _ in range(11000)]
def func(x,y,z):
return x**2 + y**2 + z**2 + x*y + y*z + z*x
for x, y, z in product(l, l, l):
v = func(x,y,z)
if v <= n:
f[v] += 1
for ans in f[:n+1]:
print(ans)
|
p02608 | s658205999 | Wrong Answer | N = int(input())
ans = [0] * N
sqrt_N = (int(N**0.5 + 1))
for x in range(1,sqrt_N):
for y in range(1,sqrt_N):
for z in range(1,sqrt_N):
print(x,y,z)
xyz = (x**2)+(y**2)+(z**2)+(x*y)+(y*z)+(z*x)
if xyz <= N:
ans[xyz - 1] = ans[xyz - 1] + 1
[print(i) for i in ans] |
p02608 | s158938174 | Wrong Answer | import math
n = int(input())
ans = [0 for _ in range(10001)]
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 < 10000:
ans[t] += 1
for i in range(1,n+1):
print(ans[i]) |
p02608 | s837551461 | Wrong Answer | N = int(input().strip())
s=[]
n=int(N**(0.3537))
for a in range (1,n+2):
for b in range(1,n+2):
for c in range(1,n+2):
s.append(a*a+b*b+c*c+a*b+b*c+c*a)
s.sort()
for l in range(1,N+1):
print(s.count(l))
|
p02608 | s839683901 | Wrong Answer | import math
n=int(input())
z=0
d=0
ans=0
for i in range(1,n+1):
for x in range(1,int(math.sqrt(n))):
d=4*x*x-4*(3*x*x-i)
if d<0:
continue
z=(math.sqrt(d)-2*x)/2
if z.is_integer():
if x==int(z) and int(z)>=1:
ans+=1
continue
elif int(z)>=1:
ans+=3
continue
else:
continue
print(ans)
ans=0 |
p02608 | s368859156 | Wrong Answer | N = int(input())
ans = [0]*(N+1)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
n = pow(x,2) + pow(y,2) + pow(z,2) + x*y + y*z + z*x
if n <= N:
ans[n] += 1
for i in range(1,N):
print(ans[i]) |
p02608 | s803575934 | Wrong Answer | import math
def main():
N = int(input())
ans = [0]*(N+1)
rn = math.ceil(math.sqrt(N))
for x in range(1,rn):
for y in range(1,rn):
for z in range(1,rn):
k = x**2 + y**2 + z**2 + x*y + y*z + z*x
if k <= N:
ans[k] += 1
for i in range(len(ans)):
print(ans[i])
main() |
p02608 | s975388065 | Wrong Answer | n=int(input())
ch=[0]*10001
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
x=i**2+j**2+k**2+i*j+j*k+k*i
if x<10000:
ch[x]+=1
for i in range(n):
print(ch[i+1]) |
p02608 | s701464954 | Wrong Answer | N = int(input())
ans = list()
for i in range(N+1):
ans.append(0)
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 < N:
ans[tmp] += 1
for i in range(N):
print(ans[i+1]) |
p02608 | s979780180 | Wrong Answer | from itertools import combinations_with_replacement
n = int(input())
for i in range(1, n+1):
ans = 0
for v in combinations_with_replacement(range(1, 22), 3):
x, y, z = v
if x**2 + y**2 + z**2 + x*y + y*z + z*x == i:
if x == y == z:
ans = 1
else:
ans = 3
break
print(ans) |
p02608 | s309977802 | Wrong Answer | n = int(input())
ans = []
for i in range(1, n + 1):
cnt = 0
for x in range(1, 50):
for y in range(x, 50):
for z in range(y, 50):
if (x + y) ** 2 + (y + z) ** 2 + (z + x) ** 2 == i * 2:
if (x == y and y != z) or (x != y and y == z) or (z == x and z != y):
cnt += 3
elif x == y == z:
cnt += 1
else:
cnt += 6
ans.append(cnt)
for j in range(n):
print(ans[j]) |
p02608 | s226666984 | Wrong Answer | 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*x+x*z
if v>n:
break
ans[v-1]+=1
print(*ans) |
p02608 | s647325784 | Wrong Answer | n = 20
answer_list = []
for x in range(1, 99, 1):
for y in range(1, 99, 1):
for z in range(1, 99, 1):
formula = (x+y+z)**2 - (x*y + y*z + z*x)
if formula >= n:
continue
else:
answer_list.append(formula)
answer_list = sorted(answer_list)
for i in range(0, n, 1):
print(answer_list.count(i)) |
p02608 | s175081936 | Wrong Answer | N = int(input())
cnt = 0
for n in range(1,N+1):
for z in range(1,36):
for y in range(1,36):
for x in range(1,36):
if x*x+y*y+z*z+x*y+y*z+z*x == n:
cnt +=1
print(cnt)
cnt=0
|
p02608 | s281618626 | Wrong Answer | n = int(input())
ANS = [0] * (n+1)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
tmp = (x + y + z)**2 - z*(x + y) - (x*y)
if tmp > n: continue
ANS[tmp] += 1
for ans in ANS:
print(ans) |
p02608 | s331309763 | Wrong Answer | n = int(input())
ans = []
for i in range(1, n + 1):
cnt = 0
for x in range(1, 50):
for y in range(x, 50):
for z in range(y, 50):
if (x + y) ** 2 + (y + z) ** 2 + (z + x) ** 2 == i * 2:
if (x == y and y != z) or (x != y and y == z):
cnt += 3
elif x == y == z:
cnt += 1
else:
cnt += 6
ans.append(cnt)
for j in range(n):
print(ans[j]) |
p02608 | s352748009 | Wrong Answer | import numpy as np
n = int(input())
res = [0]*(n+1)
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
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):
print(res[i])
|
p02608 | s591354386 | Wrong Answer | N = int(input())
ans = [0]*N
n = int((N)**(0.5))+1
for x in range(1, n):
for y in range(1, n):
for z in range(1, n):
i = x**2+y**2+z**2+x*y+x*z+y*z
if i > N-1:
break
else:
ans[i-1] += 1
for a in ans:
print(a) |
p02608 | s938378919 | Wrong Answer | n = int(input())
for l in range(n):
c=0
for i in range(n):
for j in range(n):
for k in range(n):
if i>=1 and j>=1 and k>=1:
m = i*i+j*j+k*k+i*j+j*k+k*i
if m == l:
c += 1
print(c) |
p02608 | s457729611 | Wrong Answer | N = int(input())
d={}
for a in range(100):
for b in range(100):
z=(a+1)**2+(b+1)**2+(a+1)*(b+1)
for c in range(100):
gokei=z+(c+a+3+b)*(c+1)
if gokei in d:
d[gokei]+=1
else:
d[gokei]=1
for i in range(N):
if i in d:
print(d[i])
else:
print(0)
|
p02608 | s062269757 | Wrong Answer | n = int(input())
a = [0] * 10010
# x,y,z
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
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(n):
print(a[i])
|
p02608 | s552829139 | Wrong Answer | ans_list = []
for x in range(1, 9):
for y in range(1, 9):
for z in range(1, 9):
tmp = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if tmp <= 100:
ans_list.append(tmp)
N = int(input())
ans_list = sorted(ans_list)
ans_set = set(ans_list)
for i in range(1, N + 1):
if i in ans_set:
print(ans_list.count(i))
else:
print(0)
|
p02608 | s881911776 | Wrong Answer | N=int(input())
Z=[0]*10005
for i in range(1,102):
for j in range(1,102):
for k in range(1,102):
n=i**2+j**2+k**2+i*j+j*k+k*i
if n<=N:
Z[n]+=1
for i in range(N+1):
print(Z[i]) |
p02608 | s419706159 | Wrong Answer | N = int(input())
for n in range(N+1):
cnt=0
x=x2=1
while x2<=n:
y=y2=1
while x2+y2+(x*y)<=n:
z=z2=1
while x2+y2+z2+(x*y)+(x*z)+(y*z)<=n:
if x2+y2+z2+(x*y)+(x*z)+(y*z)==n:
cnt+=1
z+=1
z2=z**2
y+=1
y2=y**2
x+=1
x2=x**2
print(cnt) |
p02608 | s885841813 | Wrong Answer | n=int(input())
ans=0
for N in range(1,n+1):
for i in range(1,10**2+1):
for j in range(1,10**2+1):
for k in range(1,10**2+1):
if (i+j)**2+(j+k)**2+(k+i)**2==2*N:
ans+=1
print(ans) |
p02608 | s252214372 | Wrong Answer | n = int(input())
cnt = [0]*(10**4+1)
for i in range(1,50):
for j in range(1,50):
for k in range(1,50):
v = (i**2)+(j**2)+(k**2)+i*j+j*k+k*i
if v<10**4:
cnt[v] += 1
for i in range(1,n+1):
print(cnt[i]) |
p02608 | s900720355 | Wrong Answer | N = int(input())
dp = [0 for _ in range(N+1)]
for x in range(1,int(N**0.5)+1):
if x * x > N:
continue
for y in range(1,int(N**0.5)+1):
if x * x + y * y + x * x > N:
continue
for z in range(1,int(N**0.5)+1):
t = x * x + y * y + z * z + x * y + y * z + z * x
if t <= N:
dp[t] += 1
for i in range(1,N+1):
print(dp[i]) |
p02608 | s541667386 | Wrong Answer | n = int(input())
ans = [0 for i in range(n)]
for i in range(1,n+1):
for x in range(1,33):
for y in range(1,33):
for z in range(1,33):
if x**2+y**2+z**2+x*y+y*z+z*x == i:
ans[i-1]+=1
for i in ans:
print(i) |
p02608 | s665353809 | Wrong Answer | import itertools
def calc(x, y, z):
return (x*x + y*y + z*z + x*y + y*z + z*x)
N = int(input())
for i in range(1,N):
output = []
for x in range(1,i):
for y in range(1,i):
for z in range(1,i):
tmp = calc(x,y,z)
if tmp==i:
output.append(tmp)
print(len(output)) |
p02608 | s819672172 | 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):
v = x**2+y**2+z**2+x*y+y*z+z*x
if v<N:
ans[v] += 1
print(ans)
for i in range(N):
print(ans[i+1])
|
p02608 | s615202260 | Wrong Answer | N=int(input())
ans=0
for i in range(1,N):
for j in range(1,N):
for k in range(1,N):
for l in range(1,N):
if l**2+j**2+k**2+l*j+j*k+k*l==i:
ans+=1
print(ans)
ans=0 |
p02608 | s239620719 | Wrong Answer | N = int(input())
for n in range(N + 1):
c = 0
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 + x*z + y*z == n:
c += 1
print(c) |
p02608 | s753580235 | 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):
v = x**2+y**2+z**2+x*y+y*z+z*x
if v<N:
ans[v] += 1
for i in range(N):
print(ans[i+1])
|
p02608 | s779855992 | Wrong Answer | N = int(input().strip())
s=[]
n=int(N**(0.3535))
for a in range (1,n+2):
for b in range(1,n+2):
for c in range(1,n+2):
s.append(a*a+b*b+c*c+a*b+b*c+c*a)
s.sort()
for l in range(1,N+1):
print(s.count(l)) |
p02608 | s751251071 | Wrong Answer | N = int(input())
keys = [i for i in range(1, N+1)]
values = [0] * N
count_dict = dict(zip(keys, values))
for x in range(1, N//6+1):
for y in range(x, N//6+1):
for z in range(y, N//6+1):
n = x**2 + y**2 + z**2 + x*y + y*z + z*x
if n > N:
break
count_dict[n] += 3
if x == y and y == z:
count_dict[n] -= 2
for v in count_dict.values():
print(v) |
p02608 | s244241473 | Wrong Answer | n=int(input())
ans=[0]*10001
for x in range(1,51):
for y in range(1,51):
for z in range(1,51):
f= x**2 + y**2 + z**2 +x*y + y*z + z*x
if f<=n:
ans[f]+=1
for i in range(1,n+1):
print(ans[i])
|
p02608 | s566059416 | Wrong Answer | n = int(input())
for i in range(1, n):
ans = 0
for x in range(1, 100):
for y in range(1, 100):
p = i - (x**2 + y**2 + x * y)
if p <= 0:
break
for zz in range(1, p + 1):
if zz * (zz + x + y) > p:
break
if zz * (zz + x + y) == p:
ans += 1
print(ans)
|
p02608 | s036694826 | Wrong Answer | import math
n = int(input())
for i in range(n):
count = 0
rout = int(math.sqrt(i))
for x in range(1, rout+1):
for y in range(1, rout+1):
for z in range(1, rout+1):
if (x+y)**2 + (y+z)**2 + (z+x)**2 == 2*i:
count += 1
print(count) |
p02608 | s531596444 | Wrong Answer | n = int(input())
cnt = [0] * 11000
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
value = x*x + y*y + z*z + x*y + y*z + z*x
if value <= n:
cnt[value] += 1
for i in range(n):
print(cnt[i])
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.