题解 | #矩阵交换#

#include <stdio.h>

int main() {
    int a,b,i,j;
    int arr[10][10] = {0};
    scanf("%d %d\n",&a,&b);
    for(i=0;i<a;i++)
    {
        for(j=0;j<b;j++)
        {
            scanf("%d \n",&arr[i][j]);
        }
    }
    int k = 0;
    scanf("%d\n",&k);
        char t = 0;
        int n,m;
        while(scanf("%c %d %d\n",&t,&n,&m)!=EOF)
        {
            if(t=='r')
        {
            for(i=0;i<b;i++)
            {
                int tmp = arr[n-1][i];
                arr[n-1][i] = arr[m-1][i];
                arr[m-1][i] = tmp;
            }
        }
        else if(t=='c')
        {
            for(i=0;i<a;i++)
            {
                int tmp = arr[i][n-1];
                arr[i][n-1] = arr[i][m-1];
                arr[i][m-1] = tmp;
            }
        }   
        }
    for(i=0;i<a;i++)
    {
        for(j=0;j<b;j++)
        {
            printf("%d ",arr[i][j]);
        }
        printf("\n");
    }
    return 0;
}