[LeetCode] Super Pow 超级次方

Your task is to calculate a^b 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.

[LeetCode] Super Pow 超级次方

原文：http://www.cnblogs.com/grandyang/p/5651982.html