快速幂

给出3个正整数A B C，求A^B Mod C。

例如，3 5 8，3^5 Mod 8 = 3。

Input

3个正整数A B C，中间用空格分隔。(1 <= A,B,C <= 10^9)

Output

输出计算结果

Sample Input

3 5 8

Sample Output

3

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
ll sm(ll a,ll b,ll mod)
{
	ll res=1;
	while(b)
	{
		if(b&1)
		{
			res=res*a%mod;
		}
		a=a*a%mod;
		b=b>>1;
	}
	return res;
}
int main()
{
	ll a,b,c;
	cin >>a>> b>>c;
	cout << sm(a,b,c) << endl;
	return 0; 
}

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-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

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

Sample Output

no
no
yes
no
yes
yes

#include<stdio.h>
typedef long long ll;
ll sm(ll a,ll b,ll mod)
{
	ll res=1;
	while(b)
	{
		if(b&1)
		{
			res=res*a%mod;
		}
		a=a*a%mod;
		b=b>>1;
	}
	return res;
}
bool init(ll a)
{
	for(ll i=2;i*i<=a;i++)
		 if(a%i==0)return false;
	return true;
}
int main()
{
	ll p,a;
	while(scanf("%lld%lld",&p,&a))
	{
		if(p==0&&a==0)break;
		if(init(p))printf("no\n");
		else
		{
			if(sm(a,p,p)==a)printf("yes\n");
		   else printf("no\n");
		}
	}
	return 0;
}