Problem p02608 (C++) — buggy submission, verdict: Time Limit Exceeded

#include "bits/stdc++.h"

#define REP(i, num) for (ll i = 0; i < (num); ++i)
#define FOR(i, c, num) for (ll(i) = (c); (i) < (num); ++(i))
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c)                                                            \\
  for (auto pitr = c.begin(); pitr != c.end(); ++pitr) {                       \\
    cout << *pitr;                                                             \\
    if (next(pitr, 1) != c.end())                                              \\
      cout << ' ';                                                             \\
  }                                                                            \\
  cout << endl;
#define PAIRCOMP(c, comp)                                                      \\
  [](const pair<ll, ll> &lhs, const pair<ll, ll> &rhs) {                       \\
    return lhs.c comp rhs.c;                                                   \\
  }

using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;

constexpr ll atcoder_mod = 1e9 + 7;

template <typename T = ll> T in() {
  T x;
  cin >> x;
  return (x);
}
template <typename T = ll, typename C = vector<T>> C vecin(int N) {
  C x(N);
  REP(i, N) { x[i] = in<T>(); }
  return x;
}

void vout() { cout << endl; }
template <typename Head, typename... Tail> void vout(Head &&h, Tail &&...t) {
  cout << ' ' << h;
  vout(forward<Tail>(t)...);
}
void out() { cout << endl; }
template <typename Head, typename... Tail> void out(Head &&h, Tail &&...t) {
  cout << h;
  vout(forward<Tail>(t)...);
}

template <typename T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);

  auto N = in();

  map<ll, ll> M;

  REP(x, 100) {
    REP(y, 100) {
      REP(z, 100) {
        ll xx = (x + 1) * (x + 1);
        ll xy = (x + 1) * (y + 1);
        ll xz = (x + 1) * (z + 1);
        ll yy = (y + 1) * (y + 1);
        ll yz = (y + 1) * (z + 1);
        ll zz = (z + 1) * (z + 1);
        M[xx + xy + xz + yy + yz + zz]++;
      }
    }
  }
  REP(i, N) { out(M[i + 1]); }

  return 0;
}


Error: TLE

Fixed submission:

#include "bits/stdc++.h"

#define REP(i, num) for (ll i = 0; i < (num); ++i)
#define FOR(i, c, num) for (ll(i) = (c); (i) < (num); ++(i))
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c)                                                            \\
  for (auto pitr = c.begin(); pitr != c.end(); ++pitr) {                       \\
    cout << *pitr;                                                             \\
    if (next(pitr, 1) != c.end())                                              \\
      cout << ' ';                                                             \\
  }                                                                            \\
  cout << endl;
#define PAIRCOMP(c, comp)                                                      \\
  [](const pair<ll, ll> &lhs, const pair<ll, ll> &rhs) {                       \\
    return lhs.c comp rhs.c;                                                   \\
  }

using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;

constexpr ll atcoder_mod = 1e9 + 7;

template <typename T = ll> T in() {
  T x;
  cin >> x;
  return (x);
}
template <typename T = ll, typename C = vector<T>> C vecin(int N) {
  C x(N);
  REP(i, N) { x[i] = in<T>(); }
  return x;
}

void vout() { cout << endl; }
template <typename Head, typename... Tail> void vout(Head &&h, Tail &&...t) {
  cout << ' ' << h;
  vout(forward<Tail>(t)...);
}
void out() { cout << endl; }
template <typename Head, typename... Tail> void out(Head &&h, Tail &&...t) {
  cout << h;
  vout(forward<Tail>(t)...);
}

template <typename T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);

  auto N = in();

  REP(i, N) {
    ll S = 0;
    REP(x, 100) {
      REP(y, 100) {
        REP(z, 100) {
          ll xx = (x + 1) * (x + 1);
          ll xy = (x + 1) * (y + 1);
          ll xz = (x + 1) * (z + 1);
          ll yy = (y + 1) * (y + 1);
          ll yz = (y + 1) * (z + 1);
          ll zz = (z + 1) * (z + 1);
          if (xx + xy + xz + yy + yz + zz == i + 1)
            S++;
        }
      }
    }
    out(S);
  }

  return 0;
}