[模板]快速幂

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cstring>
using namespace std;
long long mod,b,p;//mod是模数(有时用),b为底数,p为指数,res为a^p
long long ksm()
{
    long long res=1;
    for(;p;p>>=1,b=b*b%mod)
    if(p&1)
        res=res*b%mod;
    return res%mod;
}
int main()
{
    scanf("%lld%lld%lld",&b,&p,&mod);
    long long bb=b,pp=p,modd=mod;
    printf("%lld^%lld mod %lld=%lld\n",bb,pp,modd,ksm());
    return 0;
}