思路:逻辑思路不难,就是输入两个矩阵,求它们的和并将它们输出!!如果没有将题目看清楚可能提交n次都报错!!结果一看给的测试数据:就给一个,还有点大!! 这时最好的方法就是再仔细将题目读一遍!!记住:每行后面不能有多余的空格!
好了,不多说了!上代码:
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<stack>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int *array1 = new int[n*m];
int *array2 = new int[n*m];
for (int i = 0; i < n*m;i++) {
cin >> array1[i];
}
for (int i = 0; i < n*m; i++) {
cin >> array2[i];
}
for (int i = 0; i < n*m; i++) {
array1[i] += array2[i];
}
int j = 1;
for (int i = 0; i < n*m;i++) {
cout << array1[i];
if (j % (m) == 0) {
cout << endl;
}
else
cout << " ";
j++;
}
delete[]array1;
delete[]array2;
return 0;
}