Pseudoprime numbers(poj-3461)

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
3 2
10 3
341 2
341 3
1105 2
1105 3
0 0
Sample Output
no
no
yes
no
yes
yes
题意很明确就是给你两个数b，a；如果b是素数直接输出no，否则的话，如果(a ^b)%b==a输出yes,否则输出no。
注意在poj上交的时候如果用c或者c++ 交sqrt里面的n要变为n*1.0,用G++交的话就没有问题
AC代码如下:

#include<stdio.h>
#include<math.h>
int prime(int n)
{
	long long i,k;
	if(n==1)
		return 0;
	k=(int)sqrt(n);
	for(i=2;i<=k;i++)
		if(n%i==0)
			return 0;
	return 1;
}
int main()
{
	long long a,b,sum,c,c1;
	while(scanf("%lld%lld",&b,&a),a!=0||b!=0)
	{
		c=b;c1=a;
		sum=1;
		if(prime(b)==1)
			printf("no\n");
		else
		{
			while(b>0)//快速幂模板
			{
				if(b&1) sum=(sum*a)%c;
				a=(a*a)%c;
				b=b>>1;
			}
			if(sum%c==c1)
				printf("yes\n");
			else
				printf("no\n");
		}
	}
	return 0;
}