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 <cmath>
#include <unordered_set>

using namespace std;

int main() {
    int n;
    cin >> n;
    int count = 0;
    
    for (int a = 1; a <= n; ++a) {
        for (int b = a; b <= n; ++b) {
            for (int h = 1; h <= n; ++h) {
                int diagonalSquared = a * a + b * b + h * h;
                int diagonal = sqrt(diagonalSquared);
                
                if (diagonal * diagonal == diagonalSquared && diagonal <= n) {
                    count++;
                }
            }
        }
    }
    
    cout << count << endl;
    return 0;
}