题解 | #矩阵交换#

#include <stdio.h>
#include <stdlib.h>
int main() {
    int n, m;
    scanf("%d%d", &n, &m);
    int arr1[n][m];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            scanf("%d", &arr1[i][j]);
        }
    }
    int k = 0;
    scanf("%d", &k);
    for (int j = 0; j < k; j++) {
        char c = 0;
        getchar();
        scanf("%c", &c);
        int a, b;
        scanf("%d%d", &a, &b);
        int temp = 0;
        if (c == 'r')
            for (int i = 0; i < m; i++) {
                temp = arr1[a - 1][i];
                arr1[a - 1][i] = arr1[b - 1][i];
                arr1[b - 1][i] = temp;
            } else if (c == 'c')
            for (int i = 0; i < n; i++) {
                temp = arr1[i][a - 1];
                arr1[i][a - 1] = arr1[i][b - 1];
                arr1[i][b - 1] = temp;
            }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            printf("%d ", arr1[i][j]);
        }
        printf("\n");
    }
    return 0;
}