HPUOJ---2017寒假作业--专题-1/K-Pseudoprime numbers（伪素数）

最新推荐文章于 2018-08-10 16:34:36 发布

promise_yaner

最新推荐文章于 2018-08-10 16:34:36 发布

阅读量643

点赞数

分类专栏：快速幂数学文章标签： c语言

本文链接：https://blog.csdn.net/Greenary/article/details/56301301

版权

数学同时被 2 个专栏收录

15 篇文章 0 订阅

订阅专栏

快速幂

5 篇文章 0 订阅

订阅专栏

K - Pseudoprime 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 p^th power and divide by p, the remainder isa. 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-apseudoprimes for all a.)

Given 2 < p ≤ 1000000000 and 1 < a < p, determine whether or not p is a base-apseudoprime.

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

思路：（1）：p是非素数。

      （2）：a的p次方对p取余不等于a.

#include<cstdio>
typedef long long LL;
LL Quick_MI(LL a,LL b,LL c)
{
	int s=1;
	a=a%c;
	while(b)
	{
		if(b&1)
		{
			s=(s*a)%c;
		}
		a=(a*a)%c;
		b=b/2;
	}
	return s;                       //快速幂 
}
typedef long long LL;
LL SS (LL x)
{
	long long i;
	for(i=2;i*i<=x;i++)
	{
		if(x%i==0)
		   return 0;
	}
	return 1;
}                             //素数判断 
int main()
{
	long long p,a,k;
	while(scanf("%lld%lld",&p,&a),p||a)
	{
		k=Quick_MI(a,p,p);
		if((!SS(p))&&k==a)
		{
			printf("yes\n");
		}
		else
		    printf("no\n");
	}
	return 0;
}