题解 | #矩阵计算#

#include<stdio.h> 
void Input_arr(int arr[][50], int n, int m)
{
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			scanf("%d", &arr[i][j]);   
		}
	}
} 

void Count_arr(int arr[][50], int n,  int m)
{
	int sum = 0; 
	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); 
}

int main()
{
	int n = 0;
	 int m = 0; 
	int arr[50][50] = { 0 }; 
	scanf("%d %d", &n, &m); 
	Input_arr(arr, n, m); 
	Count_arr(arr, n, m); 

	return 0;
}