A square triple (a,b,c) is a triple where a, b, and c are integers and a² + b² = c².
Given an integer n, return the number of square triples such that 1 <= a, b, c <= n.
Use three nested loops to iterate over all possible values of a, b, and c from 1 to n. For each combination, check if a² + b² equals c². If so, increment the count.
This brute force approach is feasible since n is small (up to 250), resulting in at most 250³ = 15,625,000 operations, which is acceptable for the constraints.
Example Input: n = 5
Possible triples where a² + b² = c²:
Count = 2
class Solution {
public int countTriples(int n) {
int count = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
if (i * i + j * j == k * k) {
count++;
}
}
}
}
return count;
}
}