Problem
How many primes are there from 1 to 100? From 50 to 60? Count the primes p with low ≤ p ≤ high. Remember that 0 and 1 are not prime. A sieve up to high answers this quickly.
Implement count_primes_in_range(low, high).
Input
low: The lower bound, included.
high: The upper bound, included.
Output
Return the number of primes in the range. If low > high the range is empty and the answer is 0.
Constraints
0 ≤ low ≤ 1,000,000
0 ≤ high ≤ 1,000,000
Examples
Input:
low = 1
high = 100
Expected output:
expected = 25
Input:
long long low = 1;
long long high = 100;
Expected output:
long long expected = 25;
Input:
long low = 1;
long high = 100;
Expected output:
long expected = 25;
Explanation
There are 25 primes up to 100 (2, 3, 5, … 97), so the answer is 25.
Input:
low = 50
high = 60
Expected output:
expected = 2
Input:
long long low = 50;
long long high = 60;
Expected output:
long long expected = 2;
Input:
long low = 50;
long high = 60;
Expected output:
long expected = 2;
Explanation
Only 53 and 59 are prime between 50 and 60, so the answer is 2.
How to approach it
Try on your own first, then open one hint at a time.
Hint 1
Build a sieve up to high, crossing out multiples of each prime starting at its square.
Hint 2
Then count the numbers still marked prime from low to high.
Hint 3
If low is greater than high, nothing needs to be computed.
Expected complexity
O(high log log high) time, O(high) extra space
References
This challenge is adapted for CodeUtility. Follow the statement and constraints above.