Time: 381 ms (24.46%), Space: 17.8 MB (33.15%) - LeetHub

Author: hogan-tech

1925-count-square-sum-triples/1925-count-square-sum-triples.py

@@ -0,0 +1,20 @@
+# time complexity: O(n^2)
+# space complexity: O(1)
+from math import sqrt
+
+
+class Solution:
+    def countTriples(self, n: int) -> int:
+        count = 0
+        for a in range(1, n + 1):
+            for b in range(1, n + 1):
+                c = int(sqrt(a**2 + b**2 + 1))
+                if c <= n and a ** 2 + b ** 2 == c ** 2:
+                    count += 1
+        return count
+
+
+n = 5
+print(Solution().countTriples(n))
+n = 10
+print(Solution().countTriples(n))