Golang | Leetcode Golang题解之第372题超级次方
题目：
题解：
const mod = 1337func pow(x, n int) int {res := 1for ; n > 0; n /= 2 {if n&1 > 0 {res = res * x % mod}x = x * x % mod}return res
}func superPow(a int, b []int) int {ans := 1for _, e := range b {ans = pow(ans, 10) * pow(a, e) % mod}return ans
}