C++米勒拉宾算法模板

//我也忘了从哪找来的板子，不过对于2^63级的数据请考虑使用java内置的米勒拉宾算法。
  1 #include <iostream>
 #include <string>
 #include <cstdio>
 #include <cmath>
 #include <cstring>
 #include <algorithm>
 #define range(i,a,b) for(int i=a;i<=b;++i)
 #define rerange(i,a,b) for(int i=a;i>=b;--i)
 #define LL long long
 #define fill(arr,tmp) memset(arr,tmp,sizeof(arr))
 using namespace std;
 const int S=;
 LL mult_mod(LL a,LL b,LL c){
     a%=c;
     b%=c;
     long long ret=;
     while(b){
         if(b&){ret+=a;ret%=c;}
         a<<=;
         if(a>=c)a%=c;
         b>>=;
     }
     return ret;
 }
 LL pow_mod(LL x,LL n,LL mod){
     if(n==)return x%mod;
     x%=mod;
     LL tmp=x;
     LL ret=;
     while(n){
         if(n&) ret=mult_mod(ret,tmp,mod);
         tmp=mult_mod(tmp,tmp,mod);
         n>>=;
     }
     return ret;
 }
 bool check(LL a,LL n,LL x,LL t){
     LL ret=pow_mod(a,x,n);
     LL last=ret;
     range(i,,t){
         ret=mult_mod(ret,ret,n);
         if(ret==&&last!=&&last!=n-) return true;
         last=ret;
     }
     if(ret!=) return true;
     return false;
 }
 bool Miller_Rabin(LL n){
     if(n<)return false;
     if(n==)return true;
     if((n&)==) return false;
     LL x=n-;
     LL t=;
     while((x&)==){x>>=;t++;}
     range(i,,S-){
         LL a=rand()%(n-)+;
         if(check(a,n,x,t))return false;
     }
     return true;
 }
 LL factor[];
 int tol;
 LL gcd(LL a,LL b){
     if(a==)return ;
     if(a<) return gcd(-a,b);
     while(b){
         long long t=a%b;
         a=b;
         b=t;
     }
     return a;
 }
 LL Pollard_rho(LL x,LL c){
     LL i=,k=;
     LL x0=rand()%x;
     LL y=x0;
     while(){
         i++;
         x0=(mult_mod(x0,x0,x)+c)%x;
         LL d=gcd(y-x0,x);
         if(d!=&&d!=x) return d;
         if(y==x0) return x;
         if(i==k){y=x0;k+=k;}
     }
 }
 void findfac(LL n){
     if(Miller_Rabin(n)){
         factor[tol++]=n;
         return;
     }
     LL p=n;
     while(p>=n)p=Pollard_rho(p,rand()%(n-)+);
     findfac(p);
     findfac(n/p);
 }
 int main(){
     long long n;
     while(scanf("%lld",&n)!=EOF){
         tol=;
         /*
         findfac(n);
         for(int i=0;i<tol;++i)cout<<factor[i]<<" ";
         printf("\n");
         */
         if(Miller_Rabin(n))printf("Yes\n");
         else printf("No\n");
     }
     return ;
 }