POJ-1811 Prime Test（Miller_Rabin算法和Pollard_rho算法模板题）

  题目：POJ-1811 Prime Test

  题目大意：非常简单的题意，就是让判断一个大数是否为素数，若不是，求出他的最小素因子。

  解题思路：Miller_Rabin算法和Pollard_rho算法模板题-算法详解

  AC代码：

#include<iostream>

#include<cmath>

#include<cstring>

#include<algorithm>

#include<cstdio>

#include<stdlib.h>

#include<time.h>

#define times 20

using namespace std;

long long total;

long long factor[110];

long long qmul(long long a,long long b,long long M){

    a%=M;

    b%=M;

    long long ans=0;

    while (b){

        if (b&1){

            ans=(ans+a)%M;

        }

        a=(a<<=1)%M;

        b>>=1;

    }

    return ans%M;

}

long long qpow(long long a,long long b,long long int M){

    long long ans=1;

    long long k=a;

    while(b){

        if(b&1)ans=qmul(ans,k,M)%M;

        k=qmul(k,k,M)%M;

        b>>=1;

    }

    return ans%M;

}

bool witness(long long a,long long n,long long x,long long sum){

    long long judge=qpow(a,x,n);

    if (judge==n-1||judge==1)return 1;

    while (sum--){

        judge=qmul(judge,judge,n);

        if (judge==n-1)return 1;

    }

    return 0;

}

bool miller(long long n){

    if (n<2)return 0;

    if (n==2)return 1;

    if ((n&1)==0)return 0;

    long long x=n-1;

    long long sum=0;

    while (x%2==0){

        x>>=1;

        sum++;

    }

    for (long long i=1;i<=times;i++){

        long long a=rand()%(n-1)+1;

        if (!witness(a,n,x,sum))return 0;

    }

    return 1;

}

long long gcd(long long a,long long b){

    return b==0?a:gcd(b,a%b);

}

long long pollard(long long n,long long c){

    long long x,y,d,i=1,k=2;

    x=rand()%n;

    y=x;

    while (1){

        i++;

        x=(qmul(x,x,n)+c)%n;

        d=gcd(y-x,n);

        if (d<0)d=-d;//注意，gcd可能为负数

        if (d>1&&d<n)return d;

        if (y==x)return n;

        if (i==k){

            y=x;

            k<<=1;

        }//就是这段，据说的优化，但是并不懂，自己也想了想，确实不知道在干嘛，有些代码里没这段

    }

}

void find(long long n){

    if (miller(n)){

        factor[++total]=n;

        return ;

    }

    long long p=n;

    while (p>=n){

        p=pollard(p,rand()%(n-1)+1);

    }

    find(n/p);

    find(p);

}

int main(){

    long long n,m,i,t;

    scanf("%lld",&t);

    while (t--){

        scanf("%lld",&n);

        if (miller(n)){

            printf("Prime\n");

        }

        else {

            memset(factor,0,sizeof(factor));

            total=0;

            find(n);

            sort(factor+1,factor+total+1);

            printf("%lld\n",factor[1]);

        }

    }

}