#372

Super Pow

expert · 1120 · lc medium +32 · verified · 36.4% accepted · 1,074 likes · top 14%

Description

Compute a^b modulo 1337. Here a is a positive integer while the enormous exponent b is represented digit-by-digit as an array.

Example 1:

Input: a = 2, b = [3]

Output: 8

Example 2:

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

Output: 1024

Example 3:

Input: a = 1, b = [4,3,3,8,5,2]

Output: 1

Code

1

2

3

class Solution:
    def superPow(self, a: int, b: List[int]) -> int:

class Solution:
    def superPow(self, a: int, b: List[int]) -> int: