문제
Twin primes are two primes that differ by 2, such as 11 and 13 or 17 and 19. Find every such pair whose larger member is at most limit.
Implement twin_primes(limit).
For large limits, find all primes at once with a sieve instead of testing each number separately.
Input
limit: The largest value the larger prime of a pair may have.
Output
Return a list of pairs [p, p + 2] where both numbers are prime and p + 2 ≤ limit, sorted by p in ascending order. If there are none, return an empty list.
제약 조건
0 ≤ limit ≤ 10^6
예시
입력:
limit = 20
예상 출력:
expected = [
[3, 5],
[5, 7],
[11, 13],
[17, 19]
]
입력:
long long limit = 20;
예상 출력:
std::vector<std::vector<long long>> expected = {
{3, 5},
{5, 7},
{11, 13},
{17, 19}
};
입력:
long limit = 20;
예상 출력:
long[][] expected = new long[][] {
new long[] {3, 5},
new long[] {5, 7},
new long[] {11, 13},
new long[] {17, 19}
};
설명
The primes up to 20 are 2, 3, 5, 7, 11, 13, 17, 19; the ones 2 apart give [[3, 5], [5, 7], [11, 13], [17, 19]].
입력:
limit = 6
예상 출력:
expected = [
[3, 5]
]
입력:
long long limit = 6;
예상 출력:
std::vector<std::vector<long long>> expected = {
{3, 5}
};
입력:
long limit = 6;
예상 출력:
long[][] expected = new long[][] {
new long[] {3, 5}
};
설명
3 and 5 are both prime and 5 ≤ 6, but 7 is above the limit, so only [[3, 5]].
접근 방법
먼저 스스로 풀어 본 뒤 힌트를 하나씩 열어 보세요.
힌트 1
A sieve finds all primes up to 10^6 much faster than testing each number.
힌트 2
Then check every p with p + 2 ≤ limit.
힌트 3
The first pair is (3, 5), so any limit below 5 gives an empty list.
예상 복잡도
O(limit log log limit) time, O(limit) extra space
참고 자료
이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.