判断一个数是否是素数的算法
|
1 2 3 4 5 6 7 8 9 10 11 12 |
#include main() { int m,i,k; scanf(“%d”,&m); k=sqrt(m); for(i=2;i<=k;i++) if(m%i==0)break; if(i>=k+1) printf(“%d is a prime number\n”,m); else printf(“%d is not a prime number\n”,m); } |
