#include<iostream>
#include<fstream>
#include<cmath>
using namespace std;
bool isPrime(int n){
int val=(int)sqrt(n);
for(int i=2;i<=val;++i){
if(n%i==0)
return false;
}
return true;
}
int main(){
//ifstream cin("1.txt");
int n;
while(cin>>n&&n){
bool find=false;
for(int i=3;i<n;i+=2){
if(i>n-i)
break;
if(isPrime(i)&&isPrime(n-i)){
find=true;
cout<<n<<" = "<<i<<" + "<<n-i<<endl;
break;
}
}
if(!find)
cout<<"Goldbach's conjecture is wrong."<<endl;
}
return 0;
}
poj2262
最新推荐文章于 2019-10-03 16:01:31 发布