哥德巴赫猜测

#include<iostream>#include<cmath>using namespace std;#define N 10000int isPrime(int i){ for(int j=2;j<sqrt(i)+1;j++) { if(i%j==0) { return 0; } } return 1;}int isGoetheNum(int i){int j=3;for(;j<=i/2;j+=2){if(isPrime(j)&&isPrime(i-j)){return 1;}}return 0;}int main(){int i=6;for(;i<=N;i+=2){if(!isGoetheNum(i)){cout<<"歌德巴赫猜测不成立！"<<endl;return 1;}}cout<<"歌德巴赫猜测成立！"<<endl;return 0;}