任重而道远
二进制快速幂
ll mpow ( ll a, ll b, ll mod ) {
ll rt;
for (rt = 1; b; b >>= 1, a = a * a % mod)
if (b & 1)
rt = rt * a % mod;
return rt;
}
十进制快速幂
typedef long long ll;
ll a, mod;
char ss[N];
ll mpow ( ll a, ll b, ll mod ) {
ll rt;
for (rt = 1; b; b >>= 1, a = a * a % mod)
if (b & 1)
rt = rt * a % mod;
return rt;
}
int main () {
scanf ("%lld%s%lld", &a, ss, &mod);
int len = strlen (ss);
reverse (ss);
ll base = a;
ll cur = 1;
for (int i = 0; i < len; i++) {
cur = cur * mpow (base, ss[i] - '0', mod) % mod;
base = mpow (base, 10, mod) % mod;
}
printf ("%lld", cur);
}