| Task: | Exponentiation |
| Sender: | aalto26kh_001 |
| Submission time: | 2026-11-12 11:13:15 +0200 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.06 s | details |
| #2 | ACCEPTED | 0.30 s | details |
| #3 | ACCEPTED | 0.32 s | details |
Code
# FULL TEMPLATE: delete every block you don't use. Blocks don't depend on each other.
# Nodes are 1..n (slot 0 unused). Arrays are 0-indexed.
import sys
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from itertools import accumulate, permutations, combinations, product
from functools import lru_cache, cmp_to_key
from math import gcd, isqrt, comb, inf
input = sys.stdin.readline
MOD = 10**9 + 7
def I(): return int(input()) # "5" -> 5
def MI(): return map(int, input().split()) # "8 4" -> n, q = MI()
def LI(): return list(map(int, input().split())) # "3 2 4 5" -> [3, 2, 4, 5]
def S(): return input().strip() # "BABAZA", ".*.#" (kept as text)
def LS(): return input().split() # "? 2 3" -> ['?', '2', '3']
def main():
out = []
for _ in range(I()):
a, b = MI()
out.append(pow(a, b, MOD))
print("\n".join(map(str, out)))
main()
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 ... |
