Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #define long long long
- const long MOD = 1e9+7;
- using namespace std;
- long binpow(long n, long m)
- {
- if (m == 0)
- return 1;
- long tpr = binpow(n, m/2);
- if (m % 2)
- return tpr*tpr%MOD*n%MOD;
- else
- return tpr*tpr%MOD;
- }
- int main()
- {
- cin.tie(0)->sync_with_stdio(0);
- cout.tie(0)->sync_with_stdio(0);
- //freopen("luythua2cap.inp", "r", stdin);
- long T;
- cin >> T;
- while (T--){
- long a, b, c;
- cin >> a >> b >> c;
- cout << binpow(a, b*c) << '\n';
- cout << binpow(binpow(a, b), c) << '\n';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment