Queries on Number of Points Inside a Circle

From LeetCode. Distance <= radius. Solve the geometry problem "Queries on Number of Points Inside a Circle".

Difficulty

medium

Companies

Not listed

Topic

Circlesgeometry circles

Examples

Input: [1,2,3]

Output: 0

Input: [2,3,4]

Output: 0

Hints

Direct check per query: for query circle (cx, cy, r) count points where (px-cx)² + (py-cy)² ≤ r². O(n × q) is fine for constraints ≤ 500 each.

No preprocessing needed — squared distance avoids sqrt. Store points array once, iterate for each query.

Points on circumference (distance == r²) count as inside — use ≤ not <. Beware large coordinate values causing integer overflow in squared distance.

Queries on Number of Points Inside a Circle

**From LeetCode.** Distance <= radius. Solve the geometry problem "Queries on Number of Points Inside a Circle".