/* //1460 矩阵加法 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ int n=0,m=0,a[101][101],b[101][101]; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>a[i][j]; } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>b[i][j]; } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cout<<a[i][j]+b[i][j]<<" "; } cout<<endl; } return 0; } //1461 外围元素之和 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ int m=0,n=0,a[11][11],s=0; cin>>m>>n; for(int i=1;i<=m;i++){ for(int j=1;j<=n;j++){ cin>>a[i][j]; } } for(int i=1;i<=m;i++){ for(int j=1;j<=n;j++){ if(i==1 || i==m || j==n || j==1){ s+=a[i][j]; } } } cout<<s; return 0; } //1462 矩阵倒序输出 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ int n=0,m=0,a[101][101]; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>a[i][j]; } } for(int i=1;i<=n;i++){ for(int j=m;j>=1;j--){ cout<<a[i][j]<<" "; } cout<<endl; } return 0; } //1463 矩阵行交换 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ int n=0,m=0,a[6][6]; cin>>n>>m; for(int i=1;i<=5;i++){ for(int j=1;j<=5;j++){ cin>>a[i][j]; } } for(int i=1;i<=5;i++){ for(int j=1;j<=5;j++){ if(i!=n && i!=m){ cout<<a[i][j]<<" "; } else if(i==n){ cout<<a[m][j]<<" "; } else if(i==m){ cout<<a[n][j]<<" "; } } cout<<endl; } return 0; }*/ //1464 矩阵转置 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ int n=0,m=0,a[101][101]; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>a[i][j]; } } for(int i=1;i<=m;i++){ for(int j=1;j<=n;j++){ cout<<a[j][i]<<" "; } cout<<endl; } return 0; }