快速幂取模算法 | 一瓜算法小册 about algo HOT 1 OPEN

def superPow(self, a: int, b: List[int]) -> int:
    res = 1
    ind = 1
    for i in range(len(b) - 1, -1, -1):
        v = b[i] * ind
        x = a
        while v > 0:
            if v & 1:
                res *= x
                res %= 1337
            x *= x
            x %= 1337
            v >>= 1          
        ind *= 10
    return res % 1337