HDOJ-1905 Pseudoprime numbers

最新推荐文章于 2019-08-04 16:34:07 发布

Ethan__Han

最新推荐文章于 2019-08-04 16:34:07 发布

阅读量329

点赞数 1

分类专栏：快速幂 HDOJ 素数判定

本文链接：https://blog.csdn.net/Poseidon__ming/article/details/52003475

版权

HDOJ 同时被 3 个专栏收录

37 篇文章 0 订阅

订阅专栏

快速幂

5 篇文章 0 订阅

订阅专栏

素数判定

1 篇文章 0 订阅

订阅专栏

Pseudoprime numbers

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2704 Accepted Submission(s): 1159

Problem Description

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 ≤ 1,000,000,000 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
   
   

   
   此题主要是判断素数和快速幂算法的应用，通过两个函数实现，自己没注意素数从2开始判断....
   
   代码如下：
   
   #include <cstdio>
#include <algorithm>
#include<stdint.h>
#include<math.h>
#include<string.h>
__int64 quickpow(__int64 n,__int64 m,__int64 mod)
{
	__int64 a=1,b=n;
	while(m)
	{
		if(m&1)
		{
			a=(b*a)%mod;
		}
		b=(b*b)%mod;
		m>>=1;
	}
	return a;
}
int su(__int64 a)
{
	for(int i=2;i*i<a;i++)
		if(!(a%i))
		    return 1;
	return 0;
} 
using namespace std;
int main(){
	__int64 p,a;
	while(~scanf("%I64d%I64d",&p,&a)&&p||a)
	{
		if(!su(p)) printf("no\n");
		else
		{
			if(quickpow(a,p,p)==a) printf("yes\n");
			else printf("no\n");
		}
	}
	return 0;
}