Task: | Exponentiation |
Sender: | Farah |
Submission time: | 2024-11-21 02:31:28 +0200 |
Language: | C++ (C++20) |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.01 s | details |
#2 | ACCEPTED | 0.24 s | details |
#3 | ACCEPTED | 0.26 s | details |
Code
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int MOD = 1000000007; ll power_mod(ll base, ll exponent, ll mod) { if (exponent == 0 && base == 0) return 1; ll result = 1; base %= mod; if (base < 0) base += mod; while (exponent > 0) { if (exponent & 1LL) result = (__int128(result) * base) % mod; base = (__int128(base) * base) % mod; exponent >>= 1LL; } return result; } int main(){ ios::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; while(n--){ ll a, b; cin >> a >> b; ll res = power_mod(a, b, MOD); cout << res << "\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 ... 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 |