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
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

const int N = 25e6 + 5;

vector<ll> Squares;
ll Ways[N];

void Preprocess()
{
    for(ll i = 1; i <= 5000; i++)
        Squares.push_back({i*i});
    
    for(int i = 0; i < Squares.size(); i++) {
        for(int j = i; j < Squares.size(); j++) {
            ll a = Squares[i], b = Squares[j];

            if(a + b < N)
                Ways[a+b]++;
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    Preprocess();

    int n;
    cin >> n;

    ll sol = 0;
    for(ll i = 1; i <= n; i++) {
        ll val = i*i;
        for(auto h : Squares) {
            if(h > val)
                break;
            sol += Ways[val - h];
        }
    }
    cout << sol << "\n";
    return 0;
}