Submission

Status:

[PPPPPPPPPPPPPPPPPPPP]

Score: 100

User: Monasm

Problemset: ยกกำลัง

Language: cpp

Time: 0.028 second

Submitted On: 2024-10-03 15:27:45

#include <bits/stdc++.h>

using namespace std;

int mod = 1e9 + 7;

int power(int n, int m) {
    if (m == 0) return 1;
    if (m == 1) return n % mod;
    n = n % mod;
    if (m % 2 == 0) {
        int x = power(n,m/2);
        return (1LL*x*x)%mod;
    }
    else{
        int x = power(n,m/2);
        return (1LL*n*(1LL*x*x%mod))%mod;
    }
}

int main() {
    int q;
    cin >> q;
    while (q--) {
        int n, m;
        cin >> n >> m;
        cout << power(n, m) << endl;
    }
}