Exponentiation

#include <bits/stdc++.h>

using namespace std;

constexpr int M = (int) 1e9 + 7;

int exponentiation(int x, int p) {

    if (p == 0) {
        return 1;
    } else if (p == 1) {
        return x;
    } else if (p % 2 == 0) {
        long long r = exponentiation(x, p/2);
        return (r * r) % M;
    } else {
        long long r = exponentiation(x, p/2);
        return (((r * r) % M) * x) % M;
    }

}

int modpow(int x, int n, int m) {
    if (n == 0) return 1%m;
    long long u = modpow(x,n/2,m);
    u = (u*u)%m;
    if (n%2 == 1) u = (u*x)%m;
    return u;
}

int main() {

    int n;
    cin >> n;

    vector<int> output(n);

    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;
        output[i] = exponentiation(a, b);
    }

    for (int o : output)
        cout << o << endl;

}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED