///六素数快速判断素数
int prim( int n )
{
if( n == 2 || n == 3)
return 1;
if( n%6 != 1 && n%6 != 5 )
return 0;///不在六的两侧一定不是
int t = sqrt( n ), i;
for( i = 5; i<=t; i+=6)
{
if( n%i == 0 || n%(i+2) == 0)
return 0;
}
return 1;
}
int prim( int n )
{
if( n == 2 || n == 3)
return 1;
if( n%6 != 1 && n%6 != 5 )
return 0;///不在六的两侧一定不是
int t = sqrt( n ), i;
for( i = 5; i<=t; i+=6)
{
if( n%i == 0 || n%(i+2) == 0)
return 0;
}
return 1;
}