Submission details
Task:Exponentiation
Sender:aalto25k_002
Submission time:2025-11-17 00:07:00 +0200
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.28 sdetails
#2--details
#3--details

Code

def myPow(x, n):
    if n == 0:
        return 1
    if n % 2 == 0:
        return myPow(x * x, n // 2)
    else:
        return x * myPow(x * x, n // 2)
        

if __name__ == "__main__":
    MOD = 10**9+7
    n = int(input())
    result = []
    for i in range(n):
        x, p = map(int, input().split())
        result.append(myPow(x, int(p)) % MOD)
    for i in range(n):
        print(result[i])

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:

input
200000
129612095 411099530
241615980 487174929
60862511 511830781
758816482 982657640
...

correct output
276067146
838400234
148093882
546897305
467086232
...

user output
(empty)

Test 3

Verdict:

input
200000
692427692 536870911
252480658 536870911
505090334 536870911
27194853 536870911
...

correct output
940305728
707431813
917260341
908974199
375947818
...

user output
(empty)