69,373
社区成员
发帖
与我相关
我的任务
分享
#include <stdio.h>
int main()
{
for(int num = 101; num <= 200; num += 2)
{
int i;
for(i = 2; i < num; i++)
if(!(num % i))
break;
if(i == num)
printf("Prime Number Found: \t%d\n", num);
}
}
int TestPrime(unsigned long n)
{
unsigned long i = 0;
unsigned long sq = 0;
if(n == 1)
return false;
else if(n == 2)
return true;
if(!(n % 2))
return false;
sq = (unsigned long)sqrt((double)n);
for(i=2; i<=sq; i++)
{
if(!(n % i))
return false;
}
return true;
}
#include <stdio.h>
#include <math.h>
int main()
{
int i;
for(i=101;i <=200;i++)
{
int j;
for(j=2;j<=(int)sqrt(i);++j)
{
if(i%j==0)
{
printf("%d不是素数\n",i);
break;
}
}
if(j>(int)sqrt(i))
printf("%d是素数\n",i);
}
return 0;
}