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