# LeetCode - 1925. Count Square Sum Triples
### 題目網址：https://leetcode.com/problems/count-square-sum-triples/
###### tags: `LeetCode` `Easy` `數學`

/*
    -LeetCode format-
    Problem: 1925. Count Square Sum Triples
    Difficulty: Easy
    
    by Inversionpeter
*/



class Solution {
public:
    int countTriples(int n) {
        int counts = 0, k;
        for (int i = 3; i <= n; ++i)
            for (int j = i + 1; j <= n; ++j) {
                k = sqrt(i * i + j * j);
                if (k <= n && i * i + j * j == k * k)
                    ++counts;
            }
        return counts << 1;
    }
};