欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识!
您现在的位置是: 首页

洛谷 - P3390 【模板】矩阵快速幂 (板子)

程序员文章站 2022-05-22 08:23:12
...

题目传送
题意:
洛谷 - P3390 【模板】矩阵快速幂 (板子)
板子题,和普通的快速幂差不多,只是变成了矩阵相乘,这里记录下板子

AC代码

#include <bits/stdc++.h>
inline long long read(){char c = getchar();long long x = 0,s = 1;
while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}
while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}
return x*s;}
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a,b) memset(a,b,sizeof(a))
#define lowbit(x) (x)&(-x)
const int N = 1e5 + 10;
const long long INFINF = 0x7f7f7f7f7f7f7f;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-7;
const long long mod = 1e9+7;
const double II = acos(-1);
const double PP = (II*1.0)/(180.00);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> piil;
ll n,k;
struct node
{
    ll arr[150][150];
    node(){memset(arr,0,sizeof(arr));}//结构体初始化
    inline void Built(){//结构体内镶函数
        for(ll i = 1;i <= n;i++)
            arr[i][i] = 1;
    }
}a;
node operator *(const node &b,const node &c)//重载运算符
{
    node z;
    for(ll i = 1;i <= n;i++)
        for(ll j = 1;j <= n;j++)
            for(ll k = 1;k <= n;k++)
                z.arr[i][j] = (z.arr[i][j] + b.arr[i][k]*c.arr[k][j]%mod)%mod;
    return z;
}
node qucik_pow()
{
    node ans;
    ans.Built();
    while(k)
    {
        if(k&1) ans = ans*a;
        k >>= 1;
        a = a*a;
    }
    return ans;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
//    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
    cin >> n >> k;
    for(ll i = 1;i <= n;i++)
        for(ll j = 1;j <= n;j++)
            cin >> a.arr[i][j];
    node c = qucik_pow();
    for(ll i = 1;i <= n;i++)
        for(ll j = 1;j <= n;j++)
            j == n ? cout << c.arr[i][j] << endl : cout << c.arr[i][j] << " ";
}