MR 素性检测 （快速幂+快速乘）

const int S=9;
int qmul(int a, int b, int mod)//快速乘 
{
    int c = a*b-(int)((long double)a*b/mod+0.5)*mod;
    return c<0 ? c+mod : c;
}
int qpow(int a,int b,int mod)//快速幂
{
    int ans=1,buff=a;
    while(b)
    {
        if(b&1)ans=qmul(ans,buff,mod);
        buff=qmul(buff,buff,mod);
        b>>=1;
    }
    return ans;
}
bool Check(int a,int n,int x,int t)
{
    int ret = qpow(a,x,n);
    int last = ret;
    for(int i = 1;i <= t; i++)
    {
        ret = qmul(ret,ret,n);
        if(ret == 1 && last != 1 && last != n - 1)
            return true;
        last = ret;
    }
    if(ret != 1)
        return true;
    return false;
}
bool Miller_Rabin(int n)
{
    if(n < 2)
        return false;
    if(n == 2)
        return true;
    if(!(n & 1))
        return false;
    int x = n - 1;
    int t = 0;
    while(!(x & 1))
    {
        x >>= 1;
        t++;
    }
    srand(time(NULL));
    for(int i = 0;i < S; i++)
    {
        int a = rand() % (n - 1) + 1;
        if(Check(a,n,x,t))
            return false;
    }
    return true;
}