ZhenlongDai/ACPR huggingface dataset:
Problem: p02608
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n=int(input())
ans=[0]*n
t=3
while (t-2)**2<n:
  for i in range(1,t-1):
    for j in range(1,t-i):
      k=t-i-j
      if t**2-i*j-j*k-k*i-1<n:
        ans[t**2-i*j-j*k-k*i-1]=ans[t**2-i*j-j*k-k*i-1]+1
  t=t+1
for i in range(n):
  print(ans[i])

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
0
0
0
15
6
6
0
0
0
6
0
0
0
3
6
0
0
12
0
0
0
0
0
0
0
6
0
6
0
0
0
0
3
0
0
0
0
0
3
6
0


Fixed submission (verdict: Accepted):
n=int(input())
ans=[0]*n
t=3
import math
while t**2-((math.ceil(t/3))**2)*3<=n:
  for i in range(1,t-1):
    for j in range(1,t-i):
      k=t-i-j
      if t**2-i*j-j*k-k*i-1<n:
        ans[t**2-i*j-j*k-k*i-1]=ans[t**2-i*j-j*k-k*i-1]+1
  t=t+1
for i in range(n):
  print(ans[i])
Problem: p02608
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
from collections import defaultdict

N = int(input())

d = defaultdict(int)

for x in range(1,N+1):
    for y in range(x,N+1):
        for z in range(y,N+1):
            n = x**2+y**2+z**2+x*y+y*z+z*x
            if x == y == z:
                d[n] += 1
            elif x == y or y == z or z == x:
                d[n] += 3
            else:
                d[n] += 6
            
            if n > N:
                break
        else:
            continue
        break
    else:
        continue
    break

for i in range(1,N+1):
    print(d[i])



Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0


Fixed submission (verdict: Accepted):
from collections import defaultdict

N = int(input())

d = defaultdict(int)

for x in range(1,100):
    for y in range(x,100):
        for z in range(y,100):
            n = x**2+y**2+z**2+x*y+y*z+z*x
            if x == y == z:
                d[n] += 1
            elif x == y or y == z or z == x:
                d[n] += 3
            else:
                d[n] += 6
            
            if n > N:
                break

for i in range(1,N+1):
    print(d[i])
Problem: p02608
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
count = 0
ans = 0

N = i()

L = [0]*N

for x in range(1,100):
    for y in range(x,100):
        for z in range(y,100):
            n = x**2 + y**2 + z**2 +x*y + y*z + z*x
            if n > N:
                break
            if x == y and y == z:
                L[n-1] = 1
            elif x ==y or y == z or x == z:
                L[n-1] = 3
            else:
                L[n-1] = 6
for i in L:
    print(i)


Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
3
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
6
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
3
6
0
3
6
0
6
0
0
3
6
0
0
0
3
3
6
0
6
3
6
0
3
6
6
0
6
0
0
0
3
6
3
3
6
0
6
3
6
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
3
6
0
0
6
0
6
0
6
3
6
0
0
6
0
0
6
0
3
3
6
0
6
3
6
6
3
6
6
0
6
0
6
0
3
6
0
0
6
0
3
3
6
0
6
3
6
0
3
6
6
3
6
0
6
0
6
6
0
0
6
3
6
1
6
6
3
6
0
0
6
0
6
0
3
3
6
0
0
6
3
6
6
0
6
0
0
0
3
3
6
6
6
3
6
0
3
6
6
0
6
0
6
0
3
6
0
0
6
3
6
3
6
6
3
3
6
0
6
3
6
3
3
6
6
6
6
0
6
0
6
6
6
0
6
3
6
0
6
6
6
1
6
0
3
6
6
0
6
0
6
0
0
3
6
6
0
6
6
0
6
0
6
0
0
0
6
0
3
6
3
3
6
3
6
3
6
6
3
6
6
0


Fixed submission (verdict: Accepted):
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
count = 0
ans = 0

N = i()

L = [0]*N

for x in range(1,100):
    for y in range(x,100):
        for z in range(y,100):
            n = x**2 + y**2 + z**2 +x*y + y*z + z*x
            if n > N:
                break
            if x == y and y == z:
                L[n-1] += 1
            elif x ==y or y == z or x == z:
                L[n-1] += 3
            else:
                L[n-1] += 6
