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