数学 - 超级次方 - Leetcode 372
你的任务是计算 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 ≤ 231 - 1
1 ≤ b.length ≤ 2000
0 ≤ b[i] ≤ 9
b 不含前导 0
分析:
b 的长度较短,考虑从 b 入手:
记 n = b . l e n g t h n = b.length n=b.length
方法一:倒序遍历
直接推导公式,然后按递增的顺序遍历:
b = ∑ i = 0 n − 1 b i × 1 0 n − 1 − i = ∑ j = n − 1 0 b j × 1 0 n − 1 − j b=\sum_{i=0}^{n-1}b_i×10^{n-1-i}=\sum_{j=n-1}^{0}b_{j}×10^{n-1-j} b=i=0∑n−1bi×10n−1−i=j=n−1∑0bj×10n−1−j
则:
a b = ∏ i = n − 1 0 ( a 1 0 n − 1 − i ) b i a^b=\prod_{i=n-1}^{0}(a^{10^{n-1-i}})^{b_{i}} ab=i=n−1∏0(a10n−1−i)bi
class Solution {
public:
int quick_pow(int a, int b)
{
int res = 1;
while(b)
{
if(b & 1) res = (long long) res * a % 1337;
a = (long long) a * a % 1337;
b >>= 1;
}
return res;
}
int superPow(int a, vector<int>& b)
{
int ans = 1;
int n = b.size();
for(int i = n - 1; i >= 0; i --)
ans = ans * quick_pow(a, b[i]) % 1337,
a = quick_pow(a, 10);
return ans;
}
};
错误示范:
for(int i = n - 1; i >= 0; i --)
{
//ans = ans * quick_pow(a, b[i]) % 1337,
//a = quick_pow(a, 10);
int t = quick_pow(a, quick_pow(10, n - 1 - i));
ans = (long long) ans * quick_pow(t, b[i]) % 1337;
}
注意: 不要单独计算指数 1 0 n − 1 − i 10^{n-1-i} 10n−1−i,这会导致我们对指数取模,这不满足分配律,上面这个写法就是错误的。
方法二:正序遍历
找到每一项与前一项的递推关系:
记 : f [ n ] = ∑ i = 0 n − 1 b i × 1 0 n − 1 − i n ≥ 1 记:f[n]=\sum_{i=0}^{n-1}b_i×10^{n-1-i}\qquad n\ge 1 记:f[n]=i=0∑n−1bi×10n−1−in≥1
f [ n ] = ( ∑ i = 0 n − 2 b i × 1 0 n − 1 − i ) + b n − 1 = f [ n − 1 ] × 10 + b n − 1 f[n]=(\sum_{i=0}^{n-2}b_i×10^{n-1-i})+b_{n-1}=f[n-1]×10+b_{n-1} f[n]=(i=0∑n−2bi×10n−1−i)+bn−1=f[n−1]×10+bn−1
则:
a b = g [ n ] = a f [ n ] = ( a f [ n − 1 ] ) 10 ⋅ a b n − 1 = g [ n − 1 ] 10 ⋅ a b n − 1 , f [ 0 ] = 1 , g [ 0 ] = a 10 ⋅ a b 0 a^b=g[n]=a^{f[n]}=(a^{f[n-1]})^{10}·a^{b_{n-1}}=g[n-1]^{10}·a^{b_{n-1}},\qquad f[0]=1,g[0]=a^{10}·a^{b_0} ab=g[n]=af[n]=(af[n−1])10⋅abn−1=g[n−1]10⋅abn−1,f[0]=1,g[0]=a10⋅ab0
class Solution {
public:
int quick_pow(int a, int b)
{
int res = 1;
while(b)
{
if(b & 1) res = (long long) res * a % 1337;
a = (long long) a * a % 1337;
b >>= 1;
}
return res;
}
int superPow(int a, vector<int>& b)
{
int ans = 1;
int n = b.size();
for(int i = 0; i < n; i ++)
ans = quick_pow(ans, 10) * quick_pow(a, b[i]) % 1337;
return ans;
}
};