源程序如下:
#include
main()
{
int n;
printf("Input a number please:");
scanf("%d",&n);
if (prime(n)!=0)
printf("%d is ss\n",n);
else
printf("%d is not ss\n",n);
}
int prime(int x)
{
int i;
for(i=2;i
return 0;
return 1;
}
程序测试结果如下图示:
#include
int prime(int x)
{
int num=x/2;
for(int i=2;i<=num;i++)
if((x%i)==0)return 0;
return 1;
}
main()
{
int num;
printf("Input a number please:");
scanf("%d",&num);
printf("%d\n",prime(num));
return 0;
}