Number Sequence HDU - 1005 （矩阵快速幂）

Problem Description
A number sequence is defined as follows:

f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.

Given A, B, and n, you are to calculate the value of f(n).

Input
The input consists of multiple test cases. Each test case contains 3 integers A, B and n on a single line (1 <= A, B <= 1000, 1 <= n <= 100,000,000). Three zeros signal the end of input and this test case is not to be processed.

Output
For each test case, print the value of f(n) on a single line.

Sample Input
1 1 3
1 2 10
0 0 0

Sample Output
2
5

思路：简单的矩阵快速幂

代码如下

#include <iostream> 
#include <cstring>
#include <cstdio>
using namespace std; 
#define LL long long 
const int mod=7; 
struct matrix
{
    LL x[2][2];
};
matrix mutimatrix(matrix a,matrix b)
{
    matrix temp; 
    memset(temp.x,0,sizeof(temp.x));    
    for(int i=0;i<2;i++)
    for(int j=0;j<2;j++)
    for(int k=0;k<2;k++)
    {
        temp.x[i][j]+=a.x[i][k]*b.x[k][j];
        temp.x[i][j]%=mod;
    }
    return temp;
}

matrix k_powmatrix(matrix a,LL n)
{
    matrix temp;
    memset(temp.x,0,sizeof(temp.x));
    for(int i=0;i<2;i++)
    temp.x[i][i]=1;

    while(n)
    {
        if(n&1)
        temp=mutimatrix(temp,a);

        a=mutimatrix(a,a);
        n>>=1;
    }
    return temp;
} 


int main()
{
        int a,b,n;
        while(scanf("%d%d%d",&a,&b,&n))
        {
            if(!(a+b+n)) break;
            if(n<=2)
            {
                printf("1\n");
                continue;
            }
            matrix st;
            memset(st.x,0,sizeof(st.x));
            st.x[0][0]=a;
            st.x[0][1]=1;
            st.x[1][0]=b;
            st.x[1][1]=0;
            matrix init;
            memset(init.x,0,sizeof(init.x));

            init.x[0][0]=1;
            init.x[0][1]=1;
            st=k_powmatrix(st,n-2);
            st=mutimatrix(init,st);

            printf("%lld\n",(st.x[0][0]+mod)%mod);
        }
        return 0; 
}