Pseudoprime numbers（快速幂）

原题链接
Pseudoprime numbers
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 8994 Accepted: 3793
Description

Fermat’s theorem states that for any prime number p and for any integer a > 1, ap = a (mod p). That is, if we raise a to the pth power and divide by p, the remainder is a. Some (but not very many) non-prime values of p, known as base-a pseudoprimes, have this property for some a. (And some, known as Carmichael Numbers, are base-a pseudoprimes for all a.)

Given 2 < p ≤ 1000000000 and 1 < a < p, determine whether or not p is a base-a pseudoprime.

Input

Input contains several test cases followed by a line containing “0 0”. Each test case consists of a line containing p and a.

Output

For each test case, output “yes” if p is a base-a pseudoprime; otherwise output “no”.

Sample Input

3 2
10 3
341 2
341 3
1105 2
1105 3
0 0
Sample Output

no
no
yes
no
yes
yes
Source

Waterloo Local Contest, 2007.9.23

//http://poj.org/problem?id=3641
#include <algorithm>
#include <iostream>
#include <utility>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
using namespace std;

typedef long long ll;
const int MOD = int(1e9) + 7;
//int MOD = 99990001;
const int INF = 0x3f3f3f3f;
const ll INFF = (~(0ULL)>>1);
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos(-1.0); //M_PI;
const int fx[] = {-1, 1, 0, 0};
const int fy[] = {0, 0, -1, 1};
const int maxn=10000 + 5;
ll p,a;
bool is_prime(ll n){
        for(ll i=2;i*i<=n;i++)
                if(n%i==0) return false;
        return n!=1;
}
ll quick_index(ll a,ll p,ll mod){
        ll res=1;
        while(p){
                if(p&1) res=((res%mod)*(a%mod))%mod;
                a=((a%mod)*(a%mod))%mod;
                p>>=1;
        }
        return res;
}
int main(){
        while(scanf("%lld%lld",&p,&a)==2 && (p+a)){
                if(!is_prime(p) && quick_index(a,p,p)==a){
                        printf("yes\n");
                }
                else{
                        printf("no\n");
                }

        }
        return 0;
}