Task: | Exponentiation |
Sender: | arnxxau |
Submission time: | 2024-11-17 18:42:16 +0200 |
Language: | C++ (C++20) |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.02 s | details |
#2 | ACCEPTED | 0.65 s | details |
#3 | ACCEPTED | 0.70 s | details |
Code
#include <float.h> #include <math.h> #include <stdlib.h> #include <algorithm> #include <climits> #include <iomanip> #include <iostream> #include <set> #include <vector> using namespace std; #define M 1000000007 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; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; cout << modpow(a, b, M) << endl; } }
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 |