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
#include <bits/stdc++.h>

using namespace std;

int main()
{
    unordered_map<int, int> sq;
    int n;
    long long counter = 0;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        sq[i*i] = i;
    }
    for (n; n > 0; n--)
    {
        int nsq = n*n;
        for (int i = 1; i < n; i++)
        {
            for (int j = 1; j <= i; j++)
            {
                int zsq = nsq - i*i - j*j;
                if (sq.contains(zsq))
                {
                    counter++;
                }
            }
        }
    }
    cout << counter << endl;
    return 0;
}