素数的(快速)判定——prime judge

#include <iostream>
int Miller_rabbin( long long );
void power( long long, long long, long long );
long long ans;
 
int main()
{
    int times, sel;
    long long n;
    while ( scanf( "%lld", &n ) != EOF )
    {
        times = 3, sel = 1;
        if ( n <= 1 ) sel = 0;
        else if ( n == 2 || n == 3 ) sel = 1;
        else
        {
            while ( times-- && sel )
                if ( !Miller_rabbin( n ) )
                    sel = 0;
        }
        if ( sel )
            printf( "YES\n" );
        else
            printf( "NO\n" );
    }
    return 0;
}
 
int Miller_rabbin( long long n )
{