69,371
社区成员
发帖
与我相关
我的任务
分享
#include<stdio.h>
#include<math.h>
int prime(long x)
{
long i,j;
j=sqrt(x);
for(i=2;i<=j;i++)
if(x%i==0)
return 0;
return 1;
}
int main()
{
long i,n;
scanf("%ld",&n);
while(n!=0)
{
for(i=2;i<=n;i++)
{
if(prime(i)&&prime(n-i))
{
printf("%ld = %ld + %ld\n",n,i,n-i);
break;
}
}
if(i==n) printf("Goldbach's conjecture is wrong.\n");
scanf("%ld",&n);
}
return 0;
}