372. 超级次方快速幂

Posted 2021-12-29 幽殇默

https://leetcode-cn.com/problems/super-pow/

class Solution 
public:
    typedef long long int LL;
    const int mod=1337;
    LL quick_mi(LL a,LL b,LL p)
    
        LL sum=1;
        while(b)
        
            if(b&1) sum=sum*a%p;
            b>>=1;
            a=(a*a)%p;
        
        return sum%p;
    
    int superPow(int a, vector<int>& b) 
    
        LL ans=1,temp=a;
        for(int i=b.size()-1;i>=0;i--)
        
            ans=ans*quick_mi(temp,b[i],mod)%mod;
            temp=quick_mi(temp,10,mod);
        
        return ans;
    
;