Problem p02608 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define REP(i, x, n) for (ll i = x; i < n; i++)
#define SZ(v) (ll) v.size()
#define endl "\n"
#define ff first
#define ss second
#define PQ_MIN priority_queue<ll, vector<ll>, greater<ll>>
#define PQ priority_queue<int>
#define pbds                                                                   \
  tree<int, null_type, less<int>, rb_tree_tag,                                 \
       tree_order_statistics_node_update>
#define setbit(x) __builtin_popcount(x)
#define prec(n) fixed << setprecision(n)
#define pb(n) push_back(n)
#define clr(n) memset(n, 0, sizeof(n))
#define reset(n) memset(n, -1, sizeof(n))
#define ii pair<ll, ll>
#define vll vector<ll>

using namespace std;
using namespace __gnu_pbds;
bool comp(pair<ll, ll> a, pair<ll, ll> b) {}
const ll INF = 1e16;
const ll MOD = 5;
const ll nxm = 1e6 + 5;
vector<ll> allprime;
bool isprime[nxm];
void sieve() {
  memset(isprime, 1, sizeof(isprime));
  for (ll i = 2; i < nxm; i++) {
    if (isprime[i])
      for (ll j = i * i; j < nxm; j += i) {
        isprime[j] = 0;
      }
  }
  for (ll i = 2; i < nxm; i++)
    if (isprime[i])
      allprime.push_back(i);
}
void print(vector<vector<ll>> &v) {
  ll n = v.size();
  ll m = v[0].size();
  cout << "\n";
  for (ll i = 0; i < n; i++) {
    for (ll j = 0; j < m; j++)
      cout << v[i][j] << " ";
    cout << "\n";
  }
}
void print(vector<ll> &v) {
  ll n = v.size();
  cout << "\n";
  for (ll i = 0; i < n; i++) {
    cout << v[i] << " ";
  }
  cout << "\n";
}
void print(set<ll> &s) {

  cout << endl;

  set<ll>::iterator it;
  for (it = s.begin(); it != s.end(); it++)
    cout << *it << " ";
  cout << endl;
}

ll power(ll a, ll p) {
  ll res = 1;
  while (p > 0) {
    if (p & 1) {
      res = (res * a) % MOD;
      p--;
    }
    a = (a * a) % MOD;
    p /= 2;
  }

  return res % MOD;
}
ll __lcm(ll a, ll b) { return ((a * b) / __gcd(a, b)); }
ll fact(ll a) {
  ll res = 1;
  for (ll i = 1; i <= a; i++)
    res *= i;
  return res;
}
ll sqroot[nxm];
ll perfect_square() {
  memset(sqroot, -1, sizeof(sqroot));
  for (ll i = 1; i * i <= nxm; i++) {
    sqroot[(i * i)] = i;
  }
}
bool is_prime(ll n) {
  for (ll i = 2; i * i <= n; i++)
    if (n % i == 0)
      return false;
  return true;
}
const ll ind = 1e4 + 5;
ll a[ind];
void solve() {
  ll n;
  cin >> n;
  for (ll i = 1; i < n; i++)
    for (ll j = 1; j < n; j++)
      for (ll k = 1; k < n; k++) {
        ll val = i * i + j * j + k * k + i * j + j * k + k * i;
        if (val < ind)
          a[val]++;
      }
  REP(i, 1, n + 1)
  cout << a[i] << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ll t = 1;
  //	cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define REP(i, x, n) for (ll i = x; i < n; i++)
#define SZ(v) (ll) v.size()
#define endl "\n"
#define ff first
#define ss second
#define PQ_MIN priority_queue<ll, vector<ll>, greater<ll>>
#define PQ priority_queue<int>
#define pbds                                                                   \
  tree<int, null_type, less<int>, rb_tree_tag,                                 \
       tree_order_statistics_node_update>
#define setbit(x) __builtin_popcount(x)
#define prec(n) fixed << setprecision(n)
#define pb(n) push_back(n)
#define clr(n) memset(n, 0, sizeof(n))
#define reset(n) memset(n, -1, sizeof(n))
#define ii pair<ll, ll>
#define vll vector<ll>

using namespace std;
using namespace __gnu_pbds;
bool comp(pair<ll, ll> a, pair<ll, ll> b) {}
const ll INF = 1e16;
const ll MOD = 5;
const ll nxm = 1e6 + 5;
vector<ll> allprime;
bool isprime[nxm];
void sieve() {
  memset(isprime, 1, sizeof(isprime));
  for (ll i = 2; i < nxm; i++) {
    if (isprime[i])
      for (ll j = i * i; j < nxm; j += i) {
        isprime[j] = 0;
      }
  }
  for (ll i = 2; i < nxm; i++)
    if (isprime[i])
      allprime.push_back(i);
}
void print(vector<vector<ll>> &v) {
  ll n = v.size();
  ll m = v[0].size();
  cout << "\n";
  for (ll i = 0; i < n; i++) {
    for (ll j = 0; j < m; j++)
      cout << v[i][j] << " ";
    cout << "\n";
  }
}
void print(vector<ll> &v) {
  ll n = v.size();
  cout << "\n";
  for (ll i = 0; i < n; i++) {
    cout << v[i] << " ";
  }
  cout << "\n";
}
void print(set<ll> &s) {

  cout << endl;

  set<ll>::iterator it;
  for (it = s.begin(); it != s.end(); it++)
    cout << *it << " ";
  cout << endl;
}

ll power(ll a, ll p) {
  ll res = 1;
  while (p > 0) {
    if (p & 1) {
      res = (res * a) % MOD;
      p--;
    }
    a = (a * a) % MOD;
    p /= 2;
  }

  return res % MOD;
}
ll __lcm(ll a, ll b) { return ((a * b) / __gcd(a, b)); }
ll fact(ll a) {
  ll res = 1;
  for (ll i = 1; i <= a; i++)
    res *= i;
  return res;
}
ll sqroot[nxm];
ll perfect_square() {
  memset(sqroot, -1, sizeof(sqroot));
  for (ll i = 1; i * i <= nxm; i++) {
    sqroot[(i * i)] = i;
  }
}
bool is_prime(ll n) {
  for (ll i = 2; i * i <= n; i++)
    if (n % i == 0)
      return false;
  return true;
}
const ll ind = 1e4 + 5;
ll a[ind];
void solve() {
  ll n;
  cin >> n;
  for (ll i = 1; i < n; i++)
    for (ll j = 1; j < n; j++)
      for (ll k = 1; k < n; k++) {
        ll val = i * i + j * j + k * k + i * j + j * k + k * i;
        if (val < ind)
          a[val]++;
        else
          break;
      }
  REP(i, 1, n + 1)
  cout << a[i] << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ll t = 1;
  //	cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}