sdnu oj 1478 矩阵乘法

虽然线代行列式还没学明白，，，但是知道矩阵相乘的公式了2333

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;
const int N = 36;

struct matrix
{
    int x[N][N];
};

matrix mul(matrix a, matrix b, int n)
{
    matrix c;
    int i, j, k;
    for(i = 0; i <= n; ++i)
        c.x[i][0] = c.x[0][i] = 0;
    for(i = 1; i <= n; ++i)
        for(j = 1; j <= n; ++j)
        {
            int sum = 0;
            for(k = 1; k <= n; ++k)
                sum += a.x[i][k]*b.x[k][j];
            c.x[i][j] = sum;
        }
    return c;
}

matrix fun(matrix a, int n, int m)
{
    matrix c;
    int i, j, k;
    for(i = 0; i <= n; ++i)
        for(j = 0; j <= n; ++j)
        {
            c.x[i][j] = 0;
            if(i == j)
                c.x[i][j] = 1;
        }
    if(m == 0)
       return c;
    if(m == 1)
        return a;
    while(m)
    {
        if(m&1)
            c = mul(a, c, n);
        a = mul(a, a, n);
        m >>= 1;
    }
    return c;
}

matrix a, ans;

int main()
{
    int n, m, i, j, k;
    scanf("%d%d", &n, &m);
    for(i = 1; i <= n; ++i)
        for(j = 1; j <= n; ++j)
            scanf("%d", &a.x[i][j]);
    if(n != 1)
    {
        ans = fun(a, n, m);
        for(i = 1; i <= n; ++i)
        {
            int flag = 0;
            for(j = 1; j <= n; ++j)
            {
                if(flag)
                    printf(" %d", ans.x[i][j]);
                else
                    printf("%d", ans.x[i][j]);
                flag = 1;
            }
            printf("\n");
        }
    }
    else
    {
        int tp = a.x[1][1];
        int anss = 1;
        for(i = 1; i <= m; ++i)
            anss *= tp;
        printf("%d\n", anss);
    }
    return 0;
}