1051: 哥德巴赫猜想Ⅰ

哥德巴赫猜想Ⅰ"/>

1051: 哥德巴赫猜想Ⅰ

#include<bits/stdc++.h> 
using namespace std;
const double PI=acos(-1.0);
#define _max -0x7fffffff
bool isprime(int n)  //判断是否为质数 
{if(n==1)return false;	elsefor(int i=2;i<=sqrt(n);i++)if(n%i==0)return false;	return true;		
}
int main()
{int n; while(scanf("%d",&n)!=EOF){for(int i=2;i<=n/2;i++){if(isprime(i)&&isprime(n-i))printf("%d %d\n",i,n-i);}printf("\n");}return 0;
}