矩阵的乘法

很久没写题了，一直在刷水题，以前一直没写过矩阵的乘法，其实一直都是用matlab搞的，这回用C写了个，和网上流行的那种很像，其实就是模拟第i行和第j列的和，然后放进

c[i][j]里面就行了。。。

代码：

# include<cstdio>
# include<iostream>
# include<algorithm>
# include<cstring>
# include<string>
# include<cmath>
# include<queue>
# include<stack>
# include<set>
# include<map>

using namespace std;

# define inf 999999999
# define MAX 50+4

int a1[MAX][MAX];
int a2[MAX][MAX];
int c[MAX][MAX];

int m,w,n;

void input()
{
    for ( int i = 0;i < m;i++ )
    {
        for ( int j = 0;j < w;j++ )
            cin>>a1[i][j];
    }
    for ( int i = 0;i < w;i++ )
    {
        for ( int j = 0;j < n;j++ )
            cin>>a2[i][j];
    }
}

void solve()
{
    int temp = 0;
    for ( int i = 0;i < m;i++ )
    {
        for ( int j = 0;j < n;j++ )
        {
            temp = 0;
            for ( int k = 0;k < w;k++ )
            {
                temp+=a1[i][k]*a2[k][j];
            }
            c[i][j] = temp;
        }
    }
}

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

int main(void)
{
    while ( cin>>m>>w>>n )
    {
        input();
        solve();
        output();
    }




	return 0;
}