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 < = 2 31 − 1 1 <= a <= 2^{31} - 1 1<=a<=231−1
- 1 < = b . l e n g t h < = 2000 1 <= b.length <= 2000 1<=b.length<=2000
- 0 < = b [ i ] < = 9 0 <= b[i] <= 9 0<=b[i]<=9
- b 不含前导 0
不考虑求模的要求,以 b = [3,2,7,8] 来举例,结合指数运算的法则,我们可以发现这样的一个规律:
a [ 3 , 2 , 7 , 8 ] = a 4 × a [ 3 , 2 , 7 , 0 ] = a 8 × ( a [ 3 , 2 , 7 ] ) 10 \begin{aligned} &a^{[3,2,7,8]} \\ =& a^{4} \times a^{[3,2,7,0]} \\ =& a^{8} \times (a^{[3,2,7]})^{10} \end{aligned} ==a[3,2,7,8]a4×a[3,2,7,0]a8×(a[3,2,7])10
因为问题的规模缩小了,递归的标志
class Solution {
public:
int mod = 1337;
int superPow(int a, vector<int>& b) {
if(b.size() == 0) return 1;
int last = b.back();
b.pop_back();
int re1 = fastpow(a,last);
int re2 = fastpow(superPow(a,b),10);
return (re1*re2)%mod;
}
long long fastpow(int a,int b){ //快速幂取模
long long res=1;
a%=mod;
while(b){
if(b&1) res = (res*a)%mod;
b>>=1;
a = (a*a)%mod;
}
return res;
}
};
#测试案例
195412 [3,0,3,9,7,2,2,0,4,3,8,2,5,8,6,8,3,3,9,2,6,5,7,2,8,3,0,4,6,7,7,8,0,2,7,7,4,2,8,1,7,6,5,4,6,1,2,2,4,3,4,2,8,1,5,9,5,7,3,3,5,2,1,5,5,1,4,1,3,2,2,2,1,7,7,7,0,9,9,6,5,3,9,5,7,4,4,2,3,0,5,8,2,8,5,7,9,2,9,4,4,3,7,7,3,4,5,3,5,6,2,0,2,1,6,9,7,2,3,0,2,0,1,5,8,8,4,0,0,3,4,7,7,3,4,0,9,1,5,5,8,7,7,0,0,3,1,9,8,6,0,0,6,3,7,6,3,2,6,4,5,3,1,4,8,7,4,8,9,2,5,7,9,2,9,0,8,2,9,6,8,1,6,4,6,4,2,0,6,1,4,3,6,7,8,4,4,4,2,3,6,7,2,6,2,1,8,0,3,9,6,3,3,4,7,9,8,2,9,6,3,5,2,9,4,0,3,9,6,8,4,3,7,7,1,9,0,9,9,6,0,5,9,3,2,9,3,0,1,4,9,4,0,1,3,4,3,8,5,9,8,2,2,6,9,5,5,1,6,7,7,7,4,7,0,6,8,5,9,9,2,0,3,2,1,8,8,6,6,6,5,7,8,0,3,9,5,0,0,2,7,0,1,2,9,3,0,7,9,9,6,1,9,1,5,2,9,5,8,7,1,6,4,1,6,7,0,3,0,3,7,7,3,8,1,2,2,2,9,3,1,5,6,3,6,1,5,7,8,4,4,2,0,1,3,8,0,6,3,0,9,1,0,2,1,1,6,3,3,5,8,7,2,4,0,0,7,7,7,6,3,3,8,5,6,3,3,7,9,9,9,8,0,9,2,1,1,8,7,6,3,7,3,7,2,5,7,1,5,4,7,8,0,7,4,6,1,9,5,0,8,5,1,0,4,3,4,7,2,1,4,7,0,9,5,4,7,2,6,2,9,3,0,9,3,4,7,4,6,3,6,4,0,7,5,4,1,9,2,5,2,8,2,4,7,7,9,4,2,5,6,1,0,9,2,3,3,1,9,1,6,6,6,6,3,3,1,6,4,5,3,8,3,6,2,2,5,1,7,9,6,5,2,7,4,4,2,0,8,2,1,4,8,9,3,3,2,6,2,8,1,5,6,6,3,9,8,9,0,7,8,9,3,1,8,7,7,0,9,7,2,1,4,2,0,7,8,5,3,0,3,6,7,0,2,1,1,2,0,1,0,0,2,5,3,0,4,3,1,4,0,5,7,6,0,7,3,0,4,8,0,0,4,9,2,8,0,3,3,0,6,3,3,9,0,8,1,4,1,4,8,4,2,5,0,2,5,4,4,1,4,6,1,9,5,3,9,6,8,2,8,5,7,1,6,7,0,7,2,3,2,2,7,4,0,0,8,5,6,2,8,0,8,0,9,3,5,1,1,4,3,0,1,1,3,7,0,5,4,2,9,8,7,8,2,7,8,2,4,4,4,2,5,4,2,6,0,0,9,1,4,3,1,5,6,7,4,8,2,8,3,1,7,0,2,1,7,0,4,1,7,0,3,4,5,8,2,7,8,2,8,4,7,2,1,5,9,5,3,1,5,6,5,4,6,7,6,5,9,2,6,6,2,2,0,9,0,3,6,0,7,7,6,4,9,9,9,0,6,2,3,1,9,0,6,7,7,4,3,9,6,1,5,8,3,8,0,5,3,6,7,0,3,3,4,4,4,3,6,0,5,0,4,6,0,2,4,0,6,9,9,4,0,6,4,4,4,4,9,7,3,9,7,8,4,3,3,9,6,9,1,4,1,5,0,4,7,6,6,5,5,5,9,6,3,6,2,8,0,3,7,3,2,7,2,7,0,7,6,7,8,7,1,2,5,3,6,4,0,2,0,7,9,1,3,2,7,7,2,0,1,0,5,3,9,9,0,9,8,8,8,9,8,1,1,5,5,9,9,7,3,1,6,2,5,2,6,4,9,9,4,0,1,2,4,2,1,6,1,2,7,0,1,5,1,2,0,8,3,1,7,6,3,4,8,8,6,6,2,5,7,9,6,8,1,2,2,4,8,4,6,5,6,9,2,9,3,4,8,6,6,7,2,9,1,0,7,7,9,1,5,6,0,3,7,1,5,9,8,5,3,6,1,1,6,5,1,9,0,1,6,6,8,0,5,2,1,4,1,2,7,6,8,8,9,5,1,6,5,9,2,0,8,3,2,4,0,5,5,0,6]
输出:
1113