3-10 box, ACM/ICPC NEERC 2004, UVa 1587

#include <iostream>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
int main()
{
	int x, y;
	while (1)
	{
		int is_ok = 1;
		map<int, int>nums;
		pair<int, int>p[6];
		for (int i = 0; i < 6; ++i)
		{
			if (!(cin >> x) || !(cin >> y))
				return 0;
			if (x > y)
				swap(x, y);
			++nums[x], ++nums[y];
			p[i] = make_pair(x, y);
		}
		sort(p, p + 6);
		if (nums.size() > 3)
		{
			is_ok = 0;
		}
		else {
			for (auto elem : nums)
			{
				if (elem.second % 4 != 0)
					is_ok = 0;
			}
		}
		if (p[0].second != p[4].first || p[2].second != p[4].second)
			is_ok = 0;
		if (is_ok == 0)
			cout << "IMPOSSIBLE" << endl;
		else
			cout << "POSSIBLE" << endl;
	}
}