郵件已發送,滿意請采納哈。謝謝了
源代碼
#include?<stdio.h>
int?isPrime(int?n)
{
int?i;
if(n==0||n==1)
return?0;
for(i=2;i*i<=n;i++)
if(!(n%i))
return?0;
return?1;
}
void?even(int?n)
{
int?i;
if(n==2)
{
printf("2?can?not?be?decomposed");
return;
}
for(i=2;i<=n/2;i++)
if(isPrime(i)&&isPrime(n-i))
printf("%d?=?%d?+?%d\n",n,i,n-i);
}
void?odd(int?n)
{
if(isPrime(n))
{
printf("%d?is?a?prime?number\n",n);
if(isPrime(n-2))
printf("twin?prime?left:?%d\n",n-2);
if(isPrime(n+2))
printf("twin?prime?right:?%d\n",n+2);
}
else
printf("%d?is?not?a?prime?number\n",n);
}
int?main()
{
void(*p)(int);
int?number;
scanf("%d",&number);
p=number&1?odd:even;
(*p)(number);
return?0;
}