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
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll N=5001, br=0, ans, n;
vector<ll> kwadr, odp(N+3);
vector<int> sumkw(N*N+999);
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    cin >> n;
    for (int i=1; i<=N; i++){
        kwadr.push_back(i*i);
    }
    for (int i=0; i<kwadr.size(); i++){
        for (int j=i; j<kwadr.size(); j++){
            ll z=kwadr[i]+kwadr[j];
            if (z>N*N) break;
            sumkw[z]++;
        }
    }
    for (int i=0; i<sumkw.size(); i++){
        if (sumkw[i]) br++;
    }
    
    for (int P=1; P<=N; P++){
        for (ll h=1; h<=N; h++){
            ll brak=(P*P)-(h*h);
            if (brak<=0 || brak>=sumkw.size()) continue;
            odp[P]+=sumkw[brak];
        }
    }
    for (int i=1; i<=n; i++){
        ans+=odp[i];
    }
    
    cout << ans;
    return 0;
}