Submission details
Task:Exponentiation
Sender:aalto26kh_006
Submission time:2026-11-15 18:26:55 +0200
Language:C++ (C++20)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.01 sdetails
#2ACCEPTED0.26 sdetails
#3ACCEPTED0.25 sdetails

Code

#include <iostream>
#include <vector>

using namespace std;

// https://en.wikipedia.org/wiki/Modular_exponentiation

long long mod_pow(long long b, long long e, long long m){
    if (m == 1)
    {
        return 0;
    }

    long long result = 1;
    b = b % m;

    while (e > 0)
    {
        if (e % 2 == 1) 
        {
            result = (result * b) % m;
        }

        e = e >> 1;
        b = (b * b) % m;
        
    }
    
    return result;
}

int main(){

    long long n; cin >> n;

    vector<long long> output;

    for (long long i = 0; i < n; i++)
    {
        long long a, b;
        cin >> a >> b;
        
        output.push_back(mod_pow(a, b, 1000000007));
    }
    
    for (long long i = 0; i < n; i++)
    {
        cout << output[i] << "\n";
    }
    

    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
10201
0 0
0 1
0 2
0 3
...

correct output
1
0
0
0
0
...

user output
1
0
0
0
0
...

Test 2

Verdict: ACCEPTED

input
200000
129612095 411099530
241615980 487174929
60862511 511830781
758816482 982657640
...

correct output
276067146
838400234
148093882
546897305
467086232
...

user output
276067146
838400234
148093882
546897305
467086232
...

Test 3

Verdict: ACCEPTED

input
200000
692427692 536870911
252480658 536870911
505090334 536870911
27194853 536870911
...

correct output
940305728
707431813
917260341
908974199
375947818
...

user output
940305728
707431813
917260341
908974199
375947818
...