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
#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
int n;
ll maximal;
vector<ll> preFreq;
void precomputeValues()
{
    for (ll a = 1; a <= n; a++)
    {
        ll bMax = maximal - a * a;
        bMax = min(bMax, maximal);
        for (ll b = a; b * b <= bMax; b++)
        {
            ll curr = a * a + b * b;
            if(curr > maximal)
                break;
            preFreq[curr]++;
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    maximal = n * n;
    preFreq.resize(maximal + 2, 0);
    precomputeValues();
 
    ll result = 0;
    for (ll currWynik = 1; currWynik <= n; currWynik++)
    {
        ll wynikSquare = currWynik * currWynik;
        for (ll h = 1; h <= currWynik; h++)
        {
            ll diff = wynikSquare - h * h;
            if(diff > 0 && diff <= maximal)
                result += preFreq[diff];
        }
    }
 
    cout << result << '\n';
    return 0;
}