acm第五次训练-box

最新推荐文章于 2020-02-18 20:00:46 发布

jackcily

最新推荐文章于 2020-02-18 20:00:46 发布

阅读量370

点赞数 1

分类专栏： acm

acm 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

box-acm

//这题我是转载的，思想很不错原文出处如下

http://blog.csdn.net/u011497948/article/details/48735993

//我自己的理解

#include<cstdio>
#include<algorithm>
using namespace std;
const int C = 10001;
int p[7];
void swap(int &x, int &y)
{
   int t = x;
x = y;
y = t;
}
int x, y;
int main()
{
   while (scanf("%d%d", &x, &y) == 2)
   {
       if (x>y)swap(x, y);
           p[0] = x*C + y;
           for (int i = 1; i <= 5; i++)
           {
               scanf("%d%d", &x, &y);
               if (x>y)swap(x, y);
               p[i] = x*C + y;
           }
       sort(p, p + 6);
       bool f = false;
       if (p[0] == p[1] && p[2] == p[3] && p[4] == p[5])
       {
           if (p[0] / C == p[2] / C)
           {
                if ((p[0] % C == p[4] / C&&p[2] % C == p[4] % C) || (p[0] % C == p[4] % C&&p[2] % C == p[4] / C))
               {
                   printf("POSSIBLE\n");
                    f = true;
               }
           }

       }
       if (!f)printf("IMPOSSIBLE\n");
   }
   return 0;
}