समस्या
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.
सीमाएँ
0 ≤ low ≤ 1,000,000
0 ≤ high ≤ 1,000,000
उदाहरण
इनपुट:
low = 1
high = 100
अपेक्षित आउटपुट:
expected = 25
इनपुट:
long long low = 1;
long long high = 100;
अपेक्षित आउटपुट:
long long expected = 25;
इनपुट:
long low = 1;
long high = 100;
अपेक्षित आउटपुट:
long expected = 25;
व्याख्या
There are 25 primes up to 100 (2, 3, 5, … 97), so the answer is 25.
इनपुट:
low = 50
high = 60
अपेक्षित आउटपुट:
expected = 2
इनपुट:
long long low = 50;
long long high = 60;
अपेक्षित आउटपुट:
long long expected = 2;
इनपुट:
long low = 50;
long high = 60;
अपेक्षित आउटपुट:
long expected = 2;
व्याख्या
Only 53 and 59 are prime between 50 and 60, so the answer is 2.
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
Build a sieve up to high, crossing out multiples of each prime starting at its square.
संकेत 2
Then count the numbers still marked prime from low to high.
संकेत 3
If low is greater than high, nothing needs to be computed.
अपेक्षित जटिलता
O(high log log high) time, O(high) extra space
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।