poj 3641 Pseudoprime numbers

Pseudoprime numbers

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6348		Accepted: 2561

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

快速幂，也很水：

/*
Problem: 3641		User: motefly
Memory: 660K		Time: 16MS
Language: G++		Result: Accepted
*/
#include <iostream>
#include <cstdio>
using namespace std;
//const int maxn=45005;
//pair<int,int> p[maxn];

long long qmod(long long x,long long n,long long m)
{
    long long res=1;
    while(n>0)
    {
        if(n&1)
            res=res*x%m;
        x=x*x%m;
        n>>=1;
    }
    return res;
}
bool prime(long long n)
{
    for(long long i=2;i*i<n;i++)
        if(n%i==0)
        return 0;
    return 1;
}
int main()
{
   long long p,a;
   while(scanf("%lld%lld",&p,&a)&&p)
   {
       if(prime(p))
       {
           printf("no\n");
           continue;
       }
       if(qmod(a,p,p)==a)
        printf("yes\n");
       else
       printf("no\n");
   }
   return 0;
}