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
#include<iostream>
using namespace std;
//素数判断:
int is_prime(int n) {
if (n == 2)
return 1;
if (n % 2 == 0)
return 0;
for (int i = 3; i * i <= n; i++)
if (n % i == 0)
return 0;
return 1;
}
//模取幂运算:
int mod(int a, int p, int m) {
long long x = a;
long long result = 1;
while (p > 0) {
if (p % 2)
result = result * x % m;
p = p >> 1;
x = x * x % m;
}
return result;
}
int main(void) {
int a, p;
while (scanf("%d%d", &p, &a), a + p) {
if (!is_prime(p) && mod(a, p, p) == a)
printf("yes\n"); //输出结果
else
printf("no\n");
}
return 0;
}