POJ 3070 Fibonacci 矩阵快速幂模板

题目链接
题目大意：
求第n项的斐波那契数对10000求余的结果

解题思路：
矩阵快速幂模板题

矩阵快速幂模板：

//用二维vector来表示矩阵
typedef vector<int> vec;
typedef vector<vec> mat;
typedef long long ll;
const int M = 10000;
//计算矩阵相乘
mat mul(mat a, mat b) {
	mat c(a.size(), vec(b[0].size()));//这一步已经包含了将矩阵c全部初始化为0
	for (int i = 0; i < a.size(); i++) {
		for (int k = 0; k < b.size(); k++) {
			for (int j = 0; j < b[0].size(); j++) {
				c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % M;
			}
		}
	}
	return c;
}
//计算A^n
mat pow(mat a, ll n) {
	mat b(a.size(), vec(a[0].size()));
	for (int i = 0; i < a.size(); i++) {
		b[i][i] = 1;
	}
	while (n > 0) {
		if (n & 1)b = mul(b, a);
		a = mul(a, a);
		n >>= 1;
	}
	return b;
}

AC代码：

#include<iostream>
#include<stdio.h>
#include<vector>
using namespace std;
//用二维vector来表示矩阵
typedef vector<int> vec;
typedef vector<vec> mat;
typedef long long ll;
const int M = 10000;
//计算矩阵相乘
mat mul(mat a, mat b) {
	mat c(a.size(), vec(b[0].size()));//这一步已经包含了将矩阵c全部初始化为0
	for (int i = 0; i < a.size(); i++) {
		for (int k = 0; k < b.size(); k++) {
			for (int j = 0; j < b[0].size(); j++) {
				c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % M;
			}
		}
	}
	return c;
}
//计算A^n
mat pow(mat a, ll n) {
	mat b(a.size(), vec(a[0].size()));
	for (int i = 0; i < a.size(); i++) {
		b[i][i] = 1;
	}
	while (n > 0) {
		if (n & 1)b = mul(b, a);
		a = mul(a, a);
		n >>= 1;
	}
	return b;
}

int main() {
	ll n;
	while (scanf("%lld", &n)!=EOF) {
		if (n == -1)break;
		mat a(2, vec(2));
		a[0][0] = 1; a[0][1] = 1;
		a[1][0] = 1; a[1][1] = 0;
		a = pow(a, n);
		printf("%d\n", a[1][0]);
	}
}