矩阵快速幂

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
struct node{
    int a[3][3];
};
struct node mulpity(struct node a,struct node b)
{
    int i,j,k;
    struct node mid;
    memset(mid.a,0,sizeof(mid.a));
    for(i=0;i<2;i++)
        for(j=0;j<2;j++)
            for(k=0;k<2;k++)
            {
                mid.a[i][j]=mid.a[i][j]+a.a[i][k]*b.a[k][j];
                mid.a[i][j]=mid.a[i][j]%10000;
            }
    return mid;
}
int answer(int n)
{
    int i,p,j;
    struct node a,b;
    memset(b.a,0,sizeof(b.a));
    b.a[0][0]=1;
    b.a[0][1]=1;
    b.a[1][0]=1;
    memset(a.a,0,sizeof(a.a));
    for(i=0;i<2;i++)
        a.a[i][i]=1;
    while(n)
    {
        if(n&1)
            a=mulpity(a,b);
        b=mulpity(b,b);
        n>>=1;
    }
    return a.a[0][1];
}
int main()
{
    int i,p,j,n;

    while(scanf("%d",&n)!=EOF)
    {
        if(n==-1)
            break;
        printf("%d
",answer(n));
    }
    return 0;
}