POJ 2002 Squares (已知正方形对角线两点推另外两点，STL set)

枚举正方形对角线两点，推出另外两点，看在不在 set 里。（set 里 count() 返回整数，且只为 0 或 1 find() 返回迭代器）

#include <iostream>
#include <algorithm>
#include <utility>
#include <set>
using namespace std;

typedef pair<int, int> Point;
const int maxn = 1010;
int x[maxn], y[maxn];
set<Point> pset;

int main()
{
    int n;

    while (cin >> n && n) {
        pset.clear();
        for (int i = 0; i < n; i++) {
            cin >> x[i] >> y[i];
            pset.insert(make_pair(x[i], y[i]));
        }
        int cnt = 0;
        for (int i = 0; i < n; i++) {
            for (int j = i+1; j < n; j++) {
                int mx = x[i] + x[j], dx = max(x[i], x[j]) - min(x[i], x[j]);
                int my = y[i] + y[j], dy = max(y[i], y[j]) - min(y[i], y[j]);
                if ((mx+dy) & 1 || (my+dx) & 1) continue;
                int sg = ((x[i]-x[j]) * (y[i]-y[j]) < 0) ? 1 : -1;
                if (pset.count(make_pair((mx+dy)/2, (my+sg*dx)/2)) &&
                    pset.count(make_pair((mx-dy)/2, (my-sg*dx)/2)))
                    cnt++;
            }
        }
        cout << cnt / 2 << endl;
    }

    return 0;
}