poj 3641 Pseudoprime numbers Miller_Rabin测素裸题

题目链接

题意:题目定义了Carmichael Numbers 即 a^p % p = a.并且p不是素数。之后输入p,a问p是否为Carmichael Numbers？

坑点:先是各种RE，因为poj不能用srand()...之后各种WA..因为里面(a,p) ?= 1不一定互素，即这时Fermat定理的性质并不能直接用欧拉定理来判定。。即 a^(p-1)%p = 1判断是错误的。。作的

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string.h>
#include<algorithm>
#include<map>
#include<queue>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<time.h>
using namespace std;
template<typename T>
void read1(T &m)
{
    T x=,f=;char ch=getchar();
    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
    m = x*f;
}
template<typename T>
void read2(T &a,T &b){read1(a);read1(b);}
typedef long long ll;
int T,kase = ,i,j,k,n,m;
ll mult(ll x,ll y,ll mod) // ·ÀÖ¹x*y±¬long long;
{
    ll ans = ;x %= mod;
    while(y){
        if(y&) ans += x, y--;
        if(ans >= mod) ans -= mod;
        y >>= ;
        x <<= ;
        if(x >= mod) x -= mod;
    }
    return ans;
}
ll pow(ll a,ll n,ll mod)
{
    a %= mod;
    ll ans = ;
    while(n){
        if(n&) ans = ans*a%mod;
        a = a*a%mod;
        n >>= ;
    }
    return ans;
}
int p[]={,,,,,,,,,,,,,,,};
bool Miller_Rabin(ll n)
{
    if(n <= ) return n == ;
    if(n% == ) return false;
    ll t = n - ;
    while(t% == ) t >>= ;
    for(int i = ;i < ;i++){
        if(p[i] >= n) return true;
        if(n % p[i] == ) return false;
        ll tmp = t;
        ll x = pow(p[i],t,n); // p[i]^t % n;
        while(tmp < n){
            ll y = mult(x,x,n);
            if(y ==  && x !=  && x != n-) return false;
            x = y;
            tmp <<= ;
        }
        if(x != ) return false; // Fermat theory
    }
    return true;
}
int main()
{
    ll x,y;
    while(read2(x,y), x + y){
        if(Miller_Rabin(x) || pow(y,x,x) != y) puts("no");
        else puts("yes");
    }
    return ;
}