Description
In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:
For example:
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.
Every even number greater than 4 can be
written as the sum of two odd prime numbers.
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.
Input
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.
Each test case consists of one even integer n with 6 <= n < 1000000.
Input will be terminated by a value of 0 for n.
Output
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."
Sample Input
8
20
42
0
Sample Output
8 = 3 + 5 20 = 3 + 1742 = 5 + 37
题意:就是求两个质数相加起来等于n,如果有多组解输出质数相差最大的
解法:数据不超过一百万,所以先把一百万以内的质数全部筛选出来就可以了,然后从小往大循环就可以了
<span style="font-size:18px;">#include<stdio.h> #include<string.h> #include<math.h> #include<algorithm> #define MAXN 1000001 using namespace std; bool isprime[MAXN]; int main() { memset(isprime,false,sizeof(isprime)); int n,i,j,m; for(i=2;i<=MAXN;i++)//把是质数的都标记为flase { if(!isprime[i]) { for(j=i*2;j<=MAXN;j+=i) isprime[j]=true; } } while(scanf("%d",&n),n) { for(i=2;i<n;i++)//从小往大循环 { if(!isprime[i]&&!isprime[n-i]) break; } if(i<n) printf("%d = %d + %d\n",n,i,n-i); else printf("Goldbach's conjecture is wrong.\n"); } return 0; } </span>