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.
InputInput contains several test cases followed by a line containing "0 0". Each test case consists of a line containing p and a.
For each test case, output "yes" if p is a base-a pseudoprime; otherwise output "no".
3 2 10 3 341 2 341 3 1105 2 1105 3 0 0Sample Output
no no yes no yes yes
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
bool isprime(int n)//試除法判定素數
{
int m=floor(sqrt(n)+0.5);
//這裏sqrt應該都懂……+0.5是避免浮點數誤差,因爲下面枚舉時舉i<=m的,所以不要緊
//如果不用變量m而是直接把sqrt寫循環裏,那會導致每次都計算一遍sqrt,會增加時間
for(int i=2;i<=m;i++)
if(n%i==0)
return false;
return n>1;//最後濾去0和1
}
int qmul(int a,int b,int mod)//快速乘,類似於快速冪
{
int ans=0;
while(b)
{
if(b&1)
ans=(ans+a)%mod;
b>>=1;
a=a*2%mod;
}
return ans;
}
int qpow(int a,int n,int mod)//快速冪,自己在紙上隨便列兩個數寫一遍就懂了
{
int res=1;
while(n)
{
if(n&1)
res=qmul(res,a,mod)%mod;//原型爲res=res*a%mod,這裏沒用longlong怕爆
n>>=1;
a=qmul(a,a,mod)%mod;//原型爲a=a*a%mod
}
return res;
}
int main()
{
int p,a;
while(~scanf("%d%d",&p,&a)&&p|a)
printf("%s\n",a==qpow(a,p,p)&&!isprime(p)?"yes":"no");
return 0;
}