leetcode:數學：spuer pow（372）

https://leetcode.com/problems/super-pow/git http://blog.csdn.net/happyxuma1991/article/details/51867822web class Solution { const int base = 1337; int powmod(int a, int k) //a^k mod 1337 w

>>阅读原文<<