蓝桥杯 算法训练 矩阵相乘

#include<iostream>using namespace std;int a[200][200];int b[200][200];int ab[200][200];void mult_matrix(int m,int s,int n){for(int i=1;i<=m;i++){for(int j=1;j<=n;j++){ab[i][j]=0;for(int k=1;k<=s;k++)     ab[i][j]+=a[i][k]*b[k][j];}}for(int i=1;i<=m;i++){for(int j=1;j<=n;j++){cout<<ab[i][j]<<" ";}cout<<endl;}cout<<endl;}int main(){int m,s,n;while(cin>>m>>s>>n){for(int i=1;i<=m;i++){for(int j=1;j<=s;j++){cin>>a[i][j];}}for(int i=1;i<=s;i++){for(int j=1;j<=n;j++){cin>>b[i][j];}}mult_matrix(m,s,n);}return 0;}