题解 | #矩阵计算#
矩阵计算
http://www.nowcoder.com/practice/0c83231923c541d2aa15861571831ee5
n,m = map(int, input().split())
k = []
num = 0
for i in range(n):
k.append(input().split())
for x in range(n):
for y in range(m):
if int(k[x][y]) > 0:
num += int(k[x][y])
else:
continue
print(num)
