Task: | Exponentiation |
Sender: | louaha1 |
Submission time: | 2024-11-19 21:49:52 +0200 |
Language: | Python3 (PyPy3) |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.06 s | details |
#2 | ACCEPTED | 0.36 s | details |
#3 | ACCEPTED | 0.40 s | details |
Code
# Define the modulo constant MOD = 10**9 + 7 # Read input import sys input = sys.stdin.read data = input().splitlines() # Number of calculations n = int(data[0]) # Prepare results results = [] # Process each calculation for i in range(1, n + 1): a, b = map(int, data[i].split()) # Compute a^b % MOD results.append(pow(a, b, MOD)) # Print the results print('\n'.join(map(str, results)))
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 ... |