hdu 3306 Another kind of Fibonacci

As we all known , the Fibonacci series : F(0) = 1, F(1) = 1, F(N) = F(N - 1) + F(N - 2) (N >= 2).Now we define another kind of Fibonacci : A(0) = 1 , A(1) = 1 , A(N) = X * A(N - 1) + Y * A(N - 2) (N >= 2).And we want to Calculate S(N) , S(N) = A(0)² +A(1)²+……+A(n)².

构建四阶矩阵，快速幂求解

#include<iostream>
#include<cstring>
using namespace std;
//typedef long long int;
const int p=10007;
struct node
{
    int s[4][4];
};
inline node multiply(node a,node b)
{
    node c;
    memset(c.s,0,sizeof(c.s));
    for(int i=0;i<4;i++)
        for(int j=0;j<4;j++)
            for(int k=0;k<4;k++)
                c.s[i][j]=(c.s[i][j]+a.s[i][k]*b.s[k][j])%p;
    return c;
}
inline node fast_pow(int n,node a)
{
    if(n==1)    return a;
    node b=fast_pow(n>>1, a);
    b=multiply(b, b);
    if(n&1) b=multiply(b, a);
    return b;                
}
int main()
{
    int n,x,y;
    node a,b;
    while (cin>>n>>x>>y) {
        x%=p,y%=p;
        a.s[0][0]=1,a.s[0][1]=x*x%p,a.s[0][2]=2*x*y%p,a.s[0][3]=y*y%p;
        a.s[1][0]=0,a.s[1][1]=x*x%p,a.s[1][2]=2*x*y%p,a.s[1][3]=y*y%p;
        a.s[2][0]=0,a.s[2][1]= x   ,a.s[2][2]= y     ,a.s[2][3]=0    ;
        a.s[3][0]=0,a.s[3][1]= 1   ,a.s[3][2]= 0     ,a.s[3][3]=0    ;
        a=fast_pow(n-1,a);
        memset(b.s, 0, sizeof(b.s));
        b.s[0][0]=2,b.s[1][0]=1,b.s[2][0]=1,b.s[3][0]=1;
        b=multiply(a, b);
        cout<<b.s[0][0]<<endl;
    }
    return 0;
}