Task: | Exponentiation |
Sender: | Niilo |
Submission time: | 2024-11-14 08:59:56 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.02 s | details |
#2 | ACCEPTED | 0.51 s | details |
#3 | ACCEPTED | 0.51 s | details |
Code
#include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for(int i=a;i<(b);++i) #define all(x) begin(x),end(x) #define sz(x) int((x).size()) using ll = long long; using pii = pair<int,int>; using vi = vector<int>; using ld = long double; const int M = 1e9+7; int mpow(ll a, ll p) { ll r = 1; while (p != 0) { if (p & 1) { r *= a; r %= M; } a *= a; a %= M; p >>= 1; } return r; } int main() { int n; cin >> n; rep(i,0,n) { int a, b; cin >> a >> b; cout << mpow(a,b) << '\n'; } }
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 ... |