题解 | #矩阵计算#

#include <stdio.h>
#define N 11
#define M 11

int main()
{
    int n = 0;
    int m = 0;

    while (2 == scanf("%d %d", &n, &m))
    {
        int sum = 0;
        int arr[N][M] = {0};

        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                scanf("%d", &arr[i][j]);
                if (arr[i][j] > 0)
                {
                    sum += arr[i][j];
                }
            }
        }
        printf("%d\n", sum);
    }

    return 0;
}