Fibonacci

D - Fibonacci

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit  Status

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:

//这个代码我找了一个多小时的错，最后修该正确后，提交了，看到AC我还是很开心的 
#include<cstdio>
int a[3][3],t[3][3],d[3][3];



int main()
{
	int n,i,j,k;
	while(scanf("%d",&n))
	{
		if(n==-1)
			break;
		a[1][1]=1,a[1][2]=1,a[2][1]=1,a[2][2]=0;
		d[1][1]=1,d[1][2]=0,d[2][1]=0,d[2][2]=1;
		while(n)
		{
			if(n%2==1)
			{
				for( i=1;i<=2;i++)
				{
					for( j=1;j<=2;j++)
					{
						t[i][j]=0; 
						for( k=1;k<=2;k++)
							t[i][j]+=a[i][k]*d[k][j];
					}
				}
				for( i=1;i<=2;i++)
					for( j=1;j<=2;j++)
						d[i][j]=t[i][j]%10000;
			}
			n/=2;
			{
				if(n==0)
					continue;
				for( i=1;i<=2;i++)
				{
					for( j=1;j<=2;j++)
					{
						t[i][j]=0; 
						for( k=1;k<=2;k++)
							t[i][j]+=a[i][k]*a[k][j];
					}
				}
			for(int i=1;i<=2;i++)
				for(int j=1;j<=2;j++)
					a[i][j]=t[i][j]%10000;
			}
	  	}
		printf("%d\n",d[1][2]);
	}
	return 0;
}