LeetCode 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. 若是对模幂算法不了解可参考 http://blog.csdn.net/taoyanqi8932/article/
相关文章
相关标签/搜索