class Solution(object):
def __init__(self):
self.base = 1337
def superPow(self, a, b):
"""
:type a: int
:type b: List[int]
:rtype: int
"""
# One knowledge: ab % k = (a%k)(b%k)%k
# a^1234567 % k = (a^1234560 % k) * (a^7 % k) % k = (a^123456 % k)^10 % k * (a^7 % k) % k
if b is None or len(b) == 0:
return 1
last_digit = b.pop()
return self.powmod(self.superPow(a, b), 10) * \
self.powmod(a, last_digit) % self.base
def powmod(self, a, k):
a %= self.base
result = 1
for i in range(k):
result = (result * a) % self.base
return result
Download Super Pow.pyLeetcode 372 Super Pow problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.