题解 | KiKi求质数个数
KiKi求质数个数
https://www.nowcoder.com/practice/d3a404ee0f8d41f98bf4707035d91086
#include <stdio.h>
#include <math.h>
int zhishu(int x)
{
int i=0;
for(i=2;i<=sqrt(x);i++)
{
if(x%i==0)
return 0;
}
return 1;
}
int main()
{
int a = 0, m = 0;
for (a = 101; a < 1000; a+=2)
{
if(zhishu(a))
m++;
}
printf("%d",m);
return 0;
}
