Leetcode 1808. Maximize Number of Nice Divisors 快速幂

• 类似题 343割绳子，50快速幂
• 快速幂中，数据类型根据题意来，可能是int, double, long long。中间计算结果防止溢出故再多乘1ll，同理如果是加法（本题中没遇到）就+0ll

class Solution {
public:
    int maxNiceDivisors(int primeFactors) {
        if(primeFactors==1) return 1;
        if(primeFactors==2) return 2;
        
        int mod = 1e9+7;
        int a = primeFactors/3;
        if(primeFactors%3==0) return qmi(3,a,mod)%mod;
        if(primeFactors%3==1) return qmi(3,a-1,mod)*1ll*4%mod;
        if(primeFactors%3==2) return qmi(3,a,mod)*1ll*2%mod;
        return 0;
    }
    
    
    int qmi(int m, int k, int p)
    {
        int res = 1, t = m;
        while (k)
        {
            if (k&1) res = res *1ll* t % p;
            t = t *1ll*t % p;
            k >>= 1;
        }
        return res%p;
    }
};