注意:输入n的时候不要太大,因为要算很长时间
#include "math.h"
int prime(long int n)
{
long int i;
for(i=2;i<=sqrt(n);i++)
if(n%i==0)return 0;
return 1;
}
int prime(long int n);
main()
{
long int a,b,c,n;
scanf("%ld",&n);
for(a=6;a<=n;a+=2)
for(b=3;b<=a/2;b+=2)
if(prime(b))
{
c=a-b;
if(prime(c))
{
printf("%ld=%ld+%ld/n",a,b,c);
break;
}
}
}
#include "math.h"
int prime(long int n)
{
long int i;
for(i=2;i<=sqrt(n);i++)
if(n%i==0)return 0;
return 1;
}
int prime(long int n);
main()
{
long int a,b,c,n;
scanf("%ld",&n);
for(a=6;a<=n;a+=2)
for(b=3;b<=a/2;b+=2)
if(prime(b))
{
c=a-b;
if(prime(c))
{
printf("%ld=%ld+%ld/n",a,b,c);
break;
}
}
}