Ivan works at a factory that produces heavy machinery. He has a simple job -- he knocks up wooden boxes of different sizes to pack machinery for delivery to the customers. Each box is a rectangular parallelepiped. Ivan uses six rectangular wooden pallets to make a box. Each pallet is used for one side of the box.
![\epsfbox{p3214.eps}](https://i-blog.csdnimg.cn/blog_migrate/28fe947457669b3cd52875ac54cec6f7.jpeg)
Input
Input file contains several test cases. Each of them consists of six lines. Each line describes one pallet and contains two integer numbers w and h ( 1![$ \le$](https://i-blog.csdnimg.cn/blog_migrate/27bfea30ea622362befe9405631f3c5e.png)
![$ \le$](https://i-blog.csdnimg.cn/blog_migrate/27bfea30ea622362befe9405631f3c5e.png)
Output
For each test case, print one output line. Write a single word ` POSSIBLE ' to the output file if it is possible to make a box using six given pallets for its sides. Write a single word ` IMPOSSIBLE ' if it is not possible to do so.Sample Input
1345 2584 2584 683 2584 1345 683 1345 683 1345 2584 683 1234 4567 1234 4567 4567 4321 4322 4567 4321 1234 4321 1234
Sample Output
POSSIBLE IMPOSSIBLE
比较水,能确定长方形的判定条件就可以了
AC代码:
#include<cstdio>
#include<algorithm>
using namespace std;
const int N = 6;
struct rec{ int l, w; } r[N];
bool cmp(rec a, rec b)
{
return a.w < b.w || (a.w == b.w && a.l < b.l);
}
int main()
{
int a, b, ok;
while (~scanf("%d%d", &r[0].w, &r[0].l))
{
ok = 1;
if (r[0].w > r[0].l) swap(r[0].w, r[0].l);
for (int i = 1; i < 6; ++i)
{
scanf("%d%d", &r[i].w, &r[i].l);
if (r[i].w > r[i].l) swap(r[i].w, r[i].l);
}
sort(r, r + N, cmp);
for (int i = 0; i < N; i += 2)
if (r[i].w != r[i + 1].w || r[i].l != r[i + 1].l) ok = 0;
if (r[0].w != r[2].w || r[0].l != r[4].w || r[2].l != r[4].l) ok = 0;
puts(ok ? "POSSIBLE" : "IMPOSSIBLE");
}
return 0;
}