看代码:
#include <stdio.h>
#include <math.h>
// 判断是否是素数,是的话返回 1,不是返回 0
int is_prime(int num)
{
if (num < 2)
{
return 0;
}
int i, tmp = (int)sqrt(num);
for (i = 2; i <= tmp; ++i)
{
if (num % i == 0)
{
return 0;
}
}
return 1;
}
int main(int argc, char** argv)
{
int i;
printf ("1 ~ 100 的素数:\n");
for (i = 1; i <= 100; ++i)
{
if (is_prime(i))
{
printf ("%d\n", i);
}
}
return 0;
}
运行:
![](https://video.ask-data.xyz/img.php?b=https://iknow-pic.cdn.bcebos.com/dc54564e9258d109237b935ed758ccbf6d814d45?x-bce-process=image%2Fresize%2Cm_lfit%2Cw_600%2Ch_800%2Climit_1%2Fquality%2Cq_85%2Fformat%2Cf_auto)