for i in L:
    print(i)
Problem: p02608
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
N = int(input())
ans = [0] * N
for x in range(1,101):
    for y in range(1,101):
        for z in range(1,22):
            if 0.5*((x+y)**2+(y+z)**2+(z+x)**2) <= N:
                n = int(0.5*((x+y)**2+(y+z)**2+(z+x)**2))
                if x == y and y == z and z == x:
                    ans[n-1] = 1
                elif x == y or y == z or z == x:
                    ans[n-1] = 3
                elif x != y and y != z and z != x:
                    ans[n-1] = 6
for output in ans:
    print(output)

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
3
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
3
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
3
6
0
3
6
0
6
0
0
3
6
0
0
0
3
3
6
0
6
3
6
0
3
6
3
0
6
0
0
0
3
6
3
3
6
0
6
3
6
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
6
6
0
0
6
0
6
0
6
3
6
0
0
6
0
0
6
0
3
3
6
0
6
3
3
6
3
6
6
0
6
0
6
0
6
6
0
0
6
0
3
3
6
0
6
3
6
0
3
6
6
3
6
0
6
0
6
6
0
0
6
3
6
1
6
6
3
6
0
0
6
0
6
0
3
3
6
0
0
6
3
6
6
0
6
0
0
0
6
3
3
6
6
3
6
0
3
6
6
0
6
0
6
0
3
3
0
0
6
3
6
3
6
6
6
3
6
0
6
3
6
3
6
6
6
6
6
0
6
0
6
6
6
0
6
3
6
0
3
6
6
1
6
0
3
6
6
0
6
0
6
0
0
3
3
6
0
6
6
0
6
0
6
0
0
0
6
0
6
6
3
3
6
3
6
3
6
6
6
3
6
0


Fixed submission (verdict: Accepted):
N = int(input())
ans1 = [0] * N
ans2 = [0] * N
ans3 = [0] * N

for x in range(1,101):
    for y in range(1,71):
        for z in range(1,58):
            if (x**2+y**2+z**2+x*y+y*z+z*x) <= N:

                n = x**2+y**2+z**2+x*y+y*z+z*x
                if x == y and y == z and z == x:
                    ans1[n-1] = 1

                elif x == y and x > z:
                    ans2[n-1] += 3
                elif y == z and x > z:
                    ans2[n-1] += 3
                elif x != y and y != z and z != x:
                    if x > y and y > z:
                        ans3[n-1] += 6
for x,y,z in zip(ans1, ans2, ans3):
    print(x+y+z)
Problem: p02608
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N=int(input())
ans=[0 for _ in range(10050)]
for x in range(1,100):
    for y in range(1,100):
        for z in range(1,100):
            v=x**2+y**2+z**2+x*y+y*z+z*x
            if v<10050:
                ans[v]+=1

for i in range(N):
    print(ans[i])

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18


Fixed submission (verdict: Accepted):
N=int(input())
ans=[0 for _ in range(10050)]
for x in range(1,105):
    for y in range(1,105):
        for z in range(1,105):
            v=x**2+y**2+z**2+x*y+y*z+z*x
            if v<10050:
                ans[v]+=1

for i in range(N):
    print(ans[i+1])
Problem: p02608
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
from itertools import combinations_with_replacement
def f(N):
    global table
    for x, y, z in combinations_with_replacement(range(1, 100), 3):
        n = x**2+y**2+z**2+x*y+y*z+z*x
        if n>N:
            continue
        if x==y==z:
            table[n] = 1
        elif x==y or y==z or z==x:
            table[n] = 3
        else:
            table[n] = 6
