We want to count all ordered triples (a, b, c) such that 1 ≤ a, b, c ≤ n and a² + b² = c². Since n is small (≤ 250), we can check all possible (a, b, c) combinations.
classSolution {
publicintcountTriples(int n) {
int ans = 0;
for (int c = 1; c <= n; c++) {
for (int a = 1; a <= n; a++) {
for (int b = 1; b <= n; b++) {
if (a * a + b * b == c * c) ans++;
}
}
}
return ans;
}
}
1
2
3
4
5
6
7
8
9
classSolution:
defcountTriples(self, n: int) -> int:
ans =0for c in range(1, n+1):
for a in range(1, n+1):
for b in range(1, n+1):
if a*a + b*b == c*c:
ans +=1return ans