class Solution {
private:
int base=1337;
int mypow(int a,int k)
{
a%=base;
int ret=1;
for(int i=0;i<k;i++)
{
ret=(ret*a)%base;
}
return ret;
}
public:
int superPow(int a, vector<int>& b) {
if(b.size()==0)
return 1;
int lastdigit=b.back();
b.pop_back();
return mypow(superPow(a,b),10)*mypow(a,lastdigit)%base;
}
};
372. Super Pow
最新推荐文章于 2024-03-10 03:10:16 发布