题解

# include<iostream>
using namespace std;
bool prime(int n){
	if(n<2) return 0;
	for(int i=2;i<=n/i;++i)
		if(n%i==0) return 0;
	return 1;
}
void goldbach(int n){
	if(n<6||n%2==1) cout<<"Goldbach's conjecture is wrong.\n";
	else{
		for(int i=3;i<=n/2;i+=2)
			if(prime(i)&&prime(n-i)){
				cout<<n<<" = "<<i<<" + "<<n-i<<endl;
				break;
			}
	}
}
int main(){
    int n;
    while(1){
        cin>>n;
        if(n==0) break;
        goldbach(n);
    }
    return 0;
}