Formatted question description: https://leetcode.ca/all/1925.html

# 1925. Count Square Sum Triples

## Level

Easy

## Description

A **square triple** `(a,b,c)`

is a triple where `a`

, `b`

, and `c`

are integers and `a^2 + b^2 = c^2`

.

Given an integer `n`

, return *the number of square triples such that 1 <= a, b, c <= n*.

**Example 1:**

**Input:** n = 5

**Output:** 2

**Explanation:** The square triples are (3,4,5) and (4,3,5).

**Example 2:**

**Input:** n = 10

**Output:** 4

**Explanation:** The square triples are (3,4,5), (4,3,5), (6,8,10), and (8,6,10).

**Constraints:**

`1 <= n <= 250`

## Solution

Loop over `a`

, `b`

and `c`

and count the number of square triples.

```
class Solution {
public int countTriples(int n) {
int count = 0;
for (int a = 1; a <= n; a++) {
for (int b = 1; b <= n; b++) {
for (int c = Math.max(a, b) + 1; c <= n; c++) {
if (a * a + b * b == c * c)
count++;
}
}
}
return count;
}
}
```