#include <bits/stdc++.h>//m=hang n=lie 
using namespace std;
int main()
{
	long long m,n,sa=0,sb=0,sc=0;
	long long a[105][105];
	cin>>m>>n;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<m;j++)
		{
			cin>>a[i][j];
			sa+=a[i][j];
		}
	}
	for(int i=1;i<n-1;i++)
	{
		for(int j=1;j<m-1;j++)
		{
			sb+=a[i][j];
		}
	}
	cout<<sa-sb;
	return 0;
}

思路: 所有元素-中间元素=边缘元素

原题:

我的代码评分明细:

2 comments

  • 1

Information

ID
601
Time
1000ms
Memory
256MiB
Difficulty
2
Tags
(None)
# Submissions
112
Accepted
65
Uploaded By