HDOJ4686(矩阵快速幂)

链接:https://cn.vjudge.net/contest/51124#problem/C

题意 7个数n,a,ax,ay,b,bx,by，a(i)  = a(i-1)+*ax+ay, b(i) = b(i-1) * bx+by,求a*b累加n次后mod1,000,000,007的数.

矩阵快速幂，5*5矩阵较难推出，看了别人题解好久才懂。

#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL __int64
const LL mod=1e9+7;
LL n;
struct matrix{
    LL f[5][5];
};
matrix mul(matrix a,matrix b)
{
    matrix c;
    memset(c.f,0,sizeof(c.f));
    LL i,j,k;
    for(k=0;k<5;k++)
    for(i=0;i<5;i++)
    {
        if(!a.f[i][k])continue;
        for(j=0;j<5;j++)
        {
            if(!b.f[k][j])continue;
            c.f[i][j]=(c.f[i][j]+a.f[i][k]*b.f[k][j]%mod)%mod;
        }
    }
    return c;
}
matrix pow_mod(matrix a,LL b)
{
    matrix s;
    LL i,j;
    for(i=0;i<5;i++)
    {
        for(j=0;j<5;j++)
        {
            s.f[i][j]=(i==j?1:0);
            //cout<<s.f[i][j]<<" ";
        }
        //cout<<endl;
    }
    while(b)
    {
        if(b&1)
            s=mul(s,a);
        a=mul(a,a);
        b=b>>1;
    }
    return s;
}
int main()
{
    LL p,q,x,y,a,b;
    while(cin>>n)
    {
        cin>>a>>x>>y>>b>>p>>q;
        matrix e;
        memset(e.f,0,sizeof(e.f));
        e.f[0][0]=e.f[1][0]=e.f[4][4]=1;
        e.f[1][1]=x*p%mod;e.f[2][1]=x*q%mod;e.f[2][2]=x%mod;e.f[3][1]=p*y%mod;
        e.f[3][3]=p%mod;e.f[4][1]=q*y%mod;e.f[4][2]=y%mod;e.f[4][3]=q%mod;
        e=pow_mod(e,n);
        LL ans;
        ans=(e.f[1][0]*a%mod*b%mod+a*e.f[2][0]%mod+b*e.f[3][0]%mod+e.f[4][0]%mod)%mod;
        cout<<(ans+mod)%mod<<endl;
    }
    return 0;
}