快速幂模板c++

原题

#include<iostream>#include<iomanip>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespace std;long long b,p,k;int main(){    scanf("%lld%lld%lld",&b,&p,&k);    long long ans=1;long long a=b,l=p;    for(;l;l>>=1,a=(a*a)%k)    {        if(l&1)        {            ans=(ans*a)%k;        }    }    printf("%lld^%lld mod %lld=%lld",b,p,k,ans);    return 0;}