矩阵的快速取幂法——求类Fibonacci数列（2）

POJ 3070   Fibonacci

Time Limit:  1000MS  Memory Limit:  65536K  Total Submissions:  3817 Accepted:  2688

Description

In the Fibonacci integer sequence, F₀ = 0, F₁ = 1, and F_n = F_{n ? 1} + F_{n ? 2} forn ≥ 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_nare all zeros, print ‘0’; otherwise, omit any leading zeros (i.e., print F_n mod 10000).

Sample Input

099999999991000000000-1

Sample Output

0346266875 

#include<iostream>
#include<cstring>
using namespace std;
int sq[35][2][2]={ { {1,1}, {1,0} } };
int main()
{ 
    int n,ans,i,j,k,l; 
    int m[2][2]={0}; 
    for(l=1;l<32;l++) 
        for(i=0;i<2;i++) 
            for(j=0;j<2;j++) 
                for(k=0;k<2;k++) 
                    sq[l][i][j]=(sq[l][i][j]+sq[l-1][i][k]*sq[l-1][k][j])%10000; 
    while(cin>>n&&n!=-1) 
    { 
        if(n==0) 
        {
            cout<<0<<endl;
            continue;
        } 
        if(n==1||n==2) 
        {
            cout<<1<<endl;
            continue;
        } 
        int t[2][2]={{1,0},{0,1}}; 
        n=n-1;
        l=0; 
        while(n) 
        { 
            if(n&1) 
            { 
                memset(m,0,sizeof(m)); 
                for(i=0;i<2;i++) 
                    for(j=0;j<2;j++) 
                        for(k=0;k<2;k++) 
                            m[i][j]=(m[i][j]+t[i][k]*sq[l][k][j])%10000; 
                for(i=0;i<3;i++) 
                    for(j=0;j<3;j++) 
                        t[i][j]=m[i][j]; 
            } 
            l++; 
            n=n>>1; 
        } 
        ans=t[0][0]%10000; 
        cout<<ans<<endl; 
    } 
    return 0;
}