Submission details
Task:Exponentiation
Sender:usvafe
Submission time:2025-11-16 19:16:26 +0200
Language:C++ (C++17)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#2ACCEPTED0.58 sdetails
#3ACCEPTED0.58 sdetails

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int M = 1e9 + 7;

ll modpow(ll a, ll b) {
	if (b == 0) return 1;
	ll t = modpow(a, b/2);
	t = (t * t) % M;
	if (b%2==1) t = (t * a) % M;
	return t;
}

int main() {
	int n;
	cin >> n;
	for (int i=0; i<n; i++) {
		ll a, b;
		cin >> a >> b;
		cout << modpow(a, b) << '\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
...
Truncated

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
...
Truncated

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
...
Truncated