题解 | 矩阵计算

#include <stdio.h>

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