E - Fibonacci

*E - Fibonacci

这里是引用 In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 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 Fn.

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

.

正常运算到99999999的时候就变得很慢，需要用快速幂将时间复杂度变为logN，图片这里就是降时间复杂度的程序。这道题问了某位赖大佬才有所成，在此感谢赖同学。

#include<stdio.h>
int main()
{
 int x;
 scanf("%d",&x);
 while(x!=-1)
 {
  int a[2][2]={0,0,0,0},a_[2][2]={1,1,1,0},b[2][2]={1,1,1,0},b_[2][2];
  int mod=10000;
//  while(x--)
  while(x)
  {
   if(x%2==1)
   {
    for(int i=0;i<2;i++)
     for(int j=0;j<2;j++)
      a[i][j]=0;
    for(int i=0;i<2;i++)
    {
     for(int j=0;j<2;j++)
     {
      for(int k=0;k<2;k++)
      {
       a[i][j]+=a_[i][k]*b[k][j];
       a[i][j]%=mod;
      }
//      printf("%d ",a[i][j]);
     }
//     printf("\n");
    }
    for(int i=0;i<2;i++)
     for(int j=0;j<2;j++)
      a_[i][j]=a[i][j];
   }
   x/=2;
   //b_[2][2]=0;
   for(int i=0;i<2;i++)
    for(int j=0;j<2;j++)
     b_[i][j]=0;
   //b^2
   for(int i=0;i<2;i++)
    for(int j=0;j<2;j++)
     for(int k=0;k<2;k++)
     {
      b_[i][j]+=b[i][k]*b[k][j];
      b_[i][j]%=mod;
     }
   for(int i=0;i<2;i++)
    for(int j=0;j<2;j++)
     b[i][j]=b_[i][j];
  }printf("%d\n",a[1][1]);
  scanf("%d",&x);
 }
 return 0;
}