矩阵交换

#include <stdio.h>

int main() {
    int n = 0, m = 0;
    long long arr1[101][101] = {0}; 
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i++) { 
        for (int j = 0; j < m; j++) { 
            scanf("%lld", &arr1[i][j]);
        }
    }
    int k = 0;
    char t;
    int a=0, b=0;
    scanf("%d", &k);
    for (int l = 0; l < k; l++) {
        scanf(" %c%d%d", &t, &a, &b); 
        //a--; b--; 
        if (t == 'r' && a > 0 && a <= n && b > 0 && b <= n) { 
            long long temp[101] = {0}; 
            for (int j = 0; j < m; j++) {
                temp[j] = arr1[a-1][j];
                arr1[a-1][j] = arr1[b-1][j];
                arr1[b-1][j] = temp[j];
            }
        }
        if (t == 'c' && a > 0 && a <= n && b > 0 && b <= n) { 
            long long temp[101] = {0}; 
            for (int i = 0; i < n; i++) {
                temp[i] = arr1[i][a-1];
                arr1[i][a-1] = arr1[i][b-1];
                arr1[i][b-1] = temp[i];
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            printf("%lld ", arr1[i][j]);
        }
        printf("\n");
    }
    return 0;
}