//矩阵快速幂 求斐波那契数列

矩阵快速幂求斐波那契数列

In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 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

.

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
Inputcopy Outputcopy
0
9
999999999
1000000000
-1
0
34
626
6875
Hint
As a reminder, matrix multiplication is associative, and the product of two 2 × 2 matrices is given by

.

Also, note that raising any 2 × 2 matrix to the 0th power gives the identity matrix:

.

#include<iostream>
using namespace std;
struct node{
	int a[10][10];
};
int len=2;
int mod=10000;
node mul(node x,node y){
	node t;
	int i,j,k;
	for(i=0;i<len;i++){
		for(j=0;j<len;j++){
			t.a[i][j]=0;
			for(k=0;k<len;k++){
				t.a[i][j]+=(x.a[i][k]*y.a[k][j])%mod;
			}
			t.a[i][j]=t.a[i][j]%mod;
		}	
	}
	return t;	
}
node fn(node x,node y,int n){
	while(n>0){
		if(n%2==1){
			y=mul(y,x);
		}
		x=mul(x,x);
		n=n>>1;
	}
	return y;
}
int main(){
	node x,y;
	int n;
	x.a[0][0]=1;
	x.a[0][1]=1;
	x.a[1][0]=1;
	x.a[1][1]=0;
	while(cin>>n&&n!=-1){
		if(n==0) cout<<"0"<<endl;
		else{
			y=fn(x,x,n-1);
			cout<<y.a[0][1]<<endl;
		}
			
//	for(int i=0;i<len;i++){
//		for(int j=0;j<len;j++)
//			cout<<y.a[i][j]<<" ";
//		cout<<endl; 
//	}
		
	}
	return 0;
}