矩阵快速幂

---

回顾 快速幂

A^n

int power(int a,int n)
{
	int ans;
	if(n==0)
	ans=1;
	else 
	{
		ans = power(a*a,n/e);
		if(m%2==1) ans *=a;
	}
	return ans;
}
int power(int a,int n)
{
	int ans=1;
	while(n)
	{
		if(n%2) ans = ans*a;
		a = a*a;
		n/=2;
	}
}

矩阵快速幂

例题：

一直斐波那契数列的定义为：f[0]=0;f[1]=1;f[n]=f[n-1]+f[n-2]，请计算f[k]的值，结果对10^9+7取余。

Cn-1 = B*Cn-1

1、Tr A

#include <iostream>
#include <cstring>
using namespace std;
long long k,n;
const int mod = 9973;
struct node
{
    int a[15][15];
};
node ans;
node Mul(node a,node b)
{
    node res;
    memset(res.a,0,sizeof(res.a));
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            for(int k=0;k<n;k++)
            {
                res.a[i][j] = (res.a[i][j]+a.a[i][k]*b.a[k][j])%mod;
            }
        }
    }
    return res;
}
long long quickPow(long long x)
{
    node res;
    memset(res.a,0,sizeof(res.a));
    for(int i=0;i<n;i++)
    {
        res.a[i][i]=1;
    }
    while(x)
    {
        if(x&1)
        {
            res = Mul(ans,res);
        }
        ans = Mul(ans,ans);
        x>>=1;
    }
    long long s=0;
    for(int i=0;i<n;i++)
        s = (s+res.a[i][i])%mod;
    return s;
}
int main()
{
    int  t;
    cin >> t;
    while(t--)
    {
       cin >> n >> k;
       for(int i=0;i<n;i++)
       {
           for(int j=0;j<n;j++)
           {
               cin >> ans.a[i][j];
           }
       }
       long long s  = quickPow(k);
       cout << s << endl;
    }
    return 0;
}

2、A Simple Math Problem

#include <iostream>
#include <cstring>
using namespace std;
long long int m;
long long int k;
struct mat
{
    int a[11][11];
}ans,tmp,base;
mat operator* (mat a,mat b)
{
    mat r;
    memset(r.a,0,sizeof(r.a));
    for(int i=1;i<=10;i++)
    {
        for(int j=1;j<=10;j++)
        for(int k=1;k<=10;k++)
        {
            r.a[i][j]=r.a[i][j]+a.a[i][k]*b.a[k][j];
            if(r.a[i][j]>=m)
                r.a[i][j]%=m;
        }
    }
    return r;
}
void init() // 构造
{
    memset(ans.a,0,sizeof(ans.a));
    for(int i=1;i<=10;i++)
        ans.a[i][i]=1;
    for(int i=2;i<=10;i++)
        tmp.a[i][i-1]=1;
    memset(base.a,0,sizeof(base.a));
    for(int i=1;i<=10;i++)
        base.a[i][1]=10-i;
}
int pow_mat()
{
    init();
    while(k)
    {
        if(k&1)
            ans = ans*tmp;
        tmp=tmp*tmp;
        k>>=1;
    }
    ans = ans*base;
    return ans.a[1][1];
}
int main()
{
    while(~scanf("%d%d",&k,&m))
    {
        memset(tmp.a,0,sizeof(tmp.a));
        for(int i=1;i<=10;i++)
            cin >> tmp.a[1][i];
        if(k<10)
            cout << k%m << endl;
        else
        {
            k -= 9;
            cout << pow_mat() << endl;
        }
    }
}

3、Queuing

#include <iostream>
#include <cstring>
using namespace std;
long long int m,n;
long long int k;
struct mat
{
    int a[4][4];
};
mat ans;
void init()
{
    for(int i=0;i<4;i++)
        for(int j=0;j<4;j++)
    {
        if(i==j)
            ans.a[i][j]=1;
        else
            ans.a[i][j]=0;
    }
}
mat mul(mat a,mat b)
{
    mat c;
    memset(c.a,0,sizeof(c.a));
    for(int i=0;i<4;i++)
    {
        for(int j=0;j<4;j++)
        {
            for(int k=0;k<4;k++)
                c.a[i][j] = (c.a[i][j]+a.a[i][k]*b.a[k][j])%m;
        }
    }
    return c;
}
mat pow_mat(mat a,int k)
{
    mat p = a;
    while(k)
    {
        if(k&1)
         {
             ans = mul(ans,p);k--;
         }
        k>>=1;
        p = mul(p,p);
    }
    return ans;
}
int main()
{
   init();
   mat A={
   1,0,1,1,
   1,0,0,0,
   0,1,0,0,
   0,0,1,0
   };
   int a[4]={1,2,4,6};
   while(cin >> n >> m)
   {
     init();
      mat ans = pow_mat(A,n-3);
      int x=0;
      for(int i=0;i<4;i++)
        x+= (ans.a[0][i]*a[4-i-1])%m;
      cout << x%m << endl;
   }
}

4、Count

#include <bits/stdc++.h>

const int maxn = 1044373;
using namespace std;

#define LL long long
const LL mod = 123456789;
struct mat
{
    LL a[6][6];
} g, m;
// 矩阵快速幂
mat operator * (mat a,mat b)
{
    mat t;
    for (int i = 0; i < 6; ++i)
    {
        for (int j = 0; j < 6; ++j)
        {
            t.a[i][j] = 0;
            for (int k = 0; k < 6; ++k)
            {
                t.a[i][j] = (t.a[i][j] + (a.a[i][k] * b.a[k][j] % mod)) % mod;
            }
        }
    }
    return t;
}
mat quick(mat tmp, LL x)
{
    mat t;
    memset(t.a, 0,sizeof(t.a));
    for (int i = 0; i < 6; ++i) t.a[i][i] = 1;
    while (x)
    {
        if (x&1) t = t * tmp;
        tmp = tmp * tmp;
        x >>= 1;
    }
    return t;
}

int main()
{
    ios::sync_with_stdio(false);
    int T;
    scanf("%d", &T);
    g.a[0][1] = 1;
    g.a[1][0] = 2;
    g.a[1][2] = g.a[1][1] = 1;
    g.a[1][3] = g.a[1][4] = 3;
    g.a[1][5] = g.a[2][2] = 1;
    g.a[2][3] = g.a[2][4] = 3;
    g.a[2][5] = g.a[3][3] = 1;
    g.a[3][4] = 2;
    g.a[3][5] = g.a[4][4] = g.a[4][5] = g.a[5][5] = 1;

    m.a[0][0] = 1;
    m.a[1][0] = 2;
    m.a[2][0] = 8;
    m.a[3][0] = 4;
    m.a[4][0] = 2;
    m.a[5][0] = 1;

    while (T--)
    {
        LL n;
        scanf("%lld", &n);
        if (n == 1 || n == 2)
        {
            printf("1\n");
            continue;
        }
        mat t = quick(g, n-2);
        mat ans = t * m;

        printf("%lld\n", ans.a[1][0]);
    }

    return 0;
}