http://www.cnblogs.com/frog112111/archive/2013/08/21/3273660.html
矩阵快速幂详解:http://blog.csdn.net/abcjennifer/article/details/5302198
输入:
n
a0 a b
b0 c d
直接推然后搞搞,
【1,a(i-1),b(i-1),a(i-1)*b(i-1),s(i-2)】*A=
【1,ai,bi,ai*bi,s(i-1)】
A:
1 b d bd 0
0 a 0 ad 0
0 0 c bc 0
0 0 0 ac 1
0 0 0 0 1
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<string>
using namespace std;
#define ll __int64
const int inf = 0x3f3f3f3f;
const ll mod=1e9+7;
int n,m;
struct node
{
ll a[5][5];
}T,I;
node multi(node A,node B)
{
int i,j,k;
node C;
memset(C.a,0,sizeof(C.a));
for(i=0;i<5;i++)
for(j=0;j<5;j++)
{
for(k=0;k<5;k++)
{
C.a[i][j]+=A.a[i][k]*B.a[k][j];
C.a[i][j]%=mod;
}
C.a[i][j]=(C.a[i][j]+mod)%mod;
}
return C;
}
ll p[5];
ll read()
{
char c;
ll ret=0;
while((c=getchar())<'0'||c>'9');
while(c>='0'&&c<='9') ret=ret*10+(c-'0'),c=getchar();
return ret;
}
int main()
{
ll n,i,j,k;
while(scanf("%I64d",&n)!=EOF)
{
ll a0,b0,a,b,c,d;
scanf("%I64d%I64d%I64d%I64d%I64d%I64d",&a0,&a,&b,&b0,&c,&d);
p[0]=1,p[1]=(a0*a%mod+b)%mod;
p[2]=(b0*c%mod+d)%mod,p[3]=p[1]*p[2]%mod,p[4]=a0*b0%mod;
if(n==0)
{
printf("0\n");
continue;
}
if(n==1)
{
cout<<p[4]<<endl;
continue;
}
for(i=0;i<5;i++)
for(j=0;j<5;j++)
if(i==j) I.a[i][j]=1;
else I.a[i][j]=0;
memset(T.a,0,sizeof(T.a));
T.a[0][0]=1,T.a[0][1]=b,T.a[0][2]=d,T.a[0][3]=b*d%mod;
T.a[1][1]=a,T.a[1][3]=a*d%mod;
T.a[2][2]=c,T.a[2][3]=b*c%mod;
T.a[3][3]=a*c%mod,T.a[3][4]=T.a[4][4]=1;
n--;
while(n)
{
if(n&1) I=multi(I,T);
n>>=1;
T=multi(T,T);
}
ll ans=0;
for(i=0;i<5;i++)
{
ans+=p[i]*I.a[i][4];
ans%=mod;
}
printf("%I64d\n",ans);
}
}