快速幂算法:
计算 2^9,直接相乘要乘九次;
9的二进制: 1001; 9=2^3+2^0, 将2^9转换为 (2)^(2^3) * (2)^(2^0);
同理,指数的二进制某个位数i为1,则会多乘一个 (2)^(2^i);
long long Pow(long long a, long long n){ long long ans = 1; while (n>0){ if (n & 1){//a%2==1,即当前数的二进制最后一位为1 ans *= a; } n /= 2; a *= a; } return ans; }
快速幂取模:
a^b%c=(a%c)^b%c
long long Pow(long long a, long long n,long long mode){ long long ans = 1; a = a%mode; while (n>0){ if (n & 1) ans = (ans * a)% mode; //a%2==1,即当前数的二进制最后一位为1 n /= 2; a = (a * a)%mode; } return ans; }
矩阵快速幂:
与快速幂一样,ans在快速幂中为1,此时用单位矩阵替换
const int maxn = 2; const int Mod = 1000000007; struct mat{ int a[maxn][maxn]; }; mat mat_mul(mat x, mat y){ mat res; memset(res.a, 0, sizeof(res.a)); for (int i = 0; i < maxn; i++) for (int j = 0; j < maxn; j++) for (int k = 0; k < maxn; k++) { res.a[i][j] += x.a[i][k] * y.a[k][j]; res.a[i][j] %= Mod; } return res; } int pow(int n) { mat c, res; c.a[0][0] = 1; c.a[0][1] = 1; c.a[1][0] = 1; c.a[1][1] = 0; memset(res.a, 0, sizeof(res.a)); for (int i = 0; i<maxn; i++) res.a[i][i] = 1; while (n) { if (n & 1) res = mat_mul(res, c); c = mat_mul(c, c); n = n >> 1; } return res.a[0][1]; }