POJ 2262



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.
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.

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

20420
Sample Output
8 = 3 + 520 = 3 + 1742 = 5 + 37这个题的意思就是说偶数可以由两个奇数而且还是素数的和组成，所以我们就求和呗

代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=1e6;
int data[maxn];
void sushu()
{
     memset(data,1,sizeof(data));
     for(int i=2;i<maxn;i++)
     {
         if(data[i])for(longlong j=(longlong)i*i;j<maxn;j+=i)
            data[j]=0;
     }
}
bool odd(int m)
{
     if(m%2)return1;
     return 0;
}
int main()
{
    sushu();
    int m;
    while(cin>>m&&m)
    {
        cout<<m<<" = ";
        for(int i=3;i<=m/2;i++)
        {
            int n=m-i;
            if(odd(i)&&odd(n))
            {
                if(data[i]&&data[n])
                {
                    cout<<i<<" + "<<n<<endl;
                    break;
                }
            }
        }
    }
    return 0;
}