CompetitiveProgramming/B.cpp at main · sahamrit/CompetitiveProgramming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
#include <bits/stdc++.h>
#include <stdint.h>

using namespace std;

#define endl "\n"
#define fastio               \
	ios::sync_with_stdio(0); \
	cin.tie(0);              \
	cout.tie(0);
// STANDARD DATA TYPES
#define ll long long
#define llu unsigned long long
#define ld long double
// ADV DATA TYPES
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define ff first
#define ss second
// C ++ DS
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define pf push_front
#define iter ::iterator
#define all(x) x.begin(), x.end()

// priority_queue < pii, vector < pii >, greater < pii > > pq;
// lower_bound(v.begin(),v.end(),20);//for any sorted container
// CONSTANTS
#define MOD 998244353
#define INF 0x3f3f3f3f
#define MAXN (int)(1e5 + 1)
// MOD OPERATIONS
inline ll fpow(ll n, ll k, int p = MOD)
{
	ll r = 1;
	for (; k; k >>= 1)
	{
		if (k & 1)
			r = r * n % p;
		n = n * n % p;
	}
	return r;
}
inline ll inv(ll a, ll p = MOD)
{
	return fpow(a, p - 2, p);
}
inline ll addmod(ll a, ll val, ll p = MOD)
{
	{
		if ((a = (a + val)) >= p)
			a -= p;
	}
	return a;
}
inline ll submod(ll a, ll val, ll p = MOD)
{
	{
		if ((a = (a - val)) < 0)
			a += p;
	}
	return a;
}
inline ll mult(ll a, ll b, ll p = MOD)
{
	return (ll)a * b % p;
}
// DEBUG
#define shout()                           \
	{                                     \
		cout << "I'm Here...!!!" << endl; \
	}
#define dbg(x)                             \
	{                                      \
		cout << #x << ": " << (x) << endl; \
	}
#define dbg2(x, y)                                                       \
	{                                                                    \
		cout << #x << ": " << (x) << " , " << #y << ": " << (y) << endl; \
	}

void matr_mult(vector<vll> &A, vector<vll> &B)
{
	int n = A.size();
	if (!n)
		return;
	int m = A[0].size();
	if (B.size() != m)
		return;
	int p = B[0].size();
	vector<vll> res(n, vll(p, 0));
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < p; j++)
		{
			for (int k = 0; k < m; k++)
			{
				res[i][j] = addmod(res[i][j], mult(A[i][k], B[k][j]));
			}
		}
	}
	A = res;
}

void matr_expo(vector<vll> &A, ll n)
{
	if (n == 1)
		return;
	vector<vll> temp = A;
	matr_expo(A, n / 2);
	matr_mult(A, A);
	if (n % 2)
	{
		matr_mult(A, temp);
	}
}

int main()
{
	fastio;
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	int n, m, pow;
	cin >> n >> m >> pow;
	vector<vll> arr(n, vll(m, 0));
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			cin >> arr[i][j];
		}
	}

	matr_expo(arr, pow);

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			cout << arr[i][j] << " ";
		}
		cout << endl;
	}
}