#include <iostream>
using namespace std;
int main(){
int a[5][5], m, n;
for (int i = 0; i < 5; i ++ ) {
for (int j = 0; j < 5; j ++ ) {
cin >> a[i][j];
}
}
cin>>m>>n;
for (int i = 0; i < 5; i ++ ) {
swap(a[m-1][i], a[n-1][i]);
}
for (int i = 0; i < 5; i ++ ) {
for (int j = 0; j < 5; j ++ ) {
cout << a[i][j] << ' ';
}
cout << endl;
}
return 0;
}
1120 同行列对角线的和
#include <cstdio>
using namespace std;
int main(){
int n, x, y;
scanf("%d%d%d", &n, &x, &y);
for (int j = 1; j <= n; j ++ ) printf("(%d,%d) ", x, j);
printf("\n");
for (int i = 1; i <= n; i ++ ) printf("(%d,%d) ", i, y);
printf("\n");
for (int i = 1; i <= n; i ++ ) {
for (int j = 1; j <= n; j ++ ) {
if (j-i == y-x) printf("(%d,%d) ", i, j);
}
}
printf("\n");
for (int i = n; i >= 1; i -- ) {
for (int j = 1; j <= n; j ++ ) {
if (i+j == x+y) printf("(%d,%d) ", i, j);
}
}
printf("\n");
return 0;
}