//【例5.9】输入一个大于3的整数n,判定它是否为素数(prime,又称质数)
#include <stdio.h>
int main()
{ int n,i;
printf("please enter a integer number,n=?");
scanf("%d",&n);
for (i=2;i<n;i++)
if(n%i==0) break;
if(i<n) printf("%d is not a prime number.\n",n);
else printf("%d is a prime number.\n",n);
return 0;
}
//【例5.9】输入一个大于3的整数n,判定它是否为素数
最新推荐文章于 2024-07-13 20:44:59 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)