N = int(input())
table = [0 for _ in range(N+1)]
f(N)
for n in range(1, N+1):
    print(table[n])

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
3
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
6
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
3
6
0
3
6
0
6
0
0
3
6
0
0
0
3
3
6
0
6
3
6
0
3
6
6
0
6
0
0
0
3
6
3
3
6
0
6
3
6
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
3
6
0
0
6
0
6
0
6
3
6
0
0
6
0
0
6
0
3
3
6
0
6
3
6
6
3
6
6
0
6
0
6
0
3
6
0
0
6
0
3
3
6
0
6
3
6
0
3
6
6
3
6
0
6
0
6
6
0
0
6
3
6
1
6
6
3
6
0
0
6
0
6
0
3
3
6
0
0
6
3
6
6
0
6
0
0
0
3
3
6
6
6
3
6
0
3
6
6
0
6
0
6
0
3
6
0
0
6
3
6
3
6
6
3
3
6
0
6
3
6
3
3
6
6
6
6
0
6
0
6
6
6
0
6
3
6
0
6
6
6
1
6
0
3
6
6
0
6
0
6
0
0
3
6
6
0
6
6
0
6
0
6
0
0
0
6
0
3
6
3
3
6
3
6
3
6
6
3
6
6
0


Fixed submission (verdict: Accepted):
from itertools import combinations_with_replacement
def f(N):
    global table
    for x, y, z in combinations_with_replacement(range(1, 100), 3):
        n = x**2+y**2+z**2+x*y+y*z+z*x
        if n>N:
            continue
        if x==y==z:
            table[n] += 1
        elif x==y or y==z or z==x:
            table[n] += 3
        else:
            table[n] += 6
N = int(input())
table = [0 for _ in range(N+1)]
f(N)
for n in range(1, N+1):
    print(table[n])
Problem: p02608
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
n=int(input())
ans=0
for i in range(n+1):
  cnt=0
  for x in range(1,101):
    if x**2>i:
      break
    for y in range(1,x+1):
      if x**2+y**2>i:
        break
      for z in range(1,y+1):
        if x**2+y**2+z**2+x*y+y*z+z*x==i:
          cnt+=3
  ans=cnt
  if i==6:
    ans=1
  print(ans)  

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
3
3
0
3
0
0
0
0
0
3
3
3
0
0
3
0
0
0
0
3
3
3
0
3
0
0
0
3
0
0
3
3
0
6
3
0
0
3
0
0
0
0
3
3
3
3
0
3
3
3
0
0
0
3
0
0
0
3
3
6
0
3
3
3
0
3
3
0
0
0
0
3
3
3
0
6
3
0
3
6
0
3
0
0
3
3
0
0
0
3
3
6
0
3
3
3
0
3
3
6
0
3
0
0
0
3
3
3
3
3
0
3
3
6
0
3
3
3
0
3
0
3
3
3
0
0
3
3
3
9
3
0
0
6
0
3
0
3
6
6
0
0
3
0
0
3
0
9
3
3
0
3
3
6
3
3
3
3
0
3
0
3
0
9
3
0
0
3
0
3
3
6
0
6
6
3
0
3
3
3
3
6
0
3
0
6
3
0
0
3
3
6
3
3
3
6
3
0
0
9
0
6
0
3
6
6
0
0
3
3
3
6
0
6
0
0
0
6
3
6
3
6
3
6
0
3
3
3
0
6
0
6
0
6
6
0
0
3
3
3
3
6
3
6
3
3
0
6
3
3
3
6
3
6
3
3
0
3
0
6
3
3
0
6
3
3
0
6
3
3
3
3
0
15
6
3
0
6
0
6
0
0
6
9
3
0
3
6
0
6
0
6
0
0
0
6
0
9
6
3
3
9
3
3
3
3
3
6
6
9
0


Fixed submission (verdict: Accepted):
n=int(input())
ans=0
for i in range(1,n+1):
  cnt=0
  for x in range(1,101):
    if x**2>i:
      break
    for y in range(1,x+1):
      if x**2+y**2>i:
        break
      for z in range(1,y+1):
        if x**2+y**2+z**2+x*y+y*z+z*x==i:
          if x==y==z:
            cnt+=1
          if (x>y and y==z) or (x==y and y>z):
            cnt+=3
          if x>y>z:
            cnt+=6
  ans=cnt
  print(ans)
Problem: p02608
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
N = int(input())
f = {}

for x in range(1, 110):
	for y in range(1, 110):
		for z in range(1, 110):
			t = x*x+y*y+z*z+x*y+y*z+z*x
			f[t] = (f[t]+1 if t in f.keys() else 1)

for i in range(1, N):
    print(f[i] if i in f.keys() else 0)

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18


Fixed submission (verdict: Accepted):
N = int(input())
f = {}

