📡 Prime Range Radar

📚 Prime Range Query with Sieve

To answer multiple range queries efficiently:

1. Precompute: Use Sieve of Eratosthenes to mark all primes up to max value
2. Prefix Sum: Create array where count[i] = number of primes ≤ i
3. Query: Primes in [L, R] = count[R] - count[L-1]

Precomputation: O(N log log N)
Each Query: O(1)! 🚀