矩阵---相乘,相加,转置

//
// Created by 86184 on 2024/8/16.
//
//矩阵乘法
//  c[i][j] = a[i][p]*b[p][i] -->p从1到M
#include <stdio.h>

#define MAX_N 100

int main() {
    int i = 0, j = 0, k = 0, aRow = 0, aCol = 0, bRow = 0, bCol = 0;
    int a[100][100] = {{0}}, b[100][100] = {{0}}, c[100][100] = {{0}};

    while (1) {
        printf("请输入矩阵A的行数和列数:");
        fflush(stdout);
        scanf("%d %d", &aRow, &aCol);

        printf("请输入矩阵B的行数和列数:");
        fflush(stdout);
        scanf("%d %d", &bRow, &bCol);
        if (aCol == bRow) {
            break;
        }
        printf("该矩阵规格无法相乘,请重新输入:");
    }


    printf("请输入矩阵A:\n");
    fflush(stdout);

    for (i = 0; i < aRow; ++i) {
        for (j = 0; j < aCol; ++j) {
            scanf("%d", &a[i][j]);
        }
    }
    printf("请输入矩阵B:\n");
    fflush(stdout);
    for (i = 0; i < bRow; ++i) {
        for (j = 0; j < bCol; ++j) {
            scanf("%d", &b[i][j]);
        }
    }
    //a 4 2
    //b 2 3
    //c 4 3
    for (i = 0; i < aRow; ++i) {
        for (j = 0; j < bCol; j++) {
            for (k = 0; k < aCol; ++k) {
                c[i][j] += a[i][k] * b[k][j];
            }
        }
    }

    for (i = 0; i < aRow; ++i) {
        for (j = 0; j < bCol; ++j) {
            printf("%d ", c[i][j]);
        }
        printf("\n");

    }

    return 0;
}
//
// Created by 86184 on 2024/8/16.
//
//矩阵加法
#include <stdio.h>

int main() {
    int i = 0, j = 0, k = 0, Row = 0, Col = 0;
    int a[100][100] = {{0}}, b[100][100] = {{0}}, c[100][100] = {{0}};

    printf("请输入矩阵的行数和列数:");
    fflush(stdout);
    scanf("%d %d", &Row, &Col);

    printf("请输入矩阵A:\n");
    fflush(stdout);

    for (i = 0; i < Row; ++i) {
        for (j = 0; j < Col; ++j) {
            scanf("%d", &a[i][j]);
        }
    }
    printf("请输入矩阵B:\n");
    fflush(stdout);
    for (i = 0; i < Row; ++i) {
        for (j = 0; j < Col; ++j) {
            scanf("%d", &b[i][j]);
        }
    }

    for (i = 0; i < Row; i++) {
        for (j = 0; j < Col; j++) {
            c[i][j] = a[i][j] + b[i][j];
        }
    }
    printf("结果矩阵为:\n");
    fflush(stdout);
    for (i = 0; i < Row; ++i) {
        for (j = 0; j < Col; ++j) {
            printf("%d ", c[i][j]);
        }

        printf("\n");

    }

    return 0;
}



//
// Created by 86184 on 2024/8/16.
//
//矩阵转置

#include <stdio.h>

int main() {
    int i = 0, j = 0, k = 0, Row = 0, Col = 0;
    int a[100][100] = {{0}}, b[100][100] = {{0}};

    printf("请输入矩阵的行数和列数:");
    fflush(stdout);
    scanf("%d %d", &Row, &Col);

    printf("请输入矩阵:\n");
    fflush(stdout);

    for (i = 0; i < Row; ++i) {
        for (j = 0; j < Col; ++j) {
            scanf("%d", &a[i][j]);
        }
    }

    for (i = 0; i < Row; ++i) {
        for (j = 0; j < Col; ++j) {
            b[j][i] = a[i][j];
        }
    }
    for (i = 0; i < Row; ++i) {
        for (j = 0; j < Col; ++j) {
            b[j][i] = a[i][j];
        }
    }

    printf("转置的结果矩阵为:\n");
    fflush(stdout);
    for (i = 0; i < Row; ++i) {
        for (j = 0; j < Col; ++j) {
            printf("%d ", b[i][j]);
        }

        printf("\n");

    }

    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值