classSolution:defcountTriples(self, n:int)->int:
ans =0for a inrange(1, n +1):for b inrange(a +1, n +1):
c = sqrt(a **2+ b **2)if c %1==0and c < n +1:
ans +=2return ans
1925. 统计平方和三元组的数目Ideas算法:迭代Codeclass Solution: def countTriples(self, n: int) -> int: ans = 0 for a in range(1, n + 1): for b in range(a + 1, n + 1): c = sqrt(a ** 2 + b ** 2) if c % 1