1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include <bits/stdc++.h>
using namespace std;

int n;
int liczba_par[25000005], liczba_potrzebnych[25000005], suma, pocz;
long long wyn = 0;

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);

  cin >> n;
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= n; j++) {
      suma = (i * i) + (j * j);
      if (suma > n * n) break;

      liczba_par[suma]++;
    }
  }

  for (int i = n; i >= 1; i--) {
    pocz = i * i;
    for (int j = 1; j <= n; j++) {
      suma = pocz - (j * j);
      if (suma <= 0) break;

      liczba_potrzebnych[suma]++;
    }
  }

  for (int i = 1; i <= n * n; i++) {
    wyn += (long long)liczba_par[i] * (long long)liczba_potrzebnych[i];
  }

  cout<<wyn;
}