Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
20773 | LeoWang | 矩阵加法 | C++ | Accepted | 0 MS | 260 KB | 434 | 2023-06-20 08:20:22 |
#include<bits/stdc++.h> using namespace std; int main() { int m,n; int a[101][101],b[101][101]; int i,j; int similar=0; double result; cin>>n>>m; for(i=1;i<=n;i++) for(j=1;j<=m;j++) cin>>a[i][j]; for(i=1;i<=n;i++) for(j=1;j<=m;j++) cin>>b[i][j]; for(i=1;i<=n;i++) { for(j=1;j<=m;j++) { cout<<a[i][j]+b[i][j]<<" "; } if(j==m) cout<<endl; } return 0; }