ARST打卡第135周[135/521]

发表于 2021-12-05 分类于 ARST 阅读次数：

lc372_超级次方 supervisor文档 python3+ftplib实现ftp客户端查配置文件中配置项，不存在则添加

Algorithm

lc372_超级次方

思路:快速幂算法…n * log(k)

链接：https://leetcode-cn.com/problems/super-pow/solution/chao-ji-ci-fang-by-leetcode-solution-ow8j/

class Solution {
    const int MOD = 1337;

    int pow(int x, int n) {
        int res = 1;
        while (n) {
            if (n % 2) {
                res = (long) res * x % MOD;
            }
            x = (long) x * x % MOD;
            n /= 2;
        }
        return res;
    }

public:
    int superPow(int a, vector<int> &b) {
        int ans = 1;
        for (int i = b.size() - 1; i >= 0; --i) {
            ans = (long) ans * pow(a, b[i]) % MOD;
            a = pow(a, 10);
        }
        return ans;
    }
};