第1个回答 2011-12-02
int isPrime(int num) {
int divisor = 3;
int testLimit = num;
if (num < 2)
return 0;
if ( num < 4 )
return 1;
if (num % 2 == 0)
return 0;
while ( testLimit >= divisor )
{
if ( num % divisor == 0 )
return 0;
testLimit = num / divisor;
divisor += 2;
}
return 1;
}本回答被提问者采纳