UVA-10763 Foreign Exchange

 这道题 利用set的优势 可以快速解决

#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<string>
#include<cassert>
#include<cctype>
#include<memory.h>
#include<cstdio>
#include<sstream>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<cstdlib>
#define SWAP(X,Y) {int t=X;X=Y;Y=t;}
using namespace std;
set<pair<int, int>> SET;
int main()
{
	int T = 0;
	while (cin >> T&&T)
	{
		int count = 0;	//记录无序序偶的对儿数
		int n = T;	
		SET.clear();
		while (T--)
		{
			int a = 0, b = 0;
			cin >> a >> b;
			if (a > b)
				SWAP(a, b);
			pair<int, int> pii(a, b);
			if (SET.count(pii))
			{
				count++;
				SET.erase(pii);
			}
			else
				SET.insert(pii);
		}
		if (count * 2 == n)cout << "YES" << endl;
		else cout << "NO" << endl;
	}

}