思路:
递推公式:
class Solution:
def superPow(self, a: int, b: List[int]) -> int:
mod = 1337
ans = 1
a = a % mod
for i in b:
ans = pow(ans, 10, mod) * pow(a, i, mod ) % mod
return ans
思路:
递推公式:
class Solution:
def superPow(self, a: int, b: List[int]) -> int:
mod = 1337
ans = 1
a = a % mod
for i in b:
ans = pow(ans, 10, mod) * pow(a, i, mod ) % mod
return ans