---

一、題目描述

---

二、參考代碼

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;void qq(ll a, ll b, ll m)
{if (a == 0) cout << 0 << endl;;ll out = 1;a %= m;while (b > 0){if (b & 1)//奇數的最低位是 1，偶數的最低位是 0 b & 1 是一個位運算操作，它用于檢查變量 b 的最低位是否為 1{out = (out * a) % m;}b >>= 1;a = (a * a) % m;}cout<< out <<endl;
}int main() {ll t, a, b, p;cin >> t;while (t--){cin >> a >> b >> p;qq(a, b, p);}return 0;
}

---