Submission #15185796

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
using ll = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;

int main() {
  int n; cin >> n;
  vector<int> ans(10050);
  for(int x = 1; x < 106; x++) {
    for(int y = 1; y < 106; y++) {
      for(int z = 1; z < 106; z++) {
        int t = x * x + y * y + z * z + x * y + y * z + z * x;
        if (t < 10050) {
          ans[t]++;
        }
      }
    }
  }
  for(int i = 1; i <= n; i++) {
    cout << ans[i] << endl;
  }
}

Submission Info

Judge Result