求入门赛F题UKE原因
  • 板块学术版
  • 楼主Axolotl_awa
  • 当前回复11
  • 已保存回复11
  • 发布时间2024/6/14 21:01
  • 上次更新2024/6/15 07:12:45
查看原帖
求入门赛F题UKE原因
1145476
Axolotl_awa楼主2024/6/14 21:01
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, m, q;
    cin >> n >> m >> q;
    
    char a[n][m];

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> a[i][j];
        }
    }

    for (int i = 0; i < q; i++) {
        int x, y, z;
        cin >> x >> y >> z;

        if (x == 1) {
            for (int j = 0; j < m; j++) {
                swap(a[y][j], a[z][j]);

            }
        }
        else if (x == 2) {
            for (int i = 0; i < n; i++)
                swap(a[i][y], a[i][z]);

        }
        else if (x == 3) {
            cout << a[y][z] << endl;
        }
    }


    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cout << a[i][j];
        }
        cout << endl;
    }
    return 0;
}

2024/6/14 21:01
加载中...