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
39
40
41
42
43
44
45
46
47
48
49
50
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <iomanip>
#include <cassert>


int main()
{
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);

  int n;
  std::cin >> n;

  std::vector<int> iloscSumKwadratow(n*n, 0);

  for (int a = 1; a <= n; a++)
  {
    for (int b = a; b <= n; b++)
    {
      int suma = a * a + b * b;
      if (suma < n*n)
        iloscSumKwadratow[suma] += 1;
    }
  }
  long long result = 0;
  for (int i = 1; i < n; ++i)
  {
    for (int j = i+1; j*i < iloscSumKwadratow.size(); j++)
    {
      if (iloscSumKwadratow[j*i] == 0)
        continue;
      int pminush = j;
      int pplush = i;
      if (((pminush + pplush) & 1) == 1)
        continue;
      if (pminush == pplush)
        continue;
      int p = (pplush + pminush) / 2;
      if (p<=n)
        result+= iloscSumKwadratow[j * i];
      
    }
  }

  std::cout << result;
  return 0;
}