[leetCode] 372. Super Pow (Python)

Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.

 

Example 1:

Input: a = 2, b = [3]
Output: 8

Example 2:

Input: a = 2, b = [1,0]
Output: 1024

Solution

class Solution:
    def superPow(self, a: int, b: List[int]) -> int:
        answer = 1
        for b_val in b[::-1]:
            answer = answer * a ** b_val % 1337
            a = pow(a, 10) % 1337
        return answer

 

SOMJANG/CODINGTEST_PRACTICE