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
48
49
#include <bits/stdc++.h>


using namespace std;

const int N = 5004;

vector<pair<int,int>> suma_dwoch[N*N];

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

    int n;
    cin >> n;

    for(int a = 1; a <= n; a++) {
        for(int b = a; a*a + b*b <= n*n; b++) {
            suma_dwoch[a*a + b*b].push_back({a, b});
        }
    }

    int count = 0;

    for(int k = 1; k <= n; k++) {
        for(int h = 1; h <= k; h++) {
            for(auto [a, b] : suma_dwoch[k*k - h*h]) {
                if(b <= h) {
                    if(a < b && b < h) {
                        count += 3;
                    }
                    else if(a < b && b == h) {
                        count += 2;
                    }
                    else if(a == b && b < h) {
                        count += 2;
                    }
                    else {
                        count++;
                    }
                }
            }
        }
    }

    cout << count << '\n';

    return 0;
}