POJ 3070

 

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 1253		Accepted: 878

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

------------------------------------------------------------------------------------------------------------------------------------------------

难度：2    代码：  1      分类： 数学

分析：

题目的难点在于n可能很大，所以把所有的都算出来是不现实的，需要使用位运算，利用n=sigma（2^i*t）,t={0,1}来计算。

 

#include  < stdio.h >

int  p[ 30 ][ 4 ] = ... {1,1,1,0} ;

void  mm( int   *  ret, int   *  a, int   *  b)
... {
    int x[4],y[4],i;
    for(i=0;i<4;i++)
    ...{
        x[i]=a[i];
        y[i]=b[i];
    }    
    ret[0] = (x[0]*y[0] + x[1]*y[2]) % 10000;
    ret[1] = (x[0]*y[1] + x[1]*y[3]) % 10000;
    ret[2] = (x[2]*y[0] + x[3]*y[2]) % 10000;
    ret[3] = (x[2]*y[1] + x[3]*y[3]) % 10000;    
}

int  main()
... {
    int i,n;
    int a[4]=...{0,1,1,0};
    for(i=1;i<30;i++)
    ...{
        mm(p[i],p[i-1],p[i-1]);
    }
    while(1)
    ...{
        scanf("%d",&n);
        if(n==-1) break;
        a[0]=1;a[1]=0;a[2]=0;a[3]=1;
        
        for(i=0;i<30;i++)
        ...{
            if(n&(1<<i))
            ...{
                mm(a,a,p[i]);
            }
        }
        printf("%d ",a[1]);
    }

}