返回题解分享
讨论 / 题解分享/ 帖子详情

快速幂 - 题解

#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef pair<int,int> aII;  
using ll = long long;
using ULL = unsigned long long;
const int N = 1e6+5;

inline ll qmi(ll a, ll b, ll p) {
    ll res = 1 % p;
    for (; b; b >>= 1) {
        if (b&1) res = res * a % p;
        a = a * a % p; 
    }
    return res;
}

inline void solve() { 
    ll a, b, p;
    cin >> a >> b >> p;
    cout << qmi(a, b, p) << endl;
}
int main() { 
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    //int _ = 1; 
    int _; cin >> _;
    while (_--) solve();
    return 0;
}
0 回复 0 转发 0 喜欢 3 阅读
回复 (0)
默认 最新
暂无回复,快来抢沙发!