Problem p02608 (C++) — buggy submission, verdict: Runtime Error

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include <cstdlib>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
// #define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>,
// rb_tree_tag,tree_order_statistics_node_update>
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<pair<ll, ll>> vpll;
#define Boost()                                                                \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
#define pb push_back
#define forn(i, n) for (ll i = 0; i < n; i++)
#define fo(i, n) for (ll i = 1; i <= n; i++)
#define fore(i, l, r) for (ll i = l; i <= r; i++)
#define rev(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(c) c.begin(), c.end()
#define go(c, it) for (auto it = (c).begin(); it != (c).end(); it++)
// #define back(c,it) for(auto it=(c).rbegin(); it!=(c).rend(); it++)
#define fi first
#define se second
#define MOD 998244353
#define MAX 1000000007
#define N 2000009
#define N1 100007
ll power(ll a, ll b) {
  ll res = 1;
  a = a % MOD;
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % MOD;
    }
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
ll fact[500009];
ll fermat_inv(ll y) { return power(y, MOD - 2); }
ll nCrMod(ll n, ll r) {
  ll p = fact[n];
  ll q = (fact[r] * fact[n - r]) % MOD;
  return (p * fermat_inv(q)) % MOD;
}
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
const ld PI = acos(-1.0);
vl g[N1];

int main() {
#ifndef ONLINE_JUDGE
  freopen("input.cpp", "r", stdin);
  freopen("output.cpp", "w", stdout);
#endif
  Boost();
  int t;
  // cin>>t;
  t = 1;
  int t1 = t;
  while (t--) {
    ll n;
    cin >> n;
    ll dp[2 * n + 1];
    ll i, j, k;
    memset(dp, 0, sizeof(dp));
    for (j = 1; j * j <= n; j++) {
      ll x = n - j * j;
      for (k = 1; k * k <= x; k++) {
        ll y = n - k * k - j * k;
        for (ll l = 1; l * l <= y; l++) {
          ll w = j * j + k * k + l * l + j * k + k * l + j * l;
          if (w <= n)
            dp[w]++;
        }
      }
    }
    fo(i, n) cout << dp[i] << endl;
  }

  return 0;
}

Error: -11

Fixed submission:

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include <cstdlib>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
// #define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>,
// rb_tree_tag,tree_order_statistics_node_update>
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<pair<ll, ll>> vpll;
#define Boost()                                                                \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
#define pb push_back
#define forn(i, n) for (ll i = 0; i < n; i++)
#define fo(i, n) for (ll i = 1; i <= n; i++)
#define fore(i, l, r) for (ll i = l; i <= r; i++)
#define rev(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(c) c.begin(), c.end()
#define go(c, it) for (auto it = (c).begin(); it != (c).end(); it++)
// #define back(c,it) for(auto it=(c).rbegin(); it!=(c).rend(); it++)
#define fi first
#define se second
#define MOD 998244353
#define MAX 1000000007
#define N 2000009
#define N1 100007
ll power(ll a, ll b) {
  ll res = 1;
  a = a % MOD;
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % MOD;
    }
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
ll fact[500009];
ll fermat_inv(ll y) { return power(y, MOD - 2); }
ll nCrMod(ll n, ll r) {
  ll p = fact[n];
  ll q = (fact[r] * fact[n - r]) % MOD;
  return (p * fermat_inv(q)) % MOD;
}
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
const ld PI = acos(-1.0);
vl g[N1];

int main() {
#ifndef ONLINE_JUDGE
  freopen("input.cpp", "r", stdin);
  freopen("output.cpp", "w", stdout);
#endif
  Boost();
  int t;
  // cin>>t;
  t = 1;
  int t1 = t;
  while (t--) {
    ll n;
    cin >> n;
    ll dp[2 * n + 1];
    ll i, j, k;
    memset(dp, 0, sizeof(dp));
    for (j = 1; j * j <= n; j++) {
      ll x = n - j * j;
      for (k = 1; k * k <= x; k++) {
        ll y = n - k * k - j * k;
        for (ll l = 1; l * l <= y; l++) {
          ll w = j * j + k * k + l * l + j * k + k * l + j * l;
          dp[w]++;
        }
      }
    }
    fo(i, n) cout << dp[i] << endl;
  }

  return 0;
}