poj3070(利用矩阵快速幂加速递推式)

题意：求斐波拉契数的第n项，n <= 10^9,时限1s
思路分析：暴力做肯定超时。这里有矩阵进行加速，很多递推的式子（DP）都可以转化成矩阵乘法来做。递推式为F(n) = F(n-1) + F(n-2) , 对于一个 1*2 的矩阵[f(n-2),F(n-1)],右乘上一个2*2 的矩阵A得到 2*1 的矩[F(n),F(n-1)] = [F(n-1)+F(n-2),F[n-1]，A矩阵为
1,1
1,0

(F[0],F[1])*A^n = (f[n],f[n+1]);

学习链接：http://blog.csdn.net/abcjennifer/article/details/5302198

代码如下：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define MOD 10000
#define inf 0x7ffffff
#define eps 1e-9
#define pi acos(-1.0)
using namespace std;
struct Matrix
{
    int m[2][2];
    Matrix()
    {
        memset(m,0,sizeof(m));
    }
}I,a;
void init()
{
    I.m[0][0] = I.m[1][1] = 1;
    I.m[0][1] = I.m[1][0] = 0;
    a.m[0][1] = a.m[0][0] = a.m[1][0] = 1;
    a.m[1][1] = 0;
}
Matrix matrixmul(Matrix a,Matrix b,int k)
{
    int i,j,o;
    Matrix c;
    for(i = 0; i < k; i++)
        for(j = 0; j < k; j++)
            for(o = 0; o < k; o++)
                 c.m[i][j] = (c.m[i][j] + a.m[i][o]*b.m[o][j])%MOD;
    return c;
}
Matrix matripow(Matrix a,int n,int k)
{
    Matrix b = I;
    while(n)
    {
        if(n&1)  b = matrixmul(b,a,k);
        n >>= 1;
        a = matrixmul(a,a,k);
    }
    return b;
}
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
    init();
    int n;
    while(scanf("%d",&n) && n != -1)
    {
        if(n == 0){
            printf("0\n");
            continue;
        }
        if(n == 1 || n == 2){
            printf("1\n");
            continue;
        }
        Matrix b;
        b = matripow(a,n-1,2);
        printf("%d\n",b.m[0][0]);
    }
    return 0;
}