华华教月月做数学(快速幂+快速乘)

https://ac.nowcoder.com/acm/contest/392/B?tdsourcetag=s_pctim_aiomsg

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b,Mod;
 
ll Mult(ll a,ll b,ll Mod){		//快速乘
    ll res = 0,base = a;
    while(b){
        if(b&1) res = (res + base) % Mod;
        base = (base + base) % Mod;
        b >>= 1;
    }
    return res;
}
 
ll Pow(ll a,ll b,ll Mod){		//快速幂
    ll res = 1,base = a;
    while(b){
        if(b&1) res = Mult(res,base,Mod) % Mod;
        base = Mult(base,base,Mod) % Mod;
        b >>= 1;
    }
    return res;
}
 
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%lld%lld%lld",&a,&b,&Mod);
        printf("%lld\n",Pow(a,b,Mod));
    }
 
    return 0;
}