HDOJ 题目1905 Pseudoprime numbers（快速幂）

Pseudoprime numbers

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

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

  
  

   
   3 2
10 3
341 2
341 3
1105 2
1105 3
0 0
  
  

 

Sample Output

  
  

   
   no
no
yes
no
yes
yes
  
  

 

Author

Gordon V. Cormack

 

Source

2008-1杭电公开赛(非原创)

 

Recommend

lcy   |   We have carefully selected several similar problems for you:   1399  2333  2648  1551  2241 

 

ac代码

#include<stdio.h>
#include<math.h>
#include<string.h>
__int64 qpow(__int64 a,__int64 b)
{
	__int64 mod=b,ans=1;
	while(b)
	{
		if(b&1)
			ans=(ans*a)%mod;
		a=(a*a)%mod;
		b/=2;
	}
	return ans;
}
int jdu(__int64 n)
{
	__int64 i;
	for(i=2;i*i<=n;i++)
	{
		if(n%i==0)
			return 0;
	}
	return 1;
}
int main()
{
	__int64 a,b;
	while(scanf("%I64d%I64d",&b,&a)!=EOF,a||b)
	{
		if(jdu(b))
			printf("no\n");
		else
		{
			int ans=qpow(a,b);
			if(ans==a)
				printf("yes\n");
			else
				printf("no\n");
		}
	}
}