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
51
52
53
#include<iostream>
#include<cmath>
using namespace std;

constexpr int MAXN = 5e3+3;
int kwadraty[MAXN];

int bin_search(int left, int right, int x)
{
    int mid;
    while(left<=right)
    {
        mid=(left+right)/2;
        if(kwadraty[mid]==x)
            return mid;
        else if(kwadraty[mid]<x)
            left=mid+1;
        else right = mid-1;
    }
    return -1;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    for(int i=1; i<MAXN; i++)
        kwadraty[i] = i*i;
    int res=0;
    for(int i=1; i<n; i++)
    {
        for(int j=i; j<n; j++)
        {
            for(int k=j; k<n; k++)
            {
                int a = kwadraty[i], b = kwadraty[j], c = kwadraty[k];
                int pom = int(sqrt(a+b+c));
                if(pom<=n && pom*pom==a+b+c)
                {
                    if(a==b && b==c)
                        res++;
                    else if(a==c || c==b || b==a)
                        res+=2;
                    else res+=3;
                }
            }
        }
    }
    cout << res;
    return 0;
}