Question: https://leetcode.com/problems/count-lattice-points-inside-a-circle/\n\nFor this question, when we calculate the distance between a point and a circle center, if we use `(i - x) * (i - x) + (j - y) * (j - y) <= r * r` then everything is ok. But if we use `(i - x) ** 2 + (j - y) ** 2 <= r ** 2` then we will get time limit exceeded. I guess this is caused by differnet time complexity between `a**2` and `a * a` in python. Anyone can explain it? Thanks a lot\n\n```\nclass Solution:\n    def countLatticePoints(self, circles: List[List[int]]) -> int:\n        result = set()\n        \n        for circle in circles:\n            x, y, r = circle\n            for i in range(x - r, x + r + 1):\n                for j in range(y - r, y + r + 1):\n                    if (i - x) * (i - x) + (j - y) * (j - y) <= r * r:\n                        result.add((i, j))\n                        \n        return len(result)

Question: https://leetcode.com/problems/count-lattice-points-inside-a-circle/\n\nFor this question, when we calculate the distance between a point and a circle 