Run ID Author Problem Lang Verdict Time Memory Code Length Submit Time
42541 惠子铭 计算矩阵边缘元素之和 C++ Accepted 0 MS 252 KB 303 2024-03-01 15:46:17

Tests(1/1):


#include<iostream> using namespace std; int main(){ int m,n; int sum=0; int num[100][100]; cin >> m >> n; for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ cin >> num[i][j]; if(i==0||j==0||i==(m-1)||j==(n-1)){ sum+=num[i][j]; } } } cout << sum << endl; return 0; }


Judgement Protocol: