版权声明:欢迎转载,转载请标明作者和出处。 https://blog.csdn.net/ljw_study_in_CSDN/article/details/88084725
#include <bits/stdc++.h>
using namespace std;
long long quickmod(long long a,long long b,long long mod)
{
long long ans=1;
while(b)
{
if(b%2==1)
{b--;ans=ans*a%mod;}
a=a*a%mod;
b=b/2;
}
return ans;
}
int main()
{
long long a,b,c;
while(cin>>a>>b>>c)
printf("%lld\n",quickmod(a,b,c));
return 0;
}