题解 | #矩阵转置#

#include<stdio.h>
void  converse(int a[100][100], int m) {
    int temp;
    for (int i = 0; i < m; i++)
        for (int j = i; j < m; j++) {
            temp = a[i][j];
            a[i][j] = a[j][i];
            a[j][i] = temp;
        }

}
int main() {
    int m;
    int a[100][100];
    while (scanf("%d", &m) != EOF) {
        for (int i = 0; i < m; i++) //输入
            for (int j = 0; j < m; j++)
                scanf("%d", &a[i][j]);
        converse(a, m);  //逆置
        for (int i = 0; i < m; i++) { //输出
            for (int j = 0; j < m; j++)
                printf("%d ", a[i][j]);
            printf("\n");
        }
    }



    return 0;
}