for x in range(1, 110):
	for y in range(1, 110):
		for z in range(1, 110):
			t = x*x+y*y+z*z+x*y+y*z+z*x
			f[t] = (f[t]+1 if t in f.keys() else 1)

for i in range(1,N+1):
    print(f[i] if i in f.keys() else 0)
Problem: p02608
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
N = int(input())
ans1 = [0] * N
ans2 = [0] * N
ans3 = [0] * N

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,22):
            if (x**2+y**2+z**2+x*y+y*z+z*x) <= N:
                n = int(0.5*((x+y)**2+(y+z)**2+(z+x)**2))
                if x == y and y == z and z == x:
                    ans1[n-1] = 1
                elif x == y or y == z or z == x:
                    ans2[n-1] = 3
                elif x != y and y != z and z != x:
                    ans3[n-1] = 6
for x,y,z in zip(ans1, ans2, ans3):
    print(x+y+z)

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
3
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
3
6
0
3
6
0
6
0
0
3
6
0
0
0
3
3
6
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
6
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
9
6
0
0
6
0
6
0
6
3
6
0
0
6
0
0
6
0
9
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
9
6
0
0
6
0
3
3
6
0
6
3
6
0
3
6
6
3
6
0
6
0
9
6
0
0
6
3
6
1
6
6
3
6
0
0
6
0
6
0
3
3
6
0
0
6
3
6
6
0
6
0
0
0
9
3
9
6
6
3
6
0
3
6
6
0
6
0
6
0
9
9
0
0
6
3
6
3
6
6
9
3
6
0
6
3
6
3
9
6
6
6
6
0
6
0
9
6
6
0
6
3
6
0
9
6
6
1
6
0
9
6
6
0
6
0
6
0
0
3
9
6
0
6
6
0
6
0
6
0
0
0
6
0
9
6
3
3
6
3
6
3
6
6
9
9
6
0


Fixed submission (verdict: Accepted):
N = int(input())
ans1 = [0] * N
ans2 = [0] * N
ans3 = [0] * N

for x in range(1,101):
    for y in range(1,71):
        for z in range(1,58):
            if (x**2+y**2+z**2+x*y+y*z+z*x) <= N:

                n = x**2+y**2+z**2+x*y+y*z+z*x
                if x == y and y == z and z == x:
                    ans1[n-1] = 1

                elif x == y and x > z:
                    ans2[n-1] += 3
                elif y == z and x > z:
                    ans2[n-1] += 3
                elif x != y and y != z and z != x:
                    if x > y and y > z:
                        ans3[n-1] += 6
for x,y,z in zip(ans1, ans2, ans3):
    print(x+y+z)
Problem: p02608
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n=int(input())
d={}
for i in range(10**4):
    d[i]=0
    
def jud(l):
    if len(set(l))==3:
        return 6
    if len(set(l))==2:
        return 3
    if len(set(l))==1:
        return 1

for i in range(1,101):
    for j in range(1,101):
        for k in range(1,101):
            l=[i,j,k]
            p=i**2+j**2+k**2+i*j+j*k+k*i
            d[p-1]=jud(l)

for i in range(n):
    print(d[i])

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
3
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
3
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
3
6
0
3
6
0
6
0
0
3
6
0
0
0
3
3
6
0
6
3
6
0
3
6
3
0
6
0
0
0
3
6
3
3
6
0
6
3
6
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
6
6
0
0
6
0
6
0
6
3
6
0
0
6
0
0
6
0
3
3
6
0
6
3
3
6
3
6
6
0
6
0
6
0
6
6
0
0
6
0
3
3
6
0
6
3
6
0
3
6
6
3
6
0
6
0
6
6
0
0
6
3
6
1
6
6
3
6
0
0
6
0
6
0
3
3
6
0
0
6
3
6
6
0
6
0
0
0
6
3
3
6
6
3
6
0
3
6
6
0
6
0
6
0
3
3
0
0
6
3
6
3
6
6
6
3
6
0
6
3
6
3
6
6
6
6
6
0
6
0
6
6
6
0
6
3
6
0
3
6
6
1
6
0
3
6
6
0
6
0
6
0
0
3
3
6
0
6
6
0
6
0
6
0
0
0
6
0
6
6
3
3
6
3
6
3
6
6
6
3
6
0


