51nod 1046 A^B Mod C（快速幂）

51nod 1046 A^B Mod C

快速幂模板题

#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#include <queue>#include <map>using namespace std;#define INF 0x3f3f3f3f#define PI acos(-1.0)#define MOD 10007#define N 110000long long quick_mi(long long a,long long b,long long mod){    long long ans = 1;    while(b)    {        if(b&1) ans = (ans*a)%mod;        a = (a*a)%mod;        b >>= 1;    }    return ans;}int main(){    long long a,b,c;    scanf("%lld%lld%lld",&a,&b,&c);    long long x = quick_mi(a,b,c);    printf("%lld\n",x);    return 0;}