POJ 3641 Pseudoprime numbers 【快速幂+素数筛选】

最新推荐文章于 2020-04-27 18:59:46 发布

Dreamers_Boy

最新推荐文章于 2020-04-27 18:59:46 发布

阅读量178

点赞数

分类专栏：快速幂文章标签：快速幂

本文链接：https://blog.csdn.net/LOOKQAQ/article/details/81130299

版权

快速幂专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Time limit

1000 ms

Memory limit

65536 kB

Linux

Source

Waterloo Local Contest, 2007.9.23

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

Sample Output

no
no
yes
no
yes
yes

题意：当p是非素数以及a^p%p==a同时满意就符合题意，输出yes,否则输出no。

代码如下：

#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
int that_prime(ll n){
	if(n==2||n==1)
	  return 1;
	else
	{
	for(int i=2;i*i<=n;i++)
	  if(n%i==0)
	    return 0;
	return 1;
	}
}
int kusumi(ll a,ll b,ll c){
	ll ans=1;
	a=a%c;
	while(b>0){
		if(b&1) ans=ans*a%c;
		b=b/2;
	    a=a*a%c; 
	}
	return ans;
}
int main(){
	ll p,a;
	while(cin>>p>>a&&p&&a){
		if(!that_prime(p)&&a==kusumi(a,p,p))
		 cout<<"yes"<<endl;
		else
		 cout<<"no"<<endl;
	}
	return 0;
}