POJ - 3641 Pseudoprime numbers <快速幂加素数判定>

Pseudoprime numbers

Time Limit: 1000MS

Memory Limit: 65536KB

64bit IO Format: %lld & %llu

Submit Status

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

Source

Waterloo Local Contest, 2007.9.23

代码：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define LL long long
LL wei[15],yu;
LL POW(LL aa,LL pp)
{
    LL lp=1;
    LL cheng=aa;
    while (pp)
    {
        if (pp&1)
        lp=(lp*cheng)%yu;
        cheng=(cheng*cheng)%yu;
        pp>>=1;
    }
    return lp;
}
int ko(int xx)
{
    if (xx==1) return 1;
    for (int i=2;i*i<=xx;i++)
        if (xx%i==0)
        return 1;
    return 0;
}
int main()
{
    LL p,a;
    while (scanf("%lld%lld",&p,&a),p+a)
    {
       yu=p;
        if (POW(a,p)==a&&ko(p))
            printf("yes\n");
        else
            printf("no\n");
    }
    return 0;
}