mirror of
https://github.com/wczffl-503/OI-Codes.git
synced 2025-07-07 18:06:58 +08:00
添加了许多代码文件
This commit is contained in:
34
#209. 矩阵交换行.cpp
Normal file
34
#209. 矩阵交换行.cpp
Normal file
@ -0,0 +1,34 @@
|
||||
#include <iostream>
|
||||
#include <cstring>
|
||||
#include <cstdio>
|
||||
#include <iomanip>
|
||||
using namespace std;
|
||||
int main(){
|
||||
int a[100][100],b[100][100],c,d;
|
||||
for(int i=0;i<5;i++){
|
||||
for(int j=0;j<5;j++){
|
||||
cin >>a[i][j];
|
||||
}
|
||||
}
|
||||
for(int i=0;i<5;i++){
|
||||
for(int j=0;j<5;j++){
|
||||
b[i][j]=a[i][j];
|
||||
}
|
||||
}
|
||||
cin >>c>>d;
|
||||
for(int i=0;i<5;i++){
|
||||
a[c-1][i]=a[d-1][i];
|
||||
}
|
||||
for(int i=0;i<5;i++){
|
||||
a[d-1][i]=b[c-1][i];
|
||||
}
|
||||
for(int i=0;i<5;i++){
|
||||
for(int j=0;j<5;j++){
|
||||
cout <<a[i][j]<<" ";
|
||||
}
|
||||
cout <<endl;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
Reference in New Issue
Block a user