HDU4686Arc of Dream 矩阵快速幂

   An Arc of Dream is a curve defined by following function:

where
a ₀ = A0
a _i = a _i-1*AX+AY
b ₀ = B0
b _i = b _i-1*BX+BY
What is the value of AoD(N) modulo 1,000,000,007?

InputThere are multiple test cases. Process to the End of File.
Each test case contains 7 nonnegative integers as follows:
N
A0 AX AY
B0 BX BY
N is no more than 10 ¹⁸, and all the other integers are no more than 2×10 ⁹.OutputFor each test case, output AoD(N) modulo 1,000,000,007.Sample Input

1
1 2 3
4 5 6
2
1 2 3
4 5 6
3
1 2 3
4 5 6

Sample Output

4
134
1902

构造矩阵 过程爆longlong WA 了很多次，很蓝瘦

#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int N = 5;
int mod = 1e9+7;

LL k;
LL A0,Ax,Ay,B0,Bx,By;

struct Matrix
{
    LL mat[N][N];
    Matrix operator*(const Matrix &b)const
    {
        Matrix temp;
        for(int i = 0; i < N; i++)
        {
            for(int j = 0; j < N; j++)
            {
                temp.mat[i][j] = 0;
                for(int k = 0; k < N; k++)
                {
                    temp.mat[i][j]+=mat[i][k]*b.mat[k][j]%mod;
                    temp.mat[i][j]%=mod;
                }
            }
        }
        return temp;
    }
};
void Init(Matrix &m)
{
    memset(m.mat,0,sizeof(m.mat));
    m.mat[0][0]=Ax*Bx%mod;m.mat[0][1]=Ax*By%mod;m.mat[0][2]=Ay*Bx%mod;m.mat[0][3]=Ay*By%mod;
    m.mat[1][1]=Ax%mod;m.mat[1][3]=Ay%mod;
    m.mat[2][2]=Bx%mod;m.mat[2][3]=By%mod;
    m.mat[3][3]=1;
    m.mat[4][0]=1;m.mat[4][4]=1;
}
LL qpow(Matrix &m,LL k)
{
    Matrix ans;
    memset(ans.mat,0,sizeof(ans.mat));
    for(int i = 0; i < N; i++)
        ans.mat[i][i] = 1;
    while(k)
    {
        if(k&1)ans = ans*m;
        m = m*m;
        k>>=1;
    }
    LL sum = 0;
    sum = (sum+ans.mat[4][0] *A0%mod*B0%mod)%mod;
    sum = (sum+ans.mat[4][1] *A0%mod)%mod;
    sum = (sum+ans.mat[4][2] *B0%mod)%mod;
    sum = (sum+ans.mat[4][3]%mod)%mod;
    //sum = (sum+ans.mat[4][4] *0%mod)%mod;
    return sum;
}
int main()
{
    while(cin>>k)
    {
        cin>>A0>>Ax>>Ay>>B0>>Bx>>By;
        //scanf("%d%d%d%d%d%d",&A0,&Ax,&Ay,&B0,&Bx,&By);
        if(k==0){
            printf("0
");
            continue;
        }
        Matrix m;
        Init(m);
        cout<<qpow(m,k)<<endl;;
    }
    return 0;
}