Fixed submission (verdict: Accepted):
n=int(input())
d=[0 for i in range(10**7)]
    
def jud(l):
    if len(set(l))==3:
        return 6
    if len(set(l))==2:
        return 3
    if len(set(l))==1:
        return 1

for i in range(1,101):
    for j in range(i,101):
        for k in range(j,101):
            l=[i,j,k]
            p=i**2+j**2+k**2+i*j+j*k+k*i
            d[p-1]+=jud(l)

for i in range(n):
    print(d[i])
Problem: p02608
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def main():
    n = int(input())
    res = [0]*(n+1)

    for i in range(1,33):
        for j in range(i,33):
            for k in range(j,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]+=3
                    if(i==j==k):
                        res[i**2 + j**2 + k**2 +i*j+j*k + k*i]-=2

    for i in range(1,n+1):
        print(res[i])
if __name__ == '__main__':
    main()


Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
3
0
3
0
0
0
0
0
3
3
3
0
0
3
0
0
0
0
3
3
3
0
3
0
0
0
3
0
0
1
3
0
6
3
0
0
3
0
0
0
0
3
3
3
3
0
3
3
3
0
0
0
3
0
0
0
3
3
6
0
3
3
3
0
3
3
0
0
0
0
3
1
3
0
6
3
0
3
6
0
3
0
0
3
3
0
0
0
3
3
6
0
3
3
3
0
3
3
6
0
3
0
0
0
3
3
3
3
3
0
3
3
6
0
3
3
3
0
3
0
3
3
3
0
0
1
3
3
9
3
0
0
6
0
3
0
3
6
6
0
0
3
0
0
3
0
9
3
3
0
3
3
6
3
3
3
3
0
3
0
3
0
9
3
0
0
3
0
3
3
6
0
6
6
3
0
3
3
3
3
6
0
3
0
6
3
0
0
3
3
6
1
3
3
6
3
0
0
9
0
6
0
3
6
6
0
0
3
3
3
6
0
6
0
0
0
6
3
6
3
6
3
6
0
3
3
3
0
6
0
6
0
6
6
0
0
3
3
3
3
6
3
6
3
3
0
6
3
3
3
6
3
6
3
3
0
3
0
6
3
3
0
6
3
3
0
6
3
3
1
3
0
15
6
3
0
6
0
6
0
0
6
9
3
0
3
6
0
6
0
6
0
0
0
6
0
9
6
3
3
9
3
3
3
3
3
6
6
9
0


Fixed submission (verdict: Accepted):
def main():
    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):
                tmp = i**2 + j**2 + k**2 + i*j + j*k + k*i
                if(tmp<=n):
                    res[tmp]+=1



    for i in range(1,n+1):
        print(res[i])
if __name__ == '__main__':
    main()
Problem: p02608
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n=int(input())
A=[0]*n
for i in range(3,int(n**0.5+2)):
  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
for a in A:
  print(a)

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
6
0
0
0
6
0
0
3
6
0
6
6
0
0
0
0
0
0
6
0
6
0
0
0
3
0
0
0
0
0
3
6
0
0
0
0
0
0
0
0
0
0
0
0
6
0
0
0
0
0
0
0
0
0
0
0
0
0
0
3
0
0
0
0
0
0
0
0


Fixed submission (verdict: Accepted):
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
for a in A:
  print(a)
Problem: p02608
Buggy submission (Python (3.8.2), verdict: 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)
  

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
3
0
3
0
0
0
0
0
3
3
3
0
0
3
0
0
0
0
3
3
3
0
3
0
0
0
3
0
0
1
3
0
3
3
0
0
3
0
0
0
0
3
3
3
3
0
3
3
3
0
0
0
3
0
0
0
3
3
3
0
3
3
3
0
3
3
0
0
0
0
3
1
3
0
3
3
0
3
3
0
3
0
0
3
3
0
0
0
3
3
3
0
3
3
3
0
3
3
3
0
3
0
0
0
3
3
3
3
3
0
3
3
3
0
3
3
3
0
3
0
3
3
3
0
0
1
3
3
3
3
0
0
3
0
3
0
3
3
3
0
0
3
0
0
3
0
3
3
3
0
3
3
3
3
3
3
3
0
3
0
3
0
3
3
0
0
3
0
3
3
3
0
3
3
3
0
3
3
3
3
3
0
3
0
3
3
0
0
3
3
3
1
3
3
3
3
0
0
3
0
3
0
3
3
3
0
0
3
3
3
3
0
3
0
0
0
3
3
3
3
3
3
3
0
3
3
3
0
3
0
3
0
3
3
0
0
3
3
3
3
3
3
3
3
3
0
3
3
3
3
3
3
3
3
3
0
3
0
3
3
3
0
3
3
3
0
3
3
3
1
3
0
3
3
3
0
3
0
3
0
0
3
3
3
0
3
3
0
3
0
3
0
0
0
3
0
3
3
3
3
3
3
3
3
3
3
3
3
3
0


