矩阵乘法演示.md

title: 矩阵乘法演示 categories: 编程 tags: [编程] date: 2019-06-09 23:07:18

#include <iostream>
#include <cstring>
#include <cstdio>
#include <windows.h>
//矩阵乘法
using namespace std;
#define maxn 11
int n,m,p;
char a[maxn][maxn],b[maxn][maxn],ans[maxn][maxn];

void print(int i,int k,int j){
    static int round = 1;
    a[i][k] = '*';
    b[k][j] = '*';
    ans[i][j] = '*';
    printf("%d\n",round++);
    for(int ii = 1;ii<=n;ii++){
        printf("%s\n",a[ii]+1);
    }
    putchar('\n');
    for(int ii = 1;ii<=p;ii++){
        printf("%s\n",b[ii]+1);
    }
    putchar('\n');
    for(int ii = 1;ii<=p;ii++){
        printf("%s\n",ans[ii]+1);
    }
    putchar('\n');
    a[i][k] = '0';
    b[k][j] = '0';
    ans[i][j] = '0';
}

int main()
{
    for(int i = 1;i<=55;i++)
        putchar('\n');
    memset(a,'0',sizeof(a));
    memset(b,'0',sizeof(b));
    memset(ans,'0',sizeof(ans));
    //cin>>n>>m>>p;
    n=m=p=5;
    for(int i = 1;i<=n;i++){
        a[i][m+1] = '\0';
    }
    for(int i = 1;i<=m;i++){
        b[i][p+1] = '\0';
        ans[i][p+1] = '\0';
    }
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=p;j++){
            for(int k = 1;k<=m;k++){
                print(i,k,j);
                system("pause");
            }
        }
    }
    return 0;
}