[POJ] 3070 Fibonacci [矩阵快速幂]

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 14582		Accepted: 10269

Description

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.

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 F_n. If the last four digits of F_n are all zeros, print ‘0’; otherwise, omit any leading zeros (i.e., print F_n 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

.

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

.

#include<stdio.h>
#include<string.h>
#define MAX_N 2
#define MOD 10000
typedef long long LL;

LL tmp[MAX_N][MAX_N];
LL ans[MAX_N][MAX_N];
LL res[MAX_N][MAX_N];
int N=2;

void mul(LL (*a)[MAX_N],LL (*b)[MAX_N]){
	for(int i=0;i<N;i++)
		for(int j=0;j<N;j++){
			LL sum=0;
			for(int k=0;k<N;k++)
				sum=(sum+a[i][k]*b[k][j])%MOD;
			tmp[i][j]=sum;
		}
	for(int i=0;i<N;i++)
		for(int j=0;j<N;j++)
			a[i][j]=tmp[i][j];
}

void pow(LL (*a)[MAX_N],LL (*b)[MAX_N],int n){
	//初始化单位矩阵a
	memset(a,0,sizeof(LL)*N*N);
	for(int i=0;i<N;i++) a[i][i]=1;
	while(n){
		if(n&1) mul(a,b);
		mul(b,b);
		n>>=1;
	}
}

int main()
{
	int n;
	while(scanf("%d",&n)!=EOF&&n>=0){
		res[0][0]=res[0][1]=res[1][0]=1;
		res[1][1]=0;
		pow(ans,res,n);
		printf("%LLd\n",ans[1][0]);
	}
	return 0;
}