仅自己看
算法,转化为二进制即可
#include<iostream>
using namespace std;
long long quickexp(long long base, long long exp, long long mod)
{
long long ans=1;
while(exp)
{
if(exp&1)
ans=( (ans%mod) * (base%mod) )%mod;
base=( (base%mod) * (base %mod) ) %mod;
exp>>=1;
}
return ans;
}
int main()
{
int a,b,c;
while(cin>>a>>b>>c)
cout<<quickexp(a,b,c)<<endl;
return 0;
}