POJ3070

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 16579		Accepted: 11613

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:

.

Source

Stanford Local 2006

用矩阵快速幂求Fibonacci

1.了解二进制位运算

2.会矩阵运算

AC代码：

#include<stdio.h>
int main()
{
 int ret[2][2];
 int a[2][2];
 int buf[2][2];
 int ans[2][2];
 int i,j;
 int b;
 while(1)
 {
  scanf("%d",&b);
  if(b==-1)
   break;
  ret[0][0]=1;
  ret[1][1]=1;
  ret[0][1]=0;
  ret[1][0]=0;//初始化单位矩阵
  a[0][0]=1;
  a[1][0]=1;
  a[0][1]=1;
  a[1][1]=0;
  if(b==0)
   printf("%d\n",0);
  else{
   while(b){
    if(b&1)
    {
     for(i=0;i<2;i++)
      for(j=0;j<2;j++)
       buf[i][j]=ret[i][j];
     ret[0][0]=(buf[0][0]*a[0][0]+buf[0][1]*a[1][0])%10000;
     ret[0][1]=(buf[0][0]*a[1][0]+buf[0][1]*a[1][1])%10000;
     ret[1][0]=(buf[1][0]*a[0][0]+buf[1][1]*a[1][0])%10000;
     ret[1][1]=(buf[1][0]*a[0][1]+buf[1][1]*a[1][1])%10000; 
    }
     for(i=0;i<2;i++)
      for(j=0;j<2;j++)
       ans[i][j]=a[i][j];
     a[0][0]=(ans[0][0]*ans[0][0]+ans[0][1]*ans[1][0])%10000;
     a[0][1]=(ans[0][0]*ans[1][0]+ans[0][1]*ans[1][1])%10000;
     a[1][0]=(ans[1][0]*ans[0][0]+ans[1][1]*ans[1][0])%10000;
     a[1][1]=(ans[1][0]*ans[0][1]+ans[1][1]*ans[1][1])%10000;
     b>>=1;
   }
   printf("%d\n",ret[1][0]); 
  }
 }
}

写得有点丑（逃~~~~~）