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

using namespace std;

int main() {
    int n;
    cin >> n;

    unordered_set<string> uniqueAquariums;

    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) {
                    string key = to_string(h) + "," + to_string(a) + "," + to_string(b);
                    uniqueAquariums.insert(key);
                }
            }
        }
    }

    cout << uniqueAquariums.size() << endl;

    return 0;
}