POJ 3641 Pseudoprime numbers(快速幂+素数判定）

Pseudoprime numbers

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions:11289		Accepted: 4872

Description

Fermat's theorem states that for any prime number p and for any integer a > 1, a^p = a (mod p). That is, if we raise a to the p^th 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

#include<cstdio>
using namespace std;
long long pow1(long long a,long long b)
{
    long long r=1,mod=b;
    while(b)
    {
        if(b%2==1)
            r=r*a%mod;
        a=a*a%mod;
        b=b/2;
    }
    return r;
}
int main()
{
    long long p,a;
    while(~scanf("%lld%lld",&p,&a))
    {
        if(!(p+a))break;
        bool flag=0;
        for(long long i=2;i*i<=p;i++)
        {
            if(p%i==0)
            {
                flag=1;break;
            }
        }
        if(!flag)printf("no\n");
        else if(a==pow1(a,p)) printf("yes\n");
        else printf("no\n");
    }
    return 0;
}