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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include <bits/stdc++.h>
using namespace std;
const int s = 5001*5001;
int tab[s];
inline bool eq(vector<int>&v1,vector<int>&v2){
    if(v1.size()!=v2.size())
        return false;
    for(int i = 0;i<v1.size();i++){
        if(v1[i]!=v2[i])
            return false;
    }
    return true;
}
inline vector<vector<int>>Find(int n){
    vector<vector<int>>Ans;
    for(int i = 1;i<=n;i++){
        for(int j = i;j*j+i*i<n*n;j++){
            if(tab[n*n-i*i-j*j] != 0){
                bool ok = 1;
                vector<int>V = {i,j,tab[n*n-i*i-j*j]};
                sort(V.begin(),V.end());
                for(int k=0;k<Ans.size();k++){
                    if(eq(Ans[k],V))
                        ok=0;
                }
                if(ok)
                    Ans.push_back({i,j,tab[n*n-i*i-j*j]});
            }
        }
    }
    return Ans;
}
void print(vector<int>V){
    for(auto x:V)
        cout << x << ' ';
    cout << '\n';
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie();
    cout.tie();
    int n;
    cin >> n;
    vector<int>pier(n+1);
    int Ans = 0;
    for(int i = 1;i<=n;i++){
        pier[i] = i*i;
        tab[i*i] = i;
        vector<vector<int>>ANS = Find(i);
        for(int j=0;j<ANS.size();j++){
           // cout << "HELLO";
            vector<int>ans = ANS[j];
            //cout << "ans = ";
            //print(ans);
            if(!ans.empty()){
                if(ans[0]==ans[1]&&ans[1]==ans[2])
                     Ans++;
                else if(ans[0]==ans[1]||ans[1]==ans[2]||ans[0]==ans[2])
                    Ans+=2;
                else
                    Ans+=3;
            }
        }
    } 
    cout << Ans << '\n';
    return 0; 
}