题解 | 矩阵计算

#include <stdio.h>

int main()
 {
   int n = 0;
   int m = 0;
   while (scanf("%d %d", &n, &m) == 2)
   {
        int arr[n][m];
        int i = 0;
        int j = 0;
        //储存
        for (i = 0; i < n; i++)
        {
            for (j = 0; j < m; j++)
            {
                scanf("%d", &arr[i][j]);
            }
        }
        int sum = 0;
        //判断
        for (i = 0; i < n; i++)
        {
            for (j = 0; j < m; j++)
            {
                if (arr[i][j] > 0)
                    sum += arr[i][j];
            }
        }
        printf("%d\n", sum);
   }

   return 0;
}