题目链接: 超级次方
有关题目
你的任务是计算 ab 对 1337 取模,a 是一个正整数,b 是一个非常大的正整数且会以数组形式给出。
示例 1:
输入:a = 2, b = [3]
输出:8
示例 2:
输入:a = 2, b = [1,0]
输出:1024
示例 3:
输入:a = 1, b = [4,3,3,8,5,2]
输出:1
示例 4:
输入:a = 2147483647, b = [2,0,0]
输出:1198
提示:
1 <= a <= 2^31 - 1
1 <= b.length <= 2000
0 <= b[i] <= 9
b 不含前导 0
题解
法一:倒序遍历
Tips
参考官方题解
class Solution {
public:
const int MOD = 1337;
int pow(int x, int n)//计算X^n
{
int res = 1;
while(n)
{
if (n % 2)
{
res = (long)res * x % MOD;
}
x = (long)x * x % MOD;
n /= 2;
}
return res;
}
int superPow(int a, vector<int>& b) {
int ans = 1;
for (int i = b.size() - 1; i >= 0; i--)
{
ans = (long)ans * pow(a, b[i]) % MOD;
a = pow(a, 10);//递推计算
}
return ans;
}
};
法二:秦九韶算法(前序遍历)
Tips
参考官方题解
class Solution {
public:
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;
}
int superPow(int a, vector<int>& b) {
int ans = 1;
for (int i = 0; i < b.size(); i++)
{
ans = (long)pow(ans, 10) * pow(a, b[i]) % MOD;
}
return ans;
}
};