题目大意:给出A,B,C,求(1<=A,C<=1000000000,1<=B<=10^1000000)
题解:欧拉降幂
#include<cstring>
#include<cstdio>
#include<iostream>
using namespace std;
typedef long long ll;
#define mod 1000000007
ll phi(ll n)//返回n的欧拉函数值
{
ll ans = n;
for (ll i = 2 ; i * i <= n ; i++)
{
if (n % i == 0)
{
ans -= ans / i;
while (n % i == 0)
n /= i;
}
}
if (n > 1)
ans -= ans / n;
return ans;
}
long long pow_mod(long long a,long long n,long long m)//a^n mod m
{
long long res=1;
while(n>0)
{
if(n&1==1)
res=res*a%m;
a=a*a%m;
n>>=1;
}
return res;
}
//记得在最后输出结果的时候再模m一次
ll getmod(string s,ll m)
{
int len=s.length();
ll sum=0;
for(int i=0;i<len;++i)
{
sum=(sum*10ll+s[i]-'0')%m;
}
return sum;
}
int main()
{
ll a,c;
string b;
while(cin>>a>>b>>c)
{
ll x=phi(c);
ll bb=getmod(b,x);
bb+=x;
cout<<pow_mod(a,bb,c)<<endl;
}
return 0;
}