Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
54964 | zhangweiran | 矩阵交换行 | C++ | Accepted | 1 MS | 252 KB | 375 | 2024-11-01 15:40:08 |
#include<bits/stdc++.h> using namespace std; int a[10][10]; int main(){ int m,n; for(int hang=1;hang<=5;hang++){ for(int lie=1;lie<=5;lie++) cin>>a[hang][lie]; } cin>>m>>n; for(int i=1;i<=5;i++){ swap(a[m][i],a[n][i]); } for(int hang=1;hang<=5;hang++){ for(int lie=1;lie<=5;lie++) cout<<a[hang][lie]<<' '; cout<<endl; } return 0; }