Submission details
Task:Exponentiation
Sender:aalto26kh_010
Submission time:2026-11-16 15:33:11 +0200
Language:Python3 (PyPy3)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.21 sdetails
#2ACCEPTED0.87 sdetails
#3ACCEPTED0.54 sdetails

Code

'''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;
}'''

import sys
inp = sys.stdin.read().split()

n = int(inp[0])
a = []
b = []
m = 10**9 + 7

def modpow(x,n,m):
    if n ==0 :
        return 1 % m
    u = modpow(x,n//2,m)
    u = (u*u) % m 
    if(n%2 == 1) :
        u = (u*x) % m 
    return u
sys.setrecursionlimit(10**6)

for i in range(1,2*n,2):
    print(modpow(int(inp[i]),int(inp[i+1]),m))
    '''
    a.append(int(inp[i]))
    b.append(int(inp[i+1]))'''

#print(n,a,b)

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
...