Fixed submission (verdict: Accepted):
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 or y==z:
        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)
Problem: p02608
Buggy submission (Python (3.8.2), verdict: 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])

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
250939
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Fixed submission (verdict: Accepted):
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)
C = collections.Counter(l)
for j in range(1,n+1):
    print(C[j])
Problem: p02608
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
import itertools
import math
import fractions
import functools
import copy
from collections import deque
from functools import reduce
from decimal import Decimal


def main():
    n = int(input())
    l = [0]*(n+1)
    for x in range(101):
        for y in range(101):
            for z in range(101):
                temp = x**2 + y**2 + z**2 + x*y + y*z + z*x
                if temp <= n:
                    l[temp] += 1

    for i in range(1, n+1):
        print(l[i])


if __name__ == '__main__':
    main()


Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
3
0
3
3
0
1
6
0
3
0
3
3
6
0
0
3
3
3
6
0
6
0
0
1
9
0
6
6
0
0
6
0
3
3
6
3
6
3
6
0
0
0
9
3
6
0
6
3
9
0
3
6
0
1
6
0
12
6
0
0
12
0
6
3
0
3
9
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
9
6
6
3
6
0
3
6
12
0
6
0
6
1
12
0
6
9
0
3
18
0
6
0
0
6
12
0
6
6
3
3
12
0
12
3
6
0
6
6
9
6
6
0
6
0
9
6
3
3
18
0
6
3
12
0
9
6
6
0
6
3
6
3
15
6
0
1
12
3
12
6
0
6
18
0
6
0
6
6
18
0
0
6
0
0
15
0
18
9
6
0
12
3
9
6
3
6
12
0
12
0
6
0
15
6
6
0
6
3
9
3
12
9
12
6
12
0
9
6
6
3
12
0
6
6
9
6
6
0
6
3
12
1
18
6
12
6
0
0
24
0
15
0
3
12
18
0
0
6
3
6
12
0
18
0
0
0
15
3
12
12
12
3
24
0
3
6
6
6
12
0
12
3
9
9
12
0
6
3
6
3
12
6
9
9
6
0
18
3
18
3
9
6
18
6
12
0
6
0
15
6
6
0
12
3
9
0
15
12
6
1
6
0
21
12
6
3
24
0
12
6
0
6
21
6
6
6
12
0
18
0
12
6
0
0
12
0
12
12
3
6
24
3
12
3
6
6
15
9
24
0


Fixed submission (verdict: Accepted):
import itertools
import math
import fractions
import functools
import copy
from collections import deque
from functools import reduce
from decimal import Decimal


def main():
    n = int(input())
    l = [0]*(n+1)
    for x in range(1,101):
        for y in range(1,101):
            for z in range(1,101):
                temp = x**2 + y**2 + z**2 + x*y + y*z + z*x
                if temp <= n:
                    l[temp] += 1

    for i in range(1, n+1):
        print(l[i])


if __name__ == '__main__':
    main()
Problem: p02608
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
from itertools import combinations
N=int(input())
ans=[0]*(10**5)
for x in range(1,N+1):
    if x**2>N:
        break
    for y in range(x,N+1):
        if x**2+y**2>N:
            break
        for z in range(y,N+1):
            if x**2+y**2+z**2>N:
                break
            if x**2+y**2+z**2+x*y+y*z+z*x<=N+1:
                kari=[x,y,z]
                ans[x**2+y**2+z**2+x*y+y*z+z*x-1]=len(list(combinations(kari,2)))
if N>=6:
    ans[5]=1
for i in range(N):
    print(ans[i])

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
3
3
0
3
0
0
0
0
0
3
3
3
0
0
3
0
0
0
0
3
3
3
0
3
0
0
0
3
0
0
3
3
0
3
3
0
0
3
0
0
0
0
3
3
3
3
0
3
3
3
0
0
0
3
0
0
0
3
3
3
0
3
3
3
0
3
3
0
0
0
0
3
3
3
0
3
3
0
3
3
0
3
0
0
3
3
0
0
0
3
3
3
0
3
3
3
0
3
3
3
0
3
0
0
0
3
3
3
3
3
0
3
3
3
0
3
3
3
0
3
0
3
3
3
0
0
3
3
3
3
3
0
0
3
0
3
0
3
3
3
0
0
3
0
0
3
0
3
3
3
0
3
3
3
3
3
3
3
0
3
0
3
0
3
3
0
0
3
0
3
3
3
0
3
3
3
0
3
3
3
3
3
0
3
0
3
3
0
0
3
3
3
3
3
3
3
3
0
0
3
0
3
0
3
3
3
0
0
3
3
3
3
0
3
0
0
0
3
3
3
3
3
3
3
0
3
3
3
0
3
0
3
0
3
3
0
0
3
3
3
3
3
3
3
3
3
0
3
3
3
3
3
3
3
3
3
0
3
0
3
3
3
0
3
3
3
0
3
3
3
3
3
0
3
3
3
0
3
0
3
0
0
3
3
3
0
3
3
0
3
0
3
0
0
0
3
0
3
3
3
3
3
3
3
3
3
3
3
3
3
0


Fixed submission (verdict: Accepted):
from itertools import permutations
N=int(input())
ans=[0]*(10**6)
for x in range(1,N+1):
    if x**2>N:
        break
    for y in range(1,N+1):
        if x**2+y**2>N:
            break
        for z in range(1,N+1):
            if x**2+y**2+z**2>N:
                break
            else:
                kari=[x,y,z]
                
                if x**2+y**2+z**2+x*y+y*z+z*x<=10**5:
                    ans[x**2+y**2+z**2+x*y+y*z+z*x-1]+=1
                    
for i in range(N):
    print(ans[i])
Problem: p02608
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):

import itertools
import math

N = int(input())
saidai = int(math.sqrt(N)) + 1

def g(x, y, z):
    return x**2 + y**2 + z**2 + x*y + y*z + z*x

def f(n):
    result = [0] * (n+1)
    for idx, (x, y, z) in enumerate(itertools.product("".join(map(str, (range(1, saidai + 1)))), repeat=3)):
        tmp = g(int(x), int(y), int(z))
        if tmp <= N:
            result[tmp] += 1
    return result

res = f(N)
for i in range(1, N+1):
    print(res[i])




Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
36
0
432
6
0
1728
144
0
6
0
864
12
144
0
0
6
144
864
24
0
144
0
0
8
294
0
876
24
0
0
144
0
24
144
288
6
24
864
24
0
0
0
168
24
288
0
288
12
30
0
864
24
0
8
48
0
312
288
0
0
312
0
24
6
0
864
48
24
48
0
288
24
432
0
12
24
288
0
24
0
30
24
912
24
48
144
288
0
24
288
168
0
24
0
288
8
72
0
48
48
0
864
360
0
288
0
0
36
312
0
0
24
24
24
336
0
72
24
48
0
144
288
48
0
288
0
24
0
48
288
24
24
72
0
48
24
48
0
24
48
288
0
288
0
48
0
300
24
0
8
72
0
48
48
0
0
96
0
48
0
0
168
336
0
0
288
0
0
24
0
48
24
48
0
48
24
48
0
24
48
48
0
48
0
288
0
288
0
0
0
0
12
48
24
48
0
48
24
48
0
24
48
48
0
48
0
0
0
144
288
0
0
0
0
0
8
72
0
48
48
0
0
96
0
48
0
0
24
48
0
0
0
0
0
288
0
0
0
0
0
24
24
60
0
48
24
48
0
24
48
0
0
0
0
48
0
0
0
0
0
0
144
0
0
0
0
24
24
48
0
48
24
48
0
0
0
48
0
0
0
0
0
24
0
0
0
0
0
0
0
0
0
0
8
48
0
48
48
0
0
48
0
0
0
0
24
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
24
24
48
0
48
0
0
0
24
0
0
0


Fixed submission (verdict: Accepted):

import itertools
import math

N = int(input())
saidai = int(math.sqrt(N)) + 1

def g(x, y, z):
    return x**2 + y**2 + z**2 + x*y + y*z + z*x

def f(n):
    result = [0] * (n+1)
    for idx, (x, y, z) in enumerate(itertools.product(range(1, saidai + 1), repeat=3)):
        tmp = g(int(x), int(y), int(z))
        if tmp <= N:
            result[tmp] += 1
    return result

res = f(N)
for i in range(1, N+1):
    print(res[i])
Problem: p02608
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
n = int(input())
ans = [0 for _ in range(10**4 + 100)]
for x in range(1, 100):
    for y in range(1, 100):
        for z in range(1, 100):
            p = x**2 + y**2 + z**2 + x * y + y * z + z * x
            if p <= 10**4:
                ans[p] += 1
for i in range(n + 1):
    print(ans[i])

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Fixed submission (verdict: Accepted):
n = int(input())
ans = [0 for _ in range(10**5)]
for x in range(1, 100):
    for y in range(1, 100):
        for z in range(1, 100):
            p = x**2 + y**2 + z**2 + x * y + y * z + z * x
            if p <= 10**4:
                ans[p] += 1
for i in range(1, n + 1):
    print(ans[i])
Problem: p02608
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
from itertools import combinations_with_replacement
from math import sqrt


n = int(input())
ans = [0] * (n + 1)
for x, y, z in combinations_with_replacement(range(1, int(sqrt(n))), 3):
    i = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
    if i <= n:
        if x == y == z:
            ans[i] += 1
        else:
            ans[i] += 3

for i in range(1, n + 1):
    print(ans[i])


Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
3
0
3
0
0
0
0
0
3
3
3
0
0
3
0
0
0
0
3
3
3
0
3
0
0
0
3
0
0
1
3
0
6
3
0
0
3
0
0
0
0
3
3
3
3
0
3
3
3
0
0
0
3
0
0
0
3
3
6
0
3
3
3
0
3
3
0
0
0
0
3
1
3
0
6
3
0
3
6
0
3
0
0
3
3
0
0
0
3
3
6
0
3
3
3
0
3
3
6
0
3
0
0
0
3
3
3
3
3
0
3
3
6
0
3
3
3
0
3
0
3
3
3
0
0
1
3
3
9
3
0
0
6
0
3
0
3
6
6
0
0
3
0
0
3
0
9
3
3
0
3
3
6
3
3
3
3
0
3
0
3
0
9
3
0
0
3
0
3
3
6
0
6
6
3
0
3
3
3
3
6
0
3
0
6
3
0
0
3
3
6
1
3
3
6
3
0
0
9
0
6
0
3
6
6
0
0
3
3
3
6
0
6
0
0
0
6
3
6
3
6
3
6
0
3
3
3
0
6
0
6
0
6
6
0
0
3
3
3
3
6
3
6
3
3
0
6
3
3
3
6
3
6
3
3
0
3
0
6
3
3
0
6
3
3
0
6
3
3
1
3
0
15
6
3
0
6
0
6
0
0
6
9
3
0
3
6
0
6
0
6
0
0
0
6
0
9
6
3
3
9
3
3
3
3
3
6
6
9
0


Fixed submission (verdict: Accepted):
from itertools import combinations, combinations_with_replacement
from math import sqrt


n = int(input())
ans = [0] * (n + 1)
for x, y, z in combinations_with_replacement(range(1, int(sqrt(n))), 3):
    i = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
    if i <= n:
        if x == y == z:
            ans[i] += 1
        elif all([(s != t) for s, t in combinations([x, y, z], 2)]):
            ans[i] += 6
        else:
            ans[i] += 3

for i in range(1, n + 1):
    print(ans[i])
Problem: p02608
Buggy submission (Python (3.8.2), verdict: 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])

Failing test case input:
334

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0


Actual output:
0
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18


Fixed submission (verdict: Accepted):
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]+=1
for o in range(n):
   print(y[o])