hdu 4686

题目链接:hdu 4686
题意:给定ai,bi的推倒公式，求sigma(ai*bi) ( 0<= i < n)

分析:
an * bn = (an-1 * Ax + Ay) * (bn-1 * Bx + By) =(an-1 * bn-1) * Ax * Bx +an-1 * Ax * By +bn-1 * Bx * Ay +Ay * By
sum(i)=sum(i-1)+ai-1 * bi-1
然后构造以下矩阵

最后套个快速幂板子就好了.注意特判n==0的情况

#include<bits/stdc++.h>

#define ll long long
using namespace std;
const int N=3e5+10;
const int maxn=10;
const ll Mod=1000000007;
ll tmp[maxn][maxn];
void multi(ll a[][maxn],ll b[][maxn],int n)//n是矩阵大小
{
    int i,j,k;
    memset(tmp,0,sizeof tmp);
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            for(k=1;k<=n;k++)
            {
                tmp[i][j]+=a[i][k]*b[k][j];
                tmp[i][j]%=Mod;
            }

    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
           a[i][j]=tmp[i][j];
}
ll res[maxn][maxn];
void Pow(ll a[][maxn],ll m,int n)// a 是初始矩阵 res是答案数组 m是幂，n是矩阵大小
{
    for(int i=1;i<maxn;i++)
        for(int j=1;j<maxn;j++)
            res[i][j]=(i==j);
   
    while(m)
    {
        if(m&1) multi(res,a,n);  //res=res*a;
        multi(a,a,n);  //a=a*a
        m>>=1;
    }
}
ll a[maxn][maxn];
int main()//矩阵下标从1开始
{
    ll n;
    while(~scanf("%lld",&n))
    {
        ll a0,ax,ay;
        ll b0,bx,by;
        scanf("%lld%lld%lld%lld%lld%lld",&a0,&ax,&ay,&b0,&bx,&by);
        if(n==0)
        {
            printf("%d\n",0);
            continue;
        }
        memset(a,0,sizeof a);
        a[1][1]=a[5][5]=1;
        a[2][3]=a[1][3]=bx*ay%Mod;
        a[2][4]=a[1][4]=ax*by%Mod;
        a[2][5]=a[1][5]=ay*by%Mod;
        a[2][2]=a[1][2]=ax*bx%Mod;
        a[3][5]=by%Mod;a[3][3]=bx%Mod;
        a[4][4]=ax%Mod;a[4][5]=ay%Mod;
        Pow(a,n-1,5);
        ll ans=0;
        ans=(ans+a0*b0%Mod*res[1][1])%Mod;
        ans=(ans+a0*b0%Mod*res[1][2])%Mod;
        ans=(ans+b0*res[1][3])%Mod;
        ans=(ans+a0*res[1][4])%Mod;
        ans=(ans+res[1][5])%Mod;
        printf("%lld\n",ans);
    }
    return 0;
}
/*
10000000000
1000000000 1000000000 1000000000
1000000000 1000000000 1000000000

402502600
*/

炸了long long一直没发现错哪里,debug了好久