zjut 1517 浙江工业大学oj Is it a prime?

题目链接：here~~

判断一个很大很大的数是不是素数，使用Miller-Rabin素数测试，产生随机数来验证是否满足费马小定理

#include <cstdlib>
#include <iostream>
#include <time.h>
using namespace std;
#define N 5
typedef long long LL;
LL random(LL n)
{
    return (LL)((double)rand()/RAND_MAX*n+0.5);
}
LL multi(LL a, LL b, LL m)//a*b%m
{
    LL ret=0;
    while (b)
    {
        if (b&1) ret=(ret+a)%m;
        b>>=1;
        a=(a<<1)%m;
    }
    return ret;
}
LL quick_mod(LL a, LL b, LL m)
{
    LL ans=1;
    while (b)
    {
        if (b&1) ans=multi(ans, a, m);
        b>>=1;
        a=multi(a, a, m);
    }
    return ans;
}
bool miller_rabin(LL n)
{
    for (int i=1; i<=N; i++)
    {
        LL a=random(n-2)+1;
        if (quick_mod(a, n-1, n)!=1)
            return false;
    }
    return true;
}
int main()
{
    srand(time(NULL));
    LL n;
    while (cin>>n)
    {
        if (miller_rabin(n)) cout<<"Yes\n";
        else cout<<"No\n";
    }
    return 0;
}