POJ2262哥德巴赫猜想

#include <bits/stdc++.h>
using namespace std;
bool ph(int num){
    if(num==1)   return false;
	if(num==2)	return true;
	for(int i=2;i<sqrt(num)+1;i++){
		if((num%i)==0)	return false;
	}
	return true;
}
int main()
{
	int i=0;
	while(scanf("%d",&i))
	{
		int j,j1,num1,num2,num3=0;
		if(i==0||i<6||i>=1000000||i%2!=0) break;
		j1=i;
		for(int t1=3;t1<=j1;t1+=2)
		{
			j=t1;
			j1=i-t1;
			num1=ph(j);
			num2=ph(j1);
			if(num1==num2==1)
			{
				num3=1;
				break;
			} 
		}
		if(num3==1)
		{
			printf("%d = %d + %d\n",i,j,j1);
		}
		else printf("Goldbach's conjecture is wrong.");
	}
	return 0;
}