题解 | #矩阵计算#
矩阵计算
https://www.nowcoder.com/practice/0c83231923c541d2aa15861571831ee5
#include <stdio.h>
int main() {
int n, m, sum = 0;
int i = 0, j = 0;
int arr[20][20] = { 0 };
scanf("%d %d", &n, &m);
for (i = 0; i < n; i++)
{
for (j = 0; j < m; j++)
{
scanf("%d", &arr[i][j]);
if (arr[i][j] > 0)
sum += arr[i][j];
}
}
printf("%d", sum);
return 0;
}