寒假程序翻译1.24

 https://acs.jxnu.edu.cn/contest/22/board/challenge/B

Goldbach's Conjecture

描述：

In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:
 

Every even number greater than 4 can be
written as the sum of two odd prime numbers.

（德国业余数学家哥德巴赫在1742年，发了一封信给Euler 其中他做了一个猜想：超过4的每个偶数都可以由两个素数相加）

For example:
 

8 = 3 + 5. Both 3 and 5 are odd prime numbers.
20 = 3 + 17 = 7 + 13.
42 = 5 + 37 = 11 + 31 = 13 + 29 = 19 + 23.

Today it is still unproven whether the conjecture is right. (Oh wait, I have the proof of course, but it is too long to write it on the margin of this page.)
Anyway, your task is now to verify Goldbach's conjecture for all even numbers less than a million.
(如今这个猜想仍然无法被证明是对的。（其实是有证明的，只是过于繁琐在此不附加）)

（无论如何，你的任务是去校验哥德巴赫猜想于小于百万的偶数）

输入：

The input will contain one or more test cases.
Each test case consists of one even integer n with 6 <= n < 1000000.
Input will be terminated by a value of 0 for n.

（输入包含一个或者更多的测试例子。每个测试例子属于6 <= n < 1000000，并且都是偶数。

输入0则输入终止。）

输出：

For each test case, print one line of the form n = a + b, where a and b are odd primes. Numbers and operators should be separated by exactly one blank like in the sample output below. If there is more than one pair of odd primes adding up to n, choose the pair where the difference b - a is maximized. If there is no such pair, print a line saying "Goldbach's conjecture is wrong."

（对于每个测试例子，输出一行n = a + b ,a和b都是奇数素数。数字和操作者应该用一行空白输出行分离。如果有超过一对的奇数素数，选择b-a最大的一对。如果没有如此的一对，则输出一行“哥德巴赫猜想是错误的。”）