fibonacci数列(二)

fibonacci数列(二)

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 3

描述

In the Fibonacci integer sequence, F₀ = 0, F₁ = 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

.

Given an integer n, your goal is to compute the last 4 digits of F_n.

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:

.

输入

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.

输出

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).

样例输入

0
9
1000000000
-1

样例输出

0
34
6875

解题思路：矩阵幂运算

代码如下：

# include<stdio.h>
# include<string.h>
struct node{
	int a[2][2];	
};
node multi(node aa,node bb)   //实现两个矩阵相乘，并保存在另一个矩阵中 ,并返回该矩阵 
{  
    node tmp;
	memset(tmp,0,sizeof(tmp));
	  	     
    for(int i=0;i<2;i++)       //    实现两个矩阵相乘       
        for(int j=0;j<2;j++)  
        	for(int k=0;k<2;k++)  
        		tmp.a[i][j]+=aa.a[i][k]*bb.a[k][j]%10000;  
	   
    return tmp;
		 
}
int main(){
	int n;
	int f[3];
	f[0]=0;
	f[1]=f[2]=1;
	 
	while(~scanf("%d",&n)&&n!=-1)
	{
		if(n<3)
		{
			printf("%d\n",f[n]);
			continue;
		}
		node a1,c;
		memset(a1.a,0,sizeof(a1.a));
		for(int i=0;i<2;i++)  //相当与快速幂运算中的初始值设为1 
		a1.a[i][i]=1;
		
		c.a[0][0]=1;c.a[0][1]=1;c.a[1][0]=1;//构建合适矩阵 
		c.a[1][1]=0;
		n-=2;
		
	 while(n)    //类似与快速幂运算 
    {  
        if(n&1)  
        a1=multi(a1,c);     
        c=multi(c,c);
        n>>=1; 		
    }
	  
	printf("%d\n",(f[1]*a1.a[0][1]+f[2]*a1.a[0][0])%10000);	
		
	}
	
	
	return 0;
}