poj 3641 Pseudoprime numbers

Pseudoprime numbers

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8291		Accepted: 3471

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 p^th 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

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

Sample Output

no
no
yes
no
yes
yes

Source

Waterloo Local Contest, 2007.9.23

伪合数：

一,判断是合数

二,快速幂+取模

代码：

#include<cstdio>
long long mod_pow(long long x,long long n,long long mod)
 {
 	long long ans=1;
 	while(n)
 	{
 		if(n&1)
 			ans=(ans*x)%mod;
 		x=(x*x)%mod;
 		n>>=1;
	 }
	 return ans;
 }
 int main()
 {
 	long long p,a; 
 	while(scanf("%lld%lld",&p,&a)&&(p||a))
 	{
 		int f=0;
 		for(int i=2;i*i<=p;i++)   //合数 
 		{
 			if(p%i==0)
 			{
 				f=1;
 				break;
			 }
		 }
 		if(f)
 		{
 			if(mod_pow(a,p,p)==a)
		 		printf("yes\n");
		 	else
		 		printf("no\n");
		 }
		else
			printf("no\n");
	 }
	 return 0;
 }

判断素数：

如果是一个整数的素数测试，o(n^1/2),

如果一个整数内素数个数，打表法！