Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Make CSP great again
- #include <bits/stdc++.h>
- #define TASK "TESTCODE"
- using namespace std;
- using Matrix = vector<vector<int> >;
- int n, m;
- void ResizeMatrix(Matrix & a)
- {
- a.resize(n + 1);
- for (int i = 0; i <= n; ++ i)
- {
- a[i].resize(n + 1, 0);
- }
- }
- void PrintMatrix(Matrix & a)
- {
- for (int i = 1; i <= n; ++ i)
- {
- for (int j = 1; j <= n; ++ j)
- {
- cout << a[i][j] << ' ';
- }
- cout << '\n';
- }
- }
- Matrix operator + (Matrix & a, Matrix & b)
- {
- Matrix c;
- ResizeMatrix(c);
- for (int i = 1; i <= n; ++ i)
- {
- for (int j = 1; j <= n; ++ j)
- {
- c[i][j] = a[i][j] + b[i][j];
- c[i][j] %= 10;
- }
- }
- return c;
- }
- Matrix operator * (Matrix & a, Matrix & b)
- {
- Matrix c;
- ResizeMatrix(c);
- for (int i = 1; i <= n; ++ i)
- {
- for (int j = 1; j <= n; ++ j)
- {
- for (int k = 1; k <= n; ++ k)
- {
- c[i][j] += a[i][k] * b[k][j];
- c[i][j] %= 10;
- }
- }
- }
- return c;
- }
- Matrix operator ^ (Matrix a, int k)
- { --k;
- Matrix c = a;
- for (; k > 0; k /= 2)
- {
- if (k & 1)
- {
- c = c * a;
- }
- a = a * a;
- }
- return c;
- }
- Matrix G(Matrix a, int k)
- {
- if (k == 1)
- {
- return a;
- }
- Matrix c = G(a, k/2);
- Matrix add = a ^ (k/2);
- add = add * c;
- Matrix res = c + add;
- if (k & 1)
- {
- Matrix add2 = a ^ k;
- res = res + add2;
- }
- return res;
- }
- Matrix a;
- void read()
- {
- cin >> n >> m;
- ResizeMatrix(a);
- for (int i = 1; i <= n; ++ i)
- {
- for (int j = 1; j <= n; ++ j)
- {
- cin >> a[i][j];
- a[i][j] %= 10;
- }
- }
- }
- void solve()
- {
- a = G(a, m);
- PrintMatrix(a);
- }
- int main()
- {
- ios_base::sync_with_stdio(false);
- cin.tie(nullptr);
- //freopen(TASK".INP", "r", stdin);
- //freopen(TASK".OUT", "w", stdout);
- int t = 1;
- bool typetest = false;
- if (typetest)
- {
- cin >> t;
- }
- for (int __ = 1; __ <= t; ++ __)
- {
- read();
- solve();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement