题解 | #矩阵计算#
矩阵计算
https://www.nowcoder.com/practice/0c83231923c541d2aa15861571831ee5
#include <iostream> using namespace std; int main(){ int n,m,sum=0; scanf("%d %d",&n,&m); int a[n][m]; for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { scanf("%d",&a[i][j]); if(a[i][j]>0) sum+=a[i][j]; } } printf("%d\n",sum); return 0; }