【leetcode】372. Super Pow

题目：

---

思路：
抄作业https://leetcode.com/problems/super-pow/discuss/84472/C%2B%2B-Clean-and-Short-Solution

引用博文https://blog.csdn.net/qq_27437197/article/details/86720491:

需用到的数学知识：
a^b % 1337 = (a%1337)^b % 1337
xy % 1337 = ((x%1337) * (y%1337)) % 1337

引用Discusshttps://leetcode.com/problems/super-pow/discuss/84472/C%2B%2B-Clean-and-Short-Solution:

观察发现：
a^1234567 % k = (a^1234560 % k) * (a^7 % k) % k = (a^123456 % k)^10 % k * (a^7 % k) % k
看起来比较复杂? 让我们简化一下:
假设f(a, b) 表示a^b % k; 然后将上述公式转换一下，可得 :
f(a,1234567) = f(a, 1234560) * f(a, 7) % k = f(f(a, 123456),10) * f(a,7)%k;
递推式出现了。

powmod函数解释：

---

代码实现：

class Solution {
public:
    const int base = 1337;
    int powmod(int a, int k){ // 求(a^k)%base 
        a %= base;
        int result = 1;
        for (int i = 0; i < k; ++i){
            result = (result * a) % base;
        }
        return result;
    }
    
    int superPow(int a, vector<int>& b) {
        if (b.empty()){
            return 1;
        }
        
        int tial = b.back();
        b.pop_back();
        return powmod(superPow(a,b), 10) * powmod(a, tial) % base;
    }
};

---

参考：
https://leetcode.com/problems/super-pow/discuss/84472/C%2B%2B-Clean-and-Short-Solution
https://blog.csdn.net/qq_27437197/article/details/86720491