21-矩阵转置

#include <stdio.h>
#include <stdlib.h>


#define N 100
int a[N][N];
int b[N][N];

void transpose(int a[N][N], int b[N][N], int m, int n) {
    int i = 0;
    int j = 0;
    for (i = 0; i < m; i++) {
        for (j = 0; j < n; j++) {
            b[j][i] = a[i][j];
        }
    }
}

void show(int a[N][N], int m, int n) {
    int i = 0;
    int j = 0;
    for (i = 0; i < m; i++) {
        for (j = 0; j < n; j++) {
            printf("%d", a[i][j]);
            if (j != n - 1) {
                printf(" ");
            }
        }
        printf("\n");
    }
}

int main() {
    int m = 0, n = 0;
    printf("please input the matrix's row and column:\n");
    scanf("%d%d", &m, &n);
    int i = 0;
    int j = 0;
    printf("please input the element of matrix:\n");
    for (i = 0; i < m; i++) {
        for (j = 0; j < n; j++) {
            scanf("%d", &a[i][j]);
        }
    }
    show(a, m, n);
    transpose(a, b, m, n);
    show(b, n, m);
    return 0;
}