int prime ( int m );
main ()
{
……
}
int prime ( int m )
{
……
}
for(i=2;i<n/2;++i)
if(n%i==0)
{
flag=0;
break;
}
if(flag==1)
printf("\nThe given number is prime");
else
printf("\nThe given number is not prime");
#inculde "math.h"
int prime (int m);
int main ()
{
int i,k,result;
for(i=100;i<=200;i++)
{
result = prime(i);
if(result == 1)
{
printf("%d是素数",i);
}
else if
{
printf("%d不是素数",i);
}
}
}
int prime (int m)
{
k = (int) sqrt(m);
int i;
for(i=2;i<=k;i++)
{
if(i%j == 0) return 0;
}
return 1;
}