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
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
const int s = 25'000'005;
ll pary[s];
void f() {
    //input
    ll n, ans = 0; cin >> n;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            ans += pary[i * i - j * j];
        }
        for (int j = 1; j <= i; j++) {
            if (i * i + j * j <= s) pary[i * i + j * j] ++;
        }
    }
    cout << ans;
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    f();
}