問題
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 つずつ開いてみましょう。
ヒント 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用に調整されています。上記の説明と制約に従ってください。