문제
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에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.