Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [0]*n
cnt = 0
for i in range(1,int((n-3)**1/2 //1)):
  for j in range(1,int((n-i**2)**1/2 //1)):
    for k in range(1,int((n-i**2-j**2)**1/2 //1)):
      b = i**2 + j**2 + k**2 + i*j + j*k + k*i
      if b <= n:
        a[b-1] += 1

for i in a:
  print(i)

Fixed submission:
n = int(input())
a = [0]*n
cnt = 0
for i in range(1,100):
  for j in range(1,100):
    for k in range(1,100):
      b = i**2 + j**2 + k**2 + i*j + j*k + k*i
      if b <= n:
        a[b-1] += 1

for i in a:
  print(i)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [0]*n
cnt = 0
for i in range(1,int((n-3)**1/2 //1)):
  for j in range(1,int((n-i**2)**1/2 //1)):
    for k in range(1,int((n-i**2-j**2)**1/2 //1)):
      b = i**2 + j**2 + k**2 + i*j + j*k + k*i
      if b <= n:
        a[b-1] += 1

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



Fixed submission:
n = int(input())
a = [0]*n
cnt = 0
for i in range(1,100):
  for j in range(1,100):
    for k in range(1,100):
      b = i**2 + j**2 + k**2 + i*j + j*k + k*i
      if b <= n:
        a[b-1] += 1

for i in a:
  print(i)

Buggy python submission (verdict: Time Limit Exceeded):
def f(n):
  cnt = 0
  for i in range(int((n-3)**1/2 //1)):
    for j in range(int((n-i**2)**1/2 //1)):
      for k in range(int((n-i**2-j**2)**1/2 //1)):
        if (i+1)**2 + (j+1)**2 + (k+1)**2 + (i+1)*(j+1) + (j+1)*(k+1) + (k+1)*(i+1) == n:
          cnt += 1
  return cnt
    
N = int(input())
for i in range(N):
  print(f(i+1))

Fixed submission:
n = int(input())
a = [0]*n
cnt = 0
for i in range(1,100):
  for j in range(1,100):
    for k in range(1,100):
      b = i**2 + j**2 + k**2 + i*j + j*k + k*i
      if b <= n:
        a[b-1] += 1

for i in a:
  print(i)

Buggy python submission (verdict: Time Limit Exceeded):
def f(n):
  cnt = 0
  for i in range(int((n-3)**1/2 //1)):
    for j in range(int((n-3)**1/2 //1)):
      for k in range(int((n-3)**1/2 //1)):
        if (i+1)**2 + (j+1)**2 + (k+1)**2 + (i+1)*(j+1) + (j+1)*(k+1) + (k+1)*(i+1) == n:
          cnt += 1
  return cnt
    
N = int(input())
for i in range(N):
  print(f(i+1))

Fixed submission:
n = int(input())
a = [0]*n
cnt = 0
for i in range(1,100):
  for j in range(1,100):
    for k in range(1,100):
      b = i**2 + j**2 + k**2 + i*j + j*k + k*i
      if b <= n:
        a[b-1] += 1

for i in a:
  print(i)

Buggy python submission (verdict: Time Limit Exceeded):
def f(n):
  cnt = 0
  for i in range(n):
    for j in range(n):
      for k in range(n):
        if (i+1)**2 + (j+1)**2 + (k+1)**2 + (i+1)*(j+1) + (j+1)*(k+1) + (k+1)*(i+1) == n:
          cnt += 1
  return cnt
    
N = int(input())
for i in range(N):
  print(f(i+1))

Fixed submission:
n = int(input())
a = [0]*n
cnt = 0
for i in range(1,100):
  for j in range(1,100):
    for k in range(1,100):
      b = i**2 + j**2 + k**2 + i*j + j*k + k*i
      if b <= n:
        a[b-1] += 1

for i in a:
  print(i)

Buggy python submission (verdict: Time Limit Exceeded):
def f(n):
  cnt = 0
  for i in range(int(n**1/2 // 1)):
    for j in range(int(((2*n)**1/2-i)//1)):
      for k in range(int(((2*n)**1/2-i)//1)):
        if (i+1)**2 + (j+1)**2 + (k+1)**2 + (i+1)*(j+1) + (j+1)*(k+1) + (k+1)*(i+1) == n:
          cnt += 1
  return cnt
    
N = int(input())
for i in range(N):
  print(f(i+1))

Fixed submission:
n = int(input())
a = [0]*n
cnt = 0
for i in range(1,100):
  for j in range(1,100):
    for k in range(1,100):
      b = i**2 + j**2 + k**2 + i*j + j*k + k*i
      if b <= n:
        a[b-1] += 1

for i in a:
  print(i)

Buggy python submission (verdict: Time Limit Exceeded):
def f(n):
  cnt = 0
  for i in range(int(n**1/2 // 1)):
    for j in range(i+1):
      for k in range(j+1):
        if (i+1)**2 + (j+1)**2 + (k+1)**2 + (i+1)*(j+1) + (j+1)*(k+1) + (k+1)*(i+1) == n and i==j==k:
          cnt += 1
        if (i+1)**2 + (j+1)**2 + (k+1)**2 + (i+1)*(j+1) + (j+1)*(k+1) + (k+1)*(i+1) == n and i==j and i!=k:
          cnt += 3
        if (i+1)**2 + (j+1)**2 + (k+1)**2 + (i+1)*(j+1) + (j+1)*(k+1) + (k+1)*(i+1) == n and j==k and j!=i:
          cnt += 3
        if (i+1)**2 + (j+1)**2 + (k+1)**2 + (i+1)*(j+1) + (j+1)*(k+1) + (k+1)*(i+1) == n and k==i and k!=j:
          cnt += 3
        if (i+1)**2 + (j+1)**2 + (k+1)**2 + (i+1)*(j+1) + (j+1)*(k+1) + (k+1)*(i+1) == n and i!=j!=k:
          cnt += 6
  return cnt
      
  
N = int(input())
for i in range(N):
  print(f(i+1))

Fixed submission:
n = int(input())
a = [0]*n
cnt = 0
for i in range(1,100):
  for j in range(1,100):
    for k in range(1,100):
      b = i**2 + j**2 + k**2 + i*j + j*k + k*i
      if b <= n:
        a[b-1] += 1

for i in a:
  print(i)

Buggy python submission (verdict: Time Limit Exceeded):
def f(n):
  cnt = 0
  for i in range(int(n**1/2 // 1)):
    for j in range(int((n-i**2)**1/2 // 1)):
      for k in range(int((n-i**2-j**2)**1/2 // 1)):
        if (i+1)**2 + (j+1)**2 + (k+1)**2 + (i+1)*(j+1) + (j+1)*(k+1) + (k+1)*(i+1) == n:
          cnt += 1
  return cnt
      
  
N = int(input())
for i in range(N):
  print(f(i+1))

Fixed submission:
n = int(input())
a = [0]*n
cnt = 0
for i in range(1,100):
  for j in range(1,100):
    for k in range(1,100):
      b = i**2 + j**2 + k**2 + i*j + j*k + k*i
      if b <= n:
        a[b-1] += 1

for i in a:
  print(i)

Buggy python submission (verdict: Time Limit Exceeded):
def f(n):
  cnt = 0
  for i in range(int(n**1/2 // 1)):
    for j in range(int(n**1/2 // 1)):
      for k in range(int(n**1/2 // 1)):
        if (i+1)**2 + (j+1)**2 + (k+1)**2 + (i+1)*(j+1) + (j+1)*(k+1) + (k+1)*(i+1) == n:
          cnt += 1
  return cnt
      
  
N = int(input())
for i in range(N):
  print(f(i+1))

Fixed submission:
n = int(input())
a = [0]*n
cnt = 0
for i in range(1,100):
  for j in range(1,100):
    for k in range(1,100):
      b = i**2 + j**2 + k**2 + i*j + j*k + k*i
      if b <= n:
        a[b-1] += 1

for i in a:
  print(i)