poj3070

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 13394		Accepted: 9530

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<iostream>
using namespace std;
const int p=10000;
typedef long long ll;
int n;
ll a[2][2],b[2][2];
void multiple(ll a[2][2],ll b[2][2],ll c[2][2])
{
	int ans[2][2]={0};
	for(int i=0;i<2;i++)
		for(int j=0;j<2;j++)
			for(int k=0;k<2;k++)
				ans[i][j]+=a[i][k]*b[k][j]%p;
	for(int i=0;i<2;i++)
		for(int j=0;j<2;j++)
			a[i][j]=ans[i][j];
}
int main()
{
	while(cin>>n)
	{
		if(n==-1)
			return 0;
		b[0][0]=b[0][1]=b[1][0]=1;b[1][1]=0;
		a[0][0]=1;
		a[0][1]=0;
		a[1][0]=0;
		a[1][1]=1; 
		while(n>0)
		{
			if(n&1)
				multiple(a,b,a);
			n/=2;
			multiple(b,b,b);
		}
		cout<<a[0][1]%p<<endl;
	}
	return 0;
}