996A

https://ac.nowcoder.com/acm/contest/996/A
快速幂模板
注意模运算规律

#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a, b, p;
ll quick_pow(ll a,ll b,ll mod)
{
    ll ans = 1,base = a;
    while(b)
    {
        if(b&1)
            ans = ans * base % mod;
        base = base * base % mod;
        b >>= 1;
    }
    return ans % mod;
}

int main()
{
    while(~scanf("%lld%lld%lld",&a,&b,&p))
    {
        printf("%lld\n", quick_pow(a, b, p));
    }
    return 0;
}