| Task: | Exponentiation |
| Sender: | banghalq |
| Submission time: | 2025-11-13 10:59:19 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | details |
| #2 | ACCEPTED | 0.28 s | details |
| #3 | ACCEPTED | 0.30 s | details |
Code
#include <iostream>
#include <vector>
using namespace std;
const int m = 1000000007;
int modpow(int a, int b) {
if (b == 0) {
return 1 % m;
}
long long u = modpow(a, b / 2);
u = (u * u) % m;
if (b % 2 == 1) {
u = (u * a) % m;
}
return u;
}
int main() {
int n;
cin >> n;
vector<int> res;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
res.push_back(modpow(a, b));
}
for (int elt : res) {
cout << elt << "\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 |
