题解 | 矩阵交换

#include <stdio.h>

int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	int dp[n][m];
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			scanf("%d", &dp[i][j]);
		}
	}
	int num;
	scanf("%d", &num);
	char ch;
	int a, b;
	for (int c = 1; c <= num; c++) {
		getchar();
		scanf("%c", &ch);
		getchar();
		scanf("%d%d", &a, &b);
		if (ch == 'r') {
			for (int i = 0; i < m; i++) {
				int temp;
				temp = dp[a - 1][i];
				dp[a - 1][i] = dp[b - 1][i];
				dp[b - 1][i] = temp;
			}

		} else if (ch == 'c') {
			for (int i = 0; i < n; i++) {
				int temp;
				temp = dp[i][a - 1];
				dp[i][a - 1] = dp[i][b - 1];
				dp[i][b - 1] = temp;
			}
		} else
			continue;
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			printf("%d ", dp[i][j]);
		}
		printf("\n");
	}
	return 0;
}