zoj 2659 Box【水】

#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define PLINE printf("-------------\n")
class Rect{
	public:
		int x, y;
	bool operator ==(Rect&b)
	{
		if(x == b.x && y == b.y)
			return true;
		return false;
	}
};
bool cmp(Rect a, Rect b)
{
	if(a.x != b.x)
		return a.x < b.x;
	else
		return a.y < b.y;
}
int main()
{
	int i;
	Rect rect[6]; 
	while(true){
		for(i=0; i<6; i++){
			if(scanf("%d%d", &rect[i].x, &rect[i].y) == EOF)
				goto X;
			if(rect[i].x > rect[i].y)
				swap(rect[i].x, rect[i].y);
		}
		sort(rect, rect+6, cmp);
		PLINE;
		for(i=0; i<6; i++)
			printf("%d %d %d\n", i, rect[i].x, rect[i].y);
		PLINE;
		if(rect[0] == rect[1] && rect[2] == rect[3] && rect[4] == rect[5] &&
			rect[0].x == rect[2].x && rect[0].y == rect[4].x && rect[2].y == rect[4].y)
			printf("POSSIBLE\n");
		else
			printf("IMPOSSIBLE\n");
	}
	X:
		system("pause");
	return 0;
}