problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02608 | s344402051 | Wrong Answer | n=int(input())
l=[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):
i=(x+y+z)**2-(x*y+y*z+x*z)
if i<n:
l[i-1]+=1
print(*l,sep="\n") |
p02608 | s234746756 | Wrong Answer | n=int(input())
y=[0 for _ in range(n)]
for j in range(1,41):
for k in range(j,58):
for u in range(k,101):
a=j*j+k*k+u*u+j*k+k*u+u*j
if a < n+1:
if j==k and k==u:
y[a-1]=1
elif j==k or k==u:
y[a-1]=3
else:
y[a-1]=6
for o in range(n):
print(y[o]) |
p02608 | s002228781 | Wrong Answer | n = int(input())
cnt = [0] * 10001
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 + i*k
if(x <= 1000):
cnt[x]+=1
for i in range(1, n+1):
print(cnt[i]) |
p02608 | s626085797 | Wrong Answer | N=int(input())
for h in range(1,N+1):
num=0
for i in range(1,h-3):
for j in range(i+1,h-3):
for k in range(j+1,h-3):
if i**2+j**2+k**2+i*j+j*k+k*i==h:
num+=1
print(num)
|
p02608 | s223885128 | Wrong Answer | import itertools
N = int(input())
ans = {}
for v in itertools.combinations_with_replacement(range(1,(N//6)+1), 3):
x,y,z = v
fn = x**2 + y**2 + z**2 + x*y + y*z + z*x
count = 3 if x == y == z else 1
if fn in ans.keys():
ans[fn] += count
else:
ans[fn] = count
for i in range(1,N+1):
if i in ans.keys():
print(count)
else:
print(0)
|
p02608 | s819450947 | Wrong Answer | N = int(input())
res = [0] * N
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
t1 = (x + y + z) ** 2
if t1 > 11000:
break
n = t1 - x * y - y * z - z * x - 1
if n >= N:
break
res[n] += 1
for o in res:
print(o) |
p02608 | s893443040 | 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:
ans[v] += 1
for i in range(N):
print(ans[i]) |
p02608 | s532072445 | Wrong Answer | # 1 <= x,y,z
# x^2+y^2+z^2+xy+yz+zx = n
def calc(n):
c = 0
for x in range(1,31):
for y in range(1,31):
for z in range(1,31):
if n == x**2+y**2+z**2+x*y+y*z+z*x:
c += 1
print(c)
c = 0
n = int(input())
for i in range(1,n+1):
calc(i) |
p02608 | s983136233 | Wrong Answer | n= int(input())
ans=[0]*(n+1)
v=10**2
for x in range(1,v+1):
for y in range(1,v+1):
for z in range(1,v+1):
cnt=pow(x,2)+pow(y,2)+pow(z,2)+x*y+y*z+z*x
if cnt<=n:
ans[cnt]+=1
for i in ans:
print(i)
|
p02608 | s682448381 | Wrong Answer | import collections
n = int(input())
l = [0]*250939
count = 0
for x in range(1,500):
for y in range(1,500):
for z in range(1,500):
tmp = (x+y+z)**2-(x*y+y*z+z*x)
if tmp <= 10**4:
l[count] = tmp
count+=1
else:
break
l = sorted(l)
print(len(l))
C = collections.Counter(l)
for j in range(1,n+1):
print(C[j]) |
p02608 | s981721187 | 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 0 <= val <= N-1:
lst[val-1] += 1
print(*lst[1:],sep="\n") |
p02608 | s281318849 | Wrong Answer | N=int(input())
for h in range(1,N+1):
num=0
for i in range(1,h-5):
for j in range(1,h-5):
for k in range(1,h-5):
if i**2+j**2+k**2+i*j+j*k+k*i==h:
num+=1
print(num) |
p02608 | s352184698 | Wrong Answer | N=int(input())
x=1
y=1
z=1
for i in range(N):
cnt=0
for x in range(i):
for y in range(i):
for z in range(i):
a=(x+1)**2+(y+1)**2+(z+1)**2+(x+1)*(y+1)+(y+1)*(z+1)+(z+1)*(x+1)
if a==i:
cnt+=1
print(cnt) |
p02608 | s467204066 | Wrong Answer | n = int(input())
ans = 0
f = [0]*15000
for x in range(1,50):
for y in range(1,50):
for z in range(1,50):
f[x**2+y**2+z**2+x*y+y*z+z*x]+=1
z+=1
y+=1
x+=1
for i in range(1,n+1):
print(f[i]) |
p02608 | s932386665 | Wrong Answer | import math
n = int(input())
f = [0] * n
sqrt_n = int(math.sqrt(n)/2) +1
for i in range(n) :
for x in range(1,sqrt_n) :
for y in range(1,sqrt_n) :
for z in range(1,sqrt_n) :
if x*x+y*y+z*z+x*y+y*z+z*x == i+1 :
f[i] += 1
for _ in range(n) :
print(f[_])
|
p02608 | s657469908 | Wrong Answer | import itertools
import math
a = int(input())
def calc(x,y,z,n):
if(n==x*x+y*y+z*z+x*y+y*z+z*x):
return True
for i in range(1,a+1):
l = list(range(int(math.sqrt(a+1))))
cnt = 0;
for x,y,z in itertools.combinations_with_replacement(l, 3):
if(calc(x,y,z,i)):
cnt+=1;
print(cnt)
|
p02608 | s155201288 | Wrong Answer | import itertools
N=int(input())
L=[0]*(10**4+10)
X=[x for x in range(1,13)]
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 | s745027154 | Wrong Answer | n=int(input())
A=[0]*(n+1)
a=round(n**0.5)+2
for x in range(1,a):
for y in range(1,a):
for z in range(1,a):
b=x*x+y*y+z*z+x*y+y*z+z*x
if b<n:
A[b]+=1
for i in range(1,n+1):
print(A[i]) |
p02608 | s742766632 | Wrong Answer | import collections
n=int(input())
lis=[]
lim=int(10000**(0.5))*int(6**(0.5))//3
for x in range(1,lim+1):
for y in range(1,lim+1):
for z in range(1,lim+1):
lis.append(x**2+y**2+z**2+x*y+y*z+z*x)
c=collections.Counter(lis)
for i in range(1,n+1):
print(c[i]) |
p02608 | s621081747 | Wrong Answer | n=int(input())
a=[0]*10001
for i in range(100):
for j in range(100):
for k in range(100):
v=i**2+j**2+k**2+i*j+j*k+k*i
if v<=10000:
a[v]+=1
for m in range(n):
print(a[m+1]) |
p02608 | s587022583 | Wrong Answer | n = int(input())
f = [0]*15000
for x in range(1,50):
for y in range(1,50):
for z in range(1,50):
f[x**2+y**2+z**2+x*y+y*z+z*x-1]+=1
for i in range(n):
print(f[i]) |
p02608 | s989724935 | Wrong Answer | def resolve():
N = int(input())
ans = [0 for _ in range(100001)]
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:
ans[tmp] += 1
for i in range(1, N+1):
print(ans[i])
return
resolve() |
p02608 | s424746042 | Wrong Answer | N = int(input())
ans = [0]*(N+1)
for x in range(1,80):
for y in range(1,80):
for z in range(1,80):
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 | s682120560 | Wrong Answer | n = int(input())
count_n = []
ans = []
for o in range(n):
temp = 0
for i in range(1,50):
for j in range(1,50):
for k in range(1,50):
if o == i ** 2 + j **2 + k ** 2 + i * j + j * k + k * i:
count_n.append(o)
for i in range(1,n+1):
if i not in count_n:
ans.append(0)
else:
ans.append(count_n.count(i))
print(ans) |
p02608 | s412080746 | Wrong Answer | import math
N = int(input())
ans = [0] * (N + 1)
for i in range(1, int(math.sqrt(N)) + 1):
for j in range(1, int(math.sqrt(N)) + 1):
for k in range(1, int(math.sqrt(N)) + 1):
v = i * i + j * j + k * k + i * j + j * k + k * i
if v < N:
ans[v] += 1
for i in range(1, N + 1):
print(ans[i])
|
p02608 | s779029691 | Wrong Answer | # coding: utf-8
def main():
N = int(input())
fs = [0] * N
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
i = (x**2) + (y**2) + (z**2) + (x+y) + (y+z) + (z+x)
if i <= N:
fs[i-1] += 1
for i in range(N):
print(fs[i])
main()
# print(main())
|
p02608 | s739731029 | 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]*10000
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 | s816639153 | Wrong Answer | 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, 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 | s474099124 | Wrong Answer | N = int(input())
ans = [0] * 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 < 10000:
ans[f-1] = ans[f-1] + 1
for i in range(N):
print(ans[i]) |
p02608 | s684777592 | Wrong Answer | n=int(input())
y=[0 for _ in range(10**4)]
for j in range(1,41):
for k in range(1,58):
for u in range(1,101):
a=j*j+k*k+u*u+j*k+k*u+u*j
if a <= 10**4:
if j==k and k==u:
y[a-1]=1
elif j==k or k==u:
y[a-1]=3
else:
y[a-1]=6
for o in range(n):
print(y[o]) |
p02608 | s559770330 | Wrong Answer | def main():
n = int(input())
count_list = [0] * n
upper = int(n**0.5) + 2
for x in range(1, upper):
for y in range(1, upper):
for z in range(1, upper):
num = x**2 + y**2 + z**2 + x*y + y*z + z*x
if num < n:
count_list[num-1] += 1
for count in count_list:
print(count)
if __name__ == '__main__':
main()
|
p02608 | s756549527 | Wrong Answer | def f(n):
count = 0
for i in range(n+1):
for j in range(n+1):
for l in range(n+1):
if (i+j)**2 + (j+l)**2 + (l+i)**2 == 2*n:
count += 1
return (count)
n = int(input())
for i in range(n+1):
f(i) |
p02608 | s768838782 | Wrong Answer | N = int(input())
ans = [0]*(N+1)
RANGE = 300
for i in range(1, RANGE):
for j in range(1, RANGE):
if i**2 + j**2 < N:
for k in range(1, RANGE):
wd = i**2 + j**2 + k**2 + i*j + j*k + k*i
if wd < N:
#print(wd)
#print(i, j, k)
ans[wd] += 1
for i in range(1,N+1):
print(ans[i]) |
p02608 | s617510707 | Wrong Answer | N = int(input())
A = []
for i in range(1,105):
for j in range(1,105):
for k in range(1,105):
A.append(i**2+j**2+k**2+i*j+i*k+j*k)
A = sorted(A)
B = [0]*10050
for i in range(10050):
B[A[i]] += 1
C = B[1:N+1]
[print(i) for i in C] |
p02608 | s167359929 | Wrong Answer | def g(x, y, z):
return x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
N = int(input())
count = [0] * (N + 1)
for x in range(1, 45):
for y in range(1, 45):
for z in range(1, 45):
cur = g(x, y, z)
if cur <= N:
count[cur] += 1
for i in range(1, N + 1):
print(count[i]) |
p02608 | s770121954 | Wrong Answer | from math import sqrt
def f(n):
count = 0
for x in range(int(sqrt(n))):
for y in range(int(sqrt(n))):
for z in range(int(sqrt(n))):
if x**2 + y**2 + z**2 + x*y + y*z + z*x == n:
count += 1
print(count)
N = int(input())
for i in range(1, N+1):
f(i) |
p02608 | s280640494 | Wrong Answer | from collections import Counter
n = int(input())
l = list()
for i in range(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 | s750501107 | Wrong Answer | n = int(input())
li = [0]*n
for i in range(1,32):
for j in range(1,32):
for k in range(1,32):
if i*2 + j*2 + k*2 + i*j + j*k + k*i <= n:
li[i*2 + j*2 + k*2 + i*j + j*k + k*i-1] += 1
for i in range(n):
print(li[i]) |
p02608 | s437208899 | Wrong Answer | N = int(input())
for n in range(N):
x = 1
count = 0
while x**2 < n:
y = 1
while x**2 + y**2 + x*y < n:
z = 1
while x**2 + y**2 + z**2 + x*y + y*z + z*x <= n:
if x**2 + y**2 + z**2 + x*y + y*z + z*x == n:
count += 1
z += 1
y += 1
x += 1
print(count)
|
p02608 | s893223415 | 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 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 | s020777979 | Wrong Answer | N = int(input())
ans = [0 for _ in range(10050)]
for i in range(105):
for j in range(105):
for k in range(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 | s648508455 | Wrong Answer | n = int(input())
a = [0]*10**4
ans = 0
for i in range(1, 101):
for j in range(1, min(i+1,101)):
for k in range(1, min(j+1, 101)):
if (i+j+k)**2-i*j-j*k-k*i <= 10**4:
p = (i+j+k)**2-i*j-j*k-k*i
if i==j==k:
a[p-1] +=1
else:
a[p-1] +=3
for q in a[:n]:
print(q) |
p02608 | s543205784 | Wrong Answer | N = int(input())
L = [0] * N
for x in range(1, 51):
for y in range(1, 51):
for z in range(1, 51):
calc = x**2 + y**2 + z**2 + x*y + y*z + z*x
if calc > N:
break
L[calc-1] += 1
for l in L:
print(l) |
p02608 | s476469301 | Wrong Answer | n=int(input())
def f(i):
co=0
for z in range(1,7):
for y in range(1,7):
for x in range(1,7):
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):
print(f(i)) |
p02608 | s803525365 | Wrong Answer | n = int(input())
for i in range(5):
print(0)
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
for i in range(n):
print(count[i])
|
p02608 | s066236392 | Wrong Answer | import sys
import itertools as itr
readline = sys.stdin.buffer.readline
N=int(readline())
n=int(pow(N,0.5))-2
chk=list(itr.product(range(1,n),repeat=3))
cnt=[0]*(N+1)
for _ in range(len(chk)):
i=chk[_][0]
j=chk[_][1]
k=chk[_][2]
if pow(i,2)+pow(j,2)+pow(k,2)+i*j+j*k+k*i<=N:
cnt[pow(i,2)+pow(j,2)+pow(k,2)+i*j+j*k+k*i]+=1
for i in range(1,N+1):
print(cnt[i]) |
p02608 | s303794131 | 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, 35), 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 | s031324441 | Wrong Answer | 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])
|
p02608 | s184092712 | Wrong Answer | import collections
n = int(input())
ans_list = []
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
hoge = x*x+y*y+z*z+x*y+y*z+z*x
if hoge < 10000:
ans_list.append(hoge)
counter = collections.Counter(ans_list)
for i in range(n):
print(counter[i]) |
p02608 | s285108810 | Wrong Answer | N = int(open(0).read())
cache = {}
cnt = 0
c = int(N ** 0.5)
cs = range(1, c)
for x in cs:
for y in cs:
for z in cs:
n = x*x + y*y + z*z + x*y + y*z + z*x
if n in cache:
cache[n] += 1
else:
cache[n] = 1
print(cache)
for i in range(1, N+1):
if i in cache:
print(cache[i])
else:
print(0)
|
p02608 | s899417676 | 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 n >= N:
break
result[n-1] += 1
for r in result:
print(r) |
p02608 | s332616701 | 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
for i in range(N):
print(a[i]) |
p02608 | s356382943 | Wrong Answer | 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
for i in range(N):
print(ans[i]) |
p02608 | s345703026 | Wrong Answer | N = int(input())
for i in range(1, N + 1):
x = 0
for j in range(1, 21):
for k in range(1, 21):
for l in range(1, 21):
if i == j ** 2 + k ** 2 + l ** 2 + j * k + k * l + l * j:
x += 1
print(x) |
p02608 | s356131406 | Wrong Answer | n = int(input())
a = [0 for _ in range(n+1)]
for i in range(1,n+1):
if i*i>n:
break
for j in range(1,n+1):
if i*i + j*j +i*j > n:
break
for k in range(1,n+1):
tmp = i*i + j*j + k*k + i*j + j*k + k*i
if tmp==n:
a[tmp]+=1
else:
break
for i in range(1,n+1):
print(a[i]) |
p02608 | s564699265 | Wrong Answer | N = int(input())
cnt = 0
for n in range(1,N+1):
for x in range(1,n+1):
for y in range(1, n+1):
if x**2 + y**2 + (N-x-y)**2 + x*y + y*(n-x-y) + (n-x-y)*x == n:
cnt +=1
print(cnt) |
p02608 | s695097837 | Wrong Answer | import itertools
ln = itertools.product(range(1,100),repeat = 3)
#print(ln)
line = [0 for i in range(10000)]
#print(len(line))
for i in ln:
x,y,z = i
n = x**2 +y**2 + z**2 +x*y + y*z + z*x
if n <=1000:
line[n-1]+=1
N = int(input())
for i in range(N):
print(line[i]) |
p02608 | s734016170 | Wrong Answer | N = int(input())
#A = list(map(int, input().split()))
ans = [0 for _ in range(N)]
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
k = (x+y)**2+(y+z)**2+(z+x)**2
if k % 2 == 0 and k < 2*N:
ans[((x+y)**2+(y+z)**2+(z+x)**2)//2-1] += 1
for i in range(N):
print(ans[i]) |
p02608 | s040838967 | Wrong Answer | n=int(input())
ans_list = []
for i in range(n):
ans=0
N = i+1
for x in range(1,11):
for y in range(1,11):
for z in range(1,11):
if x**2+y**2+z**2+x*y+y*z+z*x == N:
ans+=1
ans_list.append(ans)
for i in range(n):
print(ans_list[i]) |
p02608 | s929184897 | Wrong Answer | 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 | s682432310 | Wrong Answer | from itertools import product
n = int(input())
pro = product([x for x in range(1,4)],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 | s392348096 | Wrong Answer | n = int(input())
num = [0]*1000
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
if a <= 1000:
num[a] += 1
num = num[:n]
for i in num:
print(i)
|
p02608 | s160876569 | Wrong Answer | #coding:utf-8
import itertools
def calculate(x,y,z):
return x**2+y**2+z**2+x*y+y*z*x
n = int(input())
result_lst = [0] * n
for i,j,k in itertools.product(range(1,n+1),repeat=3):
result = calculate(i,j,k)
if result < n:
result_lst[result] += 1
for i in result_lst:
print(str(i))
|
p02608 | s993815362 | 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):
s = x**2 + y**2 + z**2 + x*y + y*z + z*x
if s <= N:
ans[s] += 1
for i in ans:
print(i) |
p02608 | s383239986 | Wrong Answer | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n = int(input())
if n == 1:
print(0)
sys.exit()
r = [0]*100000
for i1 in range(1,20):
for i2 in range(1,20):
for i3 in range(1,20):
t = i1**2 + i2**2 + i3**2 + i1*i2 + i2*i3 + i1*i3
r[t] += 1
print(*r[1:n+1],sep='\n')
if __name__ == '__main__':
main()
|
p02608 | s648134003 | Wrong Answer | import math
n = int(input())
highest = int(math.sqrt(n//3))+1
l = [0]*n
cal = 0
for x in range(1, highest+1):
for y in range(1, highest+1):
for z in range(1, highest+1):
cal = x**2 + y**2 + z**2 + x*y + y*z + z*x
if cal > n-1:
continue
else:
l[cal-1] += 1
for i in range(len(l)):
print(l[i]) |
p02608 | s779023146 | Wrong Answer | import sys
input = sys.stdin.readline
# C - XYZ Triplets
def get_f(n):
count = 0
for x in range(1, n):
if x ** 2 < n:
for y in range(1, n):
if x ** 2 + y ** 2 < n:
for z in range(1, n):
calc = x ** 2 + y ** 2 + x * y
if calc < n:
if z ** 2 + y * z + z * x == n - calc:
print(x, y, z)
count += 1
return count
N = int(input())
for n in range(1, N + 1):
print(get_f(n)) |
p02608 | s335931486 | Wrong Answer | def foo(x,y,z):
return x**2 + y**2 + z**2 + x*y + y*z + z*x
N = int(input())
A = [0]*100010
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
A[foo(i,j,k)] += 1
for i in range(N):
print(A[i]) |
p02608 | s149293066 | Wrong Answer | import math
N=int(input())
count=[0]*(N+1)
for i in range(1,N+1):
for x in range(1,int(math.sqrt((N+1)/6))):
for y in range(1,int(math.sqrt((N+1)/6))):
for z in range(1,int(math.sqrt((N+1)/6))):
if(x**2+y**2+z**2+x*y+y*z+z*x==i):
count[i]+=1
print(count[i]) |
p02608 | s404985516 | Wrong Answer | n = int(input())
for i in range(1,n+1):
cnt = 0
for j in range(1, 10^2): #x
for k in range(1, 10^2): #y
for l in range(1, 10^2): #z
if j*j+k*k+l*l+j*k+k*l+l*j == i:
cnt += 1
print(cnt) |
p02608 | s725932026 | 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 | s347489213 | Wrong Answer | N = int(input())
ans = [0] * (N+1)
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:
ans[n] += 1
for i in range(1, N + 1):
print(ans[i])
|
p02608 | s770544291 | Wrong Answer | n=int(input())
y=[0 for _ in range(10**4)]
for j in range(1,41):
for k in range(1,58):
for u in range(1,101):
a=j*j+k*k+u*u+j*k+k*u+u*j
if a < n+1:
if j==k and k==u:
y[a-1]=1
elif j==k or k==u:
y[a-1]=3
else:
y[a-1]=6
for o in range(n):
print(y[o]) |
p02608 | s320025815 | Wrong Answer | n=int(input())
y=[0 for _ in range(10**4+1)]
for j in range(1,100):
for k in range(1,100):
for u in range(1,100):
a=j*j+k*k+u*u+j*k+k*u+u*j
if a <= 10**4:
y[a]+=1
for o in range(n):
print(y[o]) |
p02608 | s534581905 | Wrong Answer | n=int(input())
ls=[0]*n
xyz=[1,1,1]
p=6
cnt=0
while p<=n:
if xyz[0]==xyz[1] and xyz[0]==xyz[2]:
ls[p-1]=1
else:
ls[p-1]=3
xyz[cnt%3]+=1
p=xyz[0]**2+xyz[1]**2+xyz[2]**2+xyz[0]*xyz[1]+xyz[1]*xyz[2]+xyz[0]*xyz[2]
for i in ls:
print(i)
|
p02608 | s796426596 | Wrong Answer | N=int(input())
dp=[0]*(10**4+1)
for i in range(1,100+1):
for j in range(1,100+1):
for k in range(1,100+1):
a=(i+j)**2+(k+j)**2+(i+k)**2
if 10**4<a:
break
dp[a//2]+=1
for l in range(1,N+1):
print(dp[l]) |
p02608 | s765552066 | Wrong Answer | N = int(input())
ans = [0]*(N+1)
for i in range(1, int(N**0.5)+1):
for j in range(1, int(N**0.5)+2):
for k in range(1, int(N**0.5)+2):
f = i*i + j*j + k*k +i*j + j*k + k*i
if f <= N:
ans[f] += 1
print(len(ans))
|
p02608 | s495219509 | Wrong Answer | from collections import defaultdict
N = int(input())
ctr = defaultdict(int)
for x in range(1, 42):
for y in range(1, 42):
for z in range(1, 42):
res = x**2 + y**2 + z**2 + x*y + y*z + z*x
ctr[res] += 1
for n in range(N + 1):
print(ctr[n])
|
p02608 | s725607632 | Wrong Answer | n = int(input())
cnt = [0]*(10**4+1)
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<10**4:
cnt[v] += 1
for i in range(1,n+1):
print(cnt[i]) |
p02608 | s682039792 | Wrong Answer | n = int(input())
ans = [0] * 10000
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
m = ((i ** 2) + (j ** 2) + (k ** 2) + (i * j) + (j * k) + (k * i))
if m < 10000:
ans[m-1] += 1
for i in range(n):
print(ans[i]) |
p02608 | s028590881 | Wrong Answer | import math
N = int(input())
n = int(math.sqrt(N))
ans = [0 for _ in range(N)]
for i in range(N):
for x in range(n):
for y in range(n):
for z in range(n):
if x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * y == N:
ans[i] += 1
for i in range(N):
print(ans[i]) |
p02608 | s291461237 | Wrong Answer | N = int(input())
cs = [0]*N
for i in range(1,130):
for j in range(1,130):
for k in range(1,130):
temp = i**2 + j**2 + k**2 + i*j + j*k + k*i
if temp < N and temp > 0:
cs[temp-1] += 1
for i in range(N):
print(cs[i]) |
p02608 | s095162959 | Wrong Answer | 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(50)
[print(ans[i]) for i in range(1, N + 1)]
|
p02608 | s225691826 | Wrong Answer | import math
N=int(input())
d=int(math.sqrt(N)+1)
bucket=[0 for i in range(N)]
for i in range(1,d+1):
for j in range(1,d+1):
for k in range(1,d+1):
if(i**2+j**2+k**2<=2*N and (i**2+j**2+k**2)%2==0 and i+j-k>=2 and j+k-i>=2 and k+i-j>=2):
bucket[(i**2+j**2+k**2)//2-1]+=1
for i in range(N):
print(bucket[i])
|
p02608 | s428947832 | Wrong Answer | 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>1000: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]) |
p02608 | s488478725 | 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 z < 1: break
if n == x*x + y*y +z*z + x*y + y*z + z*x:
cnt += 1
print(cnt) |
p02608 | s597924222 | Wrong Answer | from collections import Counter
from itertools import combinations_with_replacement
N = int(input())
L = [i for i in range(1, 50)]
ans = []
for c in combinations_with_replacement(L, 3):
x = c[0]
y = c[1]
z = c[2]
tmp = x**2+y**2+z**2+x*y+y*z+z*x
ans.append(tmp)
C = Counter(ans)
for i in range(1, N+1):
if C[i]:
print(C[i]*3)
else:
print(0) |
p02608 | s091816277 | Wrong Answer | N = int(input())
ls = [0]*15000
for i in range(1,42):
for j in range(1,42):
for k in range(1,42):
t = i**2 + j**2 + k**2 + i*j + j*k + k*i
ls[t] += 1
for p in range(1,N+1):
print(ls[p]) |
p02608 | s314123817 | Wrong Answer | N = int(input())
cnt = 0
for n in range(1,N+1):
for z in range(1,34):
for y in range(1,34):
for x in range(1,34):
if x*x+y*y+z*z+x*y+y*z+z*x == n:
cnt +=1
print(cnt)
cnt=0 |
p02608 | s861745033 | Wrong Answer | a={}
for i in range(1,50):
for j in range(1,50):
for k in range(1,50):
n=i*i+j*j+k*k+i*j+i*k+j*k
if n not in a:
a[n]=1
else:
a[n]+=1
t=int(input())
for i in range(1,t+1):
if i in a:
print(a[i])
else:
print(0)
|
p02608 | s012714641 | Wrong Answer | n=int(input())
a=[0]*10001
for i in range(101):
for j in range(101):
for k in range(101):
v=i**2+j**2+k**2+i*j+j*k+k*i
if v<=10000:
a[v]+=1
for m in range(n):
print(a[m+1]) |
p02608 | s515138919 | Wrong Answer | #coding:utf-8
import itertools
def calculate(x,y,z):
return x**2+y**2+z**2+x*y+y*z*x
n = int(input())
result_lst = [0] * n
for i,j,k in itertools.product(range(1,n+1),repeat=3):
result = calculate(i,j,k)
if result < n:
result_lst[result] += 1
for i in result_lst:
print(str(i) + '\n')
|
p02608 | s816720609 | 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)+2)):
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 | s136314371 | Wrong Answer | N = int(input())
ans = [0]*((10**4)+1)
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 + y * z + z * x
if num <= N:
ans[num] = ans[num] + 1
for i in range(N+1):
print(ans[i])
|
p02608 | s329924245 | Wrong Answer | N = int(input().strip())
s=[]
for a in range (1,101):
for b in range(1,101):
for c in range(1,101):
s.append(a*a+b*b+c*c+a*b+b*c+c*a)
for l in range(N):
print(s.count(l)) |
p02608 | s000911565 | Wrong Answer | N = int(input())
def f(n):
total = 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 + y*z + z*x == n:
total += 1
return total
for i in range(N):
print(f(i)) |
p02608 | s883844001 | Wrong Answer | 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(10050)]
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
if idx < 10000:
ans[idx-1] += 1
for i in range(N):
print(ans[i])
|
p02608 | s023167054 | Wrong Answer | import collections
import sys
A = []
n = int(input())
for i in range(1,35):
for j in range(1,35):
for k in range(1,35):
A.append(i**2+j**2+k**2+i*j+j*k+k*i)
c = collections.Counter(A)
for x in range(1,n+1):
print(c[x]) |
p02608 | s323839283 | Wrong Answer | N = int(input())
ls = [0]*15000
for i in range(1,42):
for j in range(1,42):
for k in range(1,42):
t = i**2 + j**2 + k**2 + i*j + j*k + k*i
ls[t] += 1
for p in range(1,N+1):
print(p,ls[p]) |
p02608 | s388533323 | Wrong Answer | N = int(input())
l = [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:
l[x**2+y**2+z**2+x*y+y*z+z*x-1]+=1
for i in l:
print(i)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.