| Task: | Exponentiation |
| Sender: | aalto26kh_015 |
| Submission time: | 2026-11-14 00:15:07 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | details |
| #2 | ACCEPTED | 0.15 s | details |
| #3 | ACCEPTED | 0.17 s | details |
Code
#include <iostream>
using namespace std;
typedef long long ll;
const ll mod = 1'000'000'000 + 7;
ll ModPow(ll base, ll ex) {
if (ex == 0) return 1;
ll tmp = ModPow(base, ex/2);
tmp = (tmp * tmp) % mod;
if (ex % 2 == 1) tmp = (tmp * base) % mod;
return tmp;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int n;
cin >> n;
ll a, b;
for (int i=0; i<n; i++) {
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 ... |
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 ... |
