中級 0件解決済み 正答率0%

Goldbach Partition

Write an even number as the sum of two primes, using the smallest possible first prime.

このチャレンジで学べること

  • Write a trial-division prime test that stops at √n
  • Search candidates in increasing order and stop at the first hit
  • Return a pair in the required order

問題

翻訳を表示

Goldbach's conjecture says that every even number greater than 2 is the sum of two primes. It has never been proven, but it has been checked far beyond the numbers here. Often there are several ways: 28 = 5 + 23 = 11 + 17. Find the one whose smaller prime is as small as possible.

Implement goldbach_partition(n).

Trying p = 2, 3, 5, ... and testing whether n − p is prime finds the answer quickly, because a small p almost always works. Testing a number up to 10^9 for primality by trial division only needs divisors up to about 31,623.

Input

n: An even number greater than 2.

Output

Return [p, q] where p and q are primes, p + q = n, p ≤ q, and p is the smallest prime for which this works.

制約

4 ≤ n ≤ 10^9, n is even

例

例 1
入力:
n = 28

期待される出力:
expected = [5, 23]
入力:
long long n = 28;

期待される出力:
std::vector<long long> expected = {5, 23};
入力:
long n = 28;

期待される出力:
long[] expected = new long[] {5, 23};

解説

28 − 2 = 26 and 28 − 3 = 25 are not prime, but 28 − 5 = 23 is, so the answer is [5, 23].

例 2
入力:
n = 4

期待される出力:
expected = [2, 2]
入力:
long long n = 4;

期待される出力:
std::vector<long long> expected = {2, 2};
入力:
long n = 4;

期待される出力:
long[] expected = new long[] {2, 2};

解説

The only option is 2 + 2, so the answer is [2, 2].

解き方のヒント

まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。

ヒント 1

Try p = 2, 3, 4, ... and stop at the first p where both p and n − p are prime.

ヒント 2

A prime test only needs to try divisors up to the square root.

ヒント 3

Since you stop at the smallest p, p ≤ n − p comes for free.

目安の計算量

O(k √n) time where k is the number of candidates tried, O(1) extra space

参考資料

この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。

ランキング

全体ランキング

コーダーごとのいちばん良い合格解答です。速く、メモリが少なく、評価が高い解答ほど上位になります。

まだ合格した解答はありません。解いて 1 位になりましょう。

他の人の解答から学ぶ

コミュニティの解答

まだ公開された解答がありません。この課題を解いて最初の解答を共有しましょう。