#include<stdio.h>
int is_prime(int n) //子函数,判断是否为素数
{
int i = 0;
int count = 0;
for(i = 1; i <= n; i++)
{
if(0 == n % i)
{
count++;
}
}
if(2 == count)
{
return 1;
}
else
{
return 0;
}
}
int main()
{
int i = 0;
int count = 0;
for(i = 1; i <= 100; i++)
{
if(is_prime(i))
{
printf("%d\n",i);
count++;
}
}
printf("a total of %d prime numbers less than 100\n",count);
return 0;
}
[C]找出100以内的素数
最新推荐文章于 2023-08-13 18:02:08 发布