POJ 3641Pseudoprime numbers【快速幂】

题目

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 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\le 1000000000$ and $1<a<p$, determine whether or not p is a base-a pseudoprime.

大意：判断给定一个数$p$,$p$是否满足条件：1、$p$不是素数。2、满足$a^p\%p=a\%p$。

输入

Input 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 0

样例输出

no
no
yes
no
yes
yes

题目分析

本题主要是在考察快速幂的应用。
快速幂的算法思想在于对底数的更变，减少幂指数大小，从而达到对幂的快速计算。
应用有三条数学公式：
1、$(a+b)\%p=(a\%p+b\%p)\%p$
2、$(a-b)\%p=(a\%p-b\%p)\%p$
3、$(a\ast b)\%p=(a\%p\times b\%p)\%p$

代码

#include <iostream>
using namespace std;

typedef long long ll;

bool isprime(ll m){  //判定素数
	for(int i = 2;i*i <= m;++i){
		if(m%i==0)
		return false;
	}
	return true;
}

bool testp(ll p,ll a){
	ll result = 1,k = p,l =a;
	while(p!=0){
		if(p&1) result=result*a%k;//指数为奇数则结果乘以当前底数以保存
		p>>=1;//指数除以2
		a=a*a%k;//底数相乘，取余，即公式3的应用
	}
	if((l%k) == result)//判定结果是否符合伪素数条件
		return true;
	else
		return false;
}

int main()
{
	ll a,p;
	while(1){
		scanf("%lld%lld",&p,&a);
		if((a==0)&&(p==0)) return 0;
		if(!isprime(p)){
			if(testp(p,a)) cout << "yes"<<endl;
			else cout <<"no"<<endl;
			continue;
		}
		cout << "no"<<endl;
	}
	return 0;
} 

运行结果