POJ 2262

#include<string.h>
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector> 
#include<set>
#include<cmath>
#include<algorithm>
using namespace std;

bool u[1111111];
int su[1111111];
int num;
void prepare()
{
	int i,j;
	memset(u,true,sizeof(u));
	for(i=2;i<=1000000;i++)
	{
		if(u[i])
		su[++num]=i;
		for(j=1;j<=num;j++)
		{
			if(i*su[j]>1000000)break;
			u[i*su[j]]=false;
			if(i%su[j]==0)break;
		}
	}
}

int main()
{
	prepare();
	int i,j,k,n;
	while(scanf("%d",&n)>0&&n)
	{
		bool ok=false;
		for(i=2;i<=num;i++)
		{
			if(su[i]*2>n)break;
			if(u[n-su[i]])
			{
				ok=true;
				break;
			}
		}
		if(!ok)puts("Goldbach's conjecture is wrong.");
		else printf("%d = %d + %d\n",n,su[i],n-su[i]);
	}
	return 0;
}