快速幂、矩阵快速幂板子

快速幂：

#include <iostream>
using namespace std;

int quickPow(int A,int n){
	int res = 1;
	int mul = A;
	while(n){
		if(n&1){
			res *= mul;			
		}
		mul *= mul;
		n /= 2;
	}
	return res;
}

int main(){
	cout<<quickPow(3,4);
	return 0;
} 

矩阵快速幂：

#include<iostream>
#include<cstring> 

using namespace std;

const int maxn = 2;

struct Matrix{
	int a[maxn][maxn];
	void init(){ //初始化为单位矩阵
		memset(a, 0, sizeof(a));
		for(int i = 0;i < maxn;i++){
			a[i][i] = 1;
		}
	}
};

Matrix mulMatrix(Matrix a,Matrix b){//矩阵乘法
	Matrix ans;
	for(int i = 0;i < maxn;i++){
		for(int j = 0;j < maxn;j++){
			ans.a[i][j] = 0;
			for(int k = 0;k < maxn;k++){
				ans.a[i][j] += a.a[i][k] * b.a[k][j];
				ans.a[i][j] %= 10000;
			}
		}
	}
	return ans;
}

Matrix quickPow(Matrix m,int n){//矩阵快速幂 
	Matrix res;
	res.init();
	while(n){
		if(n&1){
			res = mulMatrix(res,m);
		}
		m = mulMatrix(m,m);
		n = n/2;
	}
	return res;
}

int main(){
	Matrix m;
	//随便一个二维矩阵
	m.a[0][0] = 0;
	m.a[0][1] = 1;
	m.a[1][0] = 1;
	m.a[1][1] = 0;
	Matrix b =	quickPow(m,10);
	for(int i = 0;i < maxn;i++){
		for(int j = 0;j < maxn;j++){
			cout<<b.a[i][j]<<" "; 
		}
		cout<<endl;
	}
	return 0;
}

矩阵快速幂的应用：求斐波那契数列n个数
思想:将求斐波那契数列过程转为矩阵相乘

其中

即：[f(1000), f(999)] = [f(2),f(1)] * A^998 其中[f(2),f(1)] = [1,1];
因此我们要求f(n)只需求出T = A^(n-2),然后再取T[0][0] + T[1][0]即为我们要求的

代码如下：

#include<iostream>
#include<cstring> 

using namespace std;

const int maxn = 2;

struct Matrix{
	int a[maxn][maxn];
	void init(){ //初始化为单位矩阵
		memset(a, 0, sizeof(a));
		for(int i = 0;i < maxn;i++){
			a[i][i] = 1;
		}
	}
};

Matrix mulMatrix(Matrix a,Matrix b){//矩阵乘法
	Matrix ans;
	for(int i = 0;i < maxn;i++){
		for(int j = 0;j < maxn;j++){
			ans.a[i][j] = 0;
			for(int k = 0;k < maxn;k++){
				ans.a[i][j] += a.a[i][k] * b.a[k][j];
				ans.a[i][j] %= 10000;
			}
		}
	}
	return ans;
}

Matrix quickPow(Matrix m,int n){//矩阵快速幂 
	Matrix res;
	res.init();
	while(n){
		if(n&1){
			res = mulMatrix(res,m);
		}
		m = mulMatrix(m,m);
		n = n/2;
	}
	return res;
}

int main(){
	Matrix m; //为矩阵A
	m.a[0][0] = 1;
	m.a[0][1] = 1;
	m.a[1][0] = 1;
	m.a[1][1] = 0;
	int n;
	cin>>n;
	Matrix b =	quickPow(m,n - 2);
	cout<<b.a[0][0] + b.a[1][0];
	return 0;
}