矩阵

#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include "biginteger.h"
using namespace std;
struct matrix
{
    BigInteger g[10][10];
    int n, m;
    matrix operator=(const matrix &b)
    {
        n = b.n;
        m = b.m;
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                g[i][j] = b.g[i][j];
            }
        }
        return *this;
    }
};
matrix operator*(const matrix &a, const matrix &b)
{
    matrix c;
    if (a.m != b.n || a.n != b.m)
        return c;
    c.n = a.n;
    c.m = a.m;
    BigInteger sum;
    for (int i = 0; i < a.n; i++)
    {
        for (int j = 0; j < a.m; j++)
        {
            int I;
            sum = 0;
            for (I = 0; I < a.m; I++)
            {
                sum = sum+(a.g[i][I] * b.g[I][j]);
            }
            c.g[i][j] = sum;
        }
    }
    return c;
}
matrix pow(matrix a, int b)
{
    matrix ans, base = a;
    ans.n = ans.m = a.n;
    for (int i = 0; i < ans.n; i++)
    {
        for (int j = 0; j < ans.m;j++)
        {
            if(i==j)
                ans.g[i][j] = 1;
            else ans.g[i][j] = 0;
        }
    }
    while (b)
    {
        if (b & 1)
        {
            ans = ans * base;
        }
        base = base * base;
        b >>= 1;
    }
    return ans;
}
int main()
{
    matrix a, b;
    int c;
    int i, j;
    cin >> a.n >> a.m;
    for (i = 0; i < a.n; i++)
    {
        for (j = 0; j < a.m; j++)
        {
            cin >> a.g[i][j];
        }
    }
    for (i = 0; i < a.n; i++)
    {
        for (j = 0; j < a.m; j++)
        {
            cin >> b.g[i][j];
        }
    }
    b.n = b.m = a.n;
    matrix A = a;
    while (cin >> c)
    {
        a = A * pow(b, c);
        for (i = 0; i < a.n; i++)
        {
            for (j = 0; j < a.m; j++)
            {
                cout << a.g[i][j] << ' ';
            }
            cout << endl;
        }
    }
}