POJ3070Fibonacci 矩阵快速幂

Fibonacci

Description

In the Fibonacci integer sequence, $F_0=0$, $F_1=1$, and $F_n=F_{n-1}+F_{n-2}$for $n>=2$. For example, the first ten terms of the Fibonacci sequence are:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …

An alternative formula for the Fibonacci sequence is

$$\left[\begin{array}{cc}{F}_{n+1}& F_n\\ F_n& F_{n-1}\end{array}\right]={\left[\begin{array}{cc}1& 1\\ 1& 0\end{array}\right]}^n$$
Given an integer $n$, your goal is to compute the last 4 digits of $Fn$.

Input

The input test file will contain multiple test cases. Each test case consists of a single line containing n (where $0 ≤ $n$ ≤ 1,000,000,000$). The end-of-file is denoted by a single line containing the number −1.

Output

For each test case, print the last four digits of $Fn$. If the last four digits of $Fn$ are all zeros, print ‘0’; otherwise, omit any leading zeros (i.e., print $Fn $mod 10000).

Sample Input

0
9
999999999
1000000000
-1

Sample Output

0
34
626
6875

Hint

As a reminder, matrix multiplication is associative, and the product of two 2 × 2 matrices is given by
$$\left[\begin{array}{cc}{a}_{11}& a_{12}\\ a_{21}& a_{22}\end{array}\right]\left[\begin{array}{cc}{b}_{11}& b_{12}\\ b_{21}& b_{22}\end{array}\right]=\left[\begin{array}{cc}{a}_{11}{b}_{11}+a_{12}{b}_{12}& a_{11}{b}_{12}+a_{12}{b}_{22}\\ a_{21}{b}_{11}+a_{22}{b}_{21}& a_{21}{b}_{12}+a_{22}{b}_{22}\end{array}\right]$$
Also, note that raising any 2 × 2 matrix to the 0th power gives the identity matrix:
$${\left[\begin{array}{cc}{a}_{11}& a_{12}\\ a_{21}& a_{22}\end{array}\right]}^0=\left[\begin{array}{cc}1& 0\\ 0& 1\end{array}\right]$$

---

递推式: $f(n)=af(n-1)+bf(n-2)$

$$\left[\begin{array}{c}f(n+1)\\ f(n)\end{array}\right]=\left[\begin{array}{cc}a& b\\ 1& 0\end{array}\right]\ast \left[\begin{array}{c}f(n)\\ f(n-1)\end{array}\right]={\left[\begin{array}{cc}a& b\\ 1& 0\end{array}\right]}^{n-1}\ast \left[\begin{array}{c}f(2)\\ f(1)\end{array}\right]$$

本题的a=b=1

根据快速幂 求出矩阵的n-1次方 $A={\left[\begin{array}{cc}a& b\\ 1& 0\end{array}\right]}^{n-1}$

那么 $f_n=A[1][0]\ast f_2+A[1][1]\ast f_1$

---

#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n;//矩阵维数
int mod; //模数 
struct mat{
	int m[N][N];
	mat(){
		memset(m,0,sizeof(m));
		for(int i=0;i<N;i++){
			m[i][i]=1; //初始化单位矩阵	
		}
	}
	//矩阵乘法 
	mat operator*(mat& a) {
		mat res;
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
			{
				res.m[i][j]=0;
				for(int k=0;k<n;k++)
					res.m[i][j] += m[i][k] * a.m[k][j];
				res.m[i][j] %= mod;
			}
		return res;
	}
};
mat fastPow(mat a,int k){  //矩阵快速幂 ★★★★
	mat res;
	while(k){
		if(k&1) res = res * a;
		a = a*a;
		k>>=1;
	}
	return res;
} 
int main()
{
	n=2;
	mod = 10000;
	mat res,a;
	res.m[0][0] = 1;
	res.m[0][1] = 1;
	res.m[1][0] = 1;
	res.m[1][1] = 0;
    int input;
	while(cin>>input && input != -1){
		if(input <= 0){
			cout<<0<<endl;
			continue;
		}
		a = fastPow(res,input-1);
		cout<<(a.m[1][0]+a.m[1][1])%mod<<endl;
	}
	return 0;
}