POJ 3070 Fibonacci

Description
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.

---

【题目分析】
就是一道赤裸裸的矩阵乘法的题目罢了。直接肛一波就可以了。毫无技术性可言。

---

【代码】

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
int n;
void cheng (int a[2][2],int b[2][2])
{
    int c[2][2];
    memset(c,0,sizeof(c));
    for (int i=0;i<2;i++)
        for (int j=0;j<2;j++)
          for (int k=0;k<2;k++)
            c[i][j]=(c[i][j]+a[i][k]*b[k][j])%10000;
    memcpy(a,c,sizeof(c));
}
int main()
{
    while (cin>>n && n!=-1)
    {
        int f[2][2]={{0,1},{0,0}};
        int a[2][2]={{0,1},{1,1}};
        while (n>0)
     {
        if(n&1) cheng(f,a);
        cheng (a,a);
        n>>=1;
     }
      printf("%d\n",f[0][0]);
    }
}