C++ | Leetcode C++题解之第372题超级次方

题目：

题解：

class Solution {const int MOD = 1337;int pow(int x, int n) {int res = 1;while (n) {if (n % 2) {res = (long) res * x % MOD;}x = (long) x * x % MOD;n /= 2;}return res;}public:int superPow(int a, vector<int> &b) {int ans = 1;for (int e: b) {ans = (long) pow(ans, 10) * pow(a, e) % MOD;}return ans;}
};