题解 | #【模板】快速幂Ⅰ ‖ 整数#

模板快速幂

#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <numeric>
#include <ctime>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;
using ll = long long;

const ll N = 1e5 + 5, mod = 1e9 + 7, inf = 2e18;

ll a, b, p;

ll pqmi(ll a, ll b, const ll p) {
    ll ans = 1;

    while (b) {
        if (b & 1) {
            ans = ans * a % p;
        }
        a = a * a % p;
        b >>= 1;
    }
    return ans % p;
}

void solve() {
    cin >> a >> b >> p;

    cout << pqmi(a, b, p) << '\n';
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int t = 1;
    cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}