Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
127905 包老师 矩阵行交换 C++ Accepted 1 MS 272 KB 729 2025-07-30 12:31:01

Tests(2/2):


Code:

#include<bits/stdc++.h> using namespace std; int main() { //只需要按照求数组总和的方式 int n, m; cin >> n >> m; int a[5][5]; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { cin >> a[i][j]; } } int t; t = a[n - 1][0] ; a[n - 1][0] = a[m - 1][0]; a[m - 1][0] = t; t = a[n - 1][1] ; a[n - 1][1] = a[m - 1][1]; a[m - 1][1] = t; t = a[n - 1][2] ; a[n - 1][2] = a[m - 1][2]; a[m - 1][2] = t; t = a[n - 1][3] ; a[n - 1][3] = a[m - 1][3]; a[m - 1][3] = t; t = a[n - 1][4] ; a[n - 1][4] = a[m - 1][4]; a[m - 1][4] = t; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { cout<< a[i][j]<<" "; } cout<<endl; } return 0; }