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
#include <bits/stdc++.h>
using namespace std;
const int s = 5001*5001;
int tab[s];
inline vector<int>Find(int n){
    for(int i = 1;i<=n;i++){
        for(int j = i;j<=n;j++){
            if(i*i+j*j<n*n&&tab[n*n-i*i-j*j] != 0){
                return {i,j,tab[n*n-i*i-j*j]};
            }
        }
    }
    return {};
}
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<int>ans = Find(i);
        //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; 
}