关于"对称轴 (Symmetry, ACM/ICPC Seoul 2004, UVa1595"的讨论

要找对称，可以以对称轴为中心，找匹配点，可以用map容器，考虑到坐标是二维的，可以用二维map

#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
map<int, map<int, int> > m;
const int maxn = 100;
int ato[maxn][2];
void main()
{
	int n; 
	int a, b;
	int sum = 0;
	cin >> n;
	for(int i = 0; i < n; i++)
	{	
		cin >> a >> b;
		sum += a;
		m[a][b]++;
		ato[i][0] = a;
		ato[i][1] = b;
	}
	int ave_sum = (sum / n) * 2;

	bool is_find = true;
	for(int i = 0; i < n; i++)
	{
		if(ato[i][0] <= ave_sum)
		{
			if(m[ato[i][0]][ato[i][1]] != m[ave_sum - ato[i][0]][ato[i][1]])
			{
				is_find = false;
				break;
			}
		}
	}
	if(is_find) cout << "Exit" << endl;
	else cout << "No exit" << endl;
}