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

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define ull unsigned long long int
#define ld long double
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define prec(x) fixed << setprecision(15) << x
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define rev(x) reverse(x.begin(), x.end())
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
#define fo0(i, n) for (int i = 0, i##end = n; i < i##end; i++)
#define fo1(i, n) for (int i = 1, i##end = n; i <= i##end; i++)
#define fo(i, a, b) for (int i = a, i##end = b; i <= i##end; i++)
#define foe(i, x) for (__typeof((x).end()) i = (x).begin(); i != (x).end(); ++i)
#define fre(i, x)                                                              \\
  for (__typeof((x).rend()) i = (x).rbegin(); i != (x).rend(); ++i)
#define mk(arr, n, type) type *arr = new type[n];
#define dbg(x) cerr << #x << " is " << x << endl;
#define FAST_IO                                                                \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    pbds;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
clock_t beg = clock();
const int inf = 1e18;
const int mod = 1e9 + 7;
const int N = 2e5 + 9;
const double pi = 3.1415926535897932384626433;
void FILE_IO() {
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}
int dp[100005];
void calculate() {
  for (int i = 1; i <= 101; i++) {
    for (int j = 1; j <= 101; j++) {
      for (int k = 1; k <= 101; k++) {
        int temp = i * i + j * j + k * k + i * j + j * k + i * k;
        if (temp < 100005) {
          dp[temp]++;
        }
      }
    }
  }
}
void JH() {
  int d = 0, e = 0, f = 0, g = 0, p = 0, w = 0, flag = 0, ans = 0, res = 0,
      cnt = 0, sum = 0;
  double f1 = 0.0, f2 = 0.0, f3 = 0.0;
  calculate();
  int n;
  cin >> n;
  fo1(i, n) { cout << dp[i] << endl; }
}

int32_t main() {
  FILE_IO();
  FAST_IO;
  int t = 1;
  // cin>>t;
  while (t--) {
    JH();
  }
  cerr << fixed << setprecision(3) << (double)(clock() - beg) / 1000 << "s ";
}

Error: -11

Fixed submission:

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define ull unsigned long long int
#define ld long double
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define prec(x) fixed << setprecision(15) << x
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define rev(x) reverse(x.begin(), x.end())
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
#define fo0(i, n) for (int i = 0, i##end = n; i < i##end; i++)
#define fo1(i, n) for (int i = 1, i##end = n; i <= i##end; i++)
#define fo(i, a, b) for (int i = a, i##end = b; i <= i##end; i++)
#define foe(i, x) for (__typeof((x).end()) i = (x).begin(); i != (x).end(); ++i)
#define fre(i, x)                                                              \\
  for (__typeof((x).rend()) i = (x).rbegin(); i != (x).rend(); ++i)
#define mk(arr, n, type) type *arr = new type[n];
#define dbg(x) cerr << #x << " is " << x << endl;
#define FAST_IO                                                                \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    pbds;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
clock_t beg = clock();
const int inf = 1e18;
const int mod = 1e9 + 7;
const int N = 2e5 + 9;
const double pi = 3.1415926535897932384626433;
void FILE_IO() {
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}
int dp[105];
void calculate() {
  for (int i = 1; i <= 101; i++) {
    for (int j = 1; j <= 101; j++) {
      for (int k = 1; k <= 101; k++) {
        int temp = i * i + j * j + k * k + i * j + j * k + i * k;
        if (temp < 101) {
          dp[temp]++;
        }
      }
    }
  }
}
void JH() {
  int d = 0, e = 0, f = 0, g = 0, p = 0, w = 0, flag = 0, ans = 0, res = 0,
      cnt = 0, sum = 0;
  double f1 = 0.0, f2 = 0.0, f3 = 0.0;
  calculate();
  int n;
  cin >> n;
  fo1(i, n) { cout << dp[i] << endl; }
}

int32_t main() {
  FILE_IO();
  FAST_IO;
  int t = 1;
  // cin>>t;
  while (t--) {
    JH();
  }
  cerr << fixed << setprecision(3) << (double)(clock() - beg) / 1000 << "s ";
}