package
0.0.0-20190725034537-db5e768ce8c3
Repository: https://github.com/frankegoesdown/leetcode-in-go.git
Documentation: pkg.go.dev

# README

372. Super Pow

题目

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.

Example1:
a = 2
b = [3]

Result: 8

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

Result: 1024

Credits:Special thanks to @Stomach_ache for adding this problem and creating all test cases.

解题思路

见程序注释