372. 超级次方

class Solution {
    public int superPow(int a, int[] b) {
        int ans = 1;
        for(int i=b.length-1;i>=0;i--){
            ans = (int)((long)ans * pow(a,b[i])%1337);
            a  = pow(a,10);
        }
        return ans;
    }
    public int pow(int a,int b){
        if(a==1)return 1;
        int ans = 1;
        while(b!=0){
            if(b%2==1){
                ans = (int)((long)ans * a % 1337);
            }
            a = (int)((long)a * a % 1337);
            b = b / 2;
        }
        return ans;
    }
}