NYOJ102 次方求模

链接http://acm.nyist.net/JudgeOnline/problem.php?pid=102

#include<bits/stdc++.h>#define ll long longusing namespace std;ll qpow(ll a,ll k,ll m){    ll r=1;    for(;k;k>>=1){        if(k&1){            r=(r%m)*(a%m)%m;            }        a=(a%m)*(a%m)%m;    }    return r;}int main(){    int n;    cin>>n;    while(n--){        int a,b,c;        cin>>a>>b>>c;        cout<<qpow(a,b,c)<<endl;    }    return 0;}