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
50
51
52
53
#include <bits/stdc++.h>

using namespace std;

int main(){
    
    
    int n, c1, c2;
    int* arr;
    long long result;
    
    int* sqrSum;
    
    cin >> n;
    
    arr = new int[n + 1];
    
    sqrSum = new int[2 * n * n + n];
    
    for(int i = 1; i <= n; ++i){
        arr[i] = i * i;
    }
    
    
    for(int j = 0; j < n * n + n; ++j){
        sqrSum[j] = 0;
    }
    
    for(int i = 1; i <= n; ++i){
        for(int j = i; j <=n; ++j){
            sqrSum[i * i + j * j]++;
        }
    }
    
    
    result = 0;
    
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j < i; ++j){
            // if(sqrSum.count(arr[i] - arr[j]){
                // cout << i << ' ' << j << ' ' << arr[i] - arr[j] << '\n';
            result += sqrSum[arr[i] - arr[j]];
            // }
        }
    }
    
    cout << result << '\n';
    
    delete [] arr;
    delete [] sqrSum;
    
    return 0;
}