3-10

#define _CRT_SECURE_NO_WARNINGS 

#include <cstdio>

using namespace std;

int main()
{
    int w[6];
    int h[6];
    while (scanf("%d%d", &w[0], &h[0])){
        for (int i = 1; i < 6; i++)
            scanf("%d%d", &w[i], &h[i]);

        for (int i = 0; i < 6; i++){
            if (w[i] > h[i]){
                int tmp = w[i];
                w[i] = h[i];
                h[i] = tmp;
            }
        }

        // remove duplicates
        int wi[3] = { 0 };
        int hi[3] = { 0 };
        int k = 0;
        for (int i = 0; i < 6; i++){
            for (int j = i + 1; j < 6; j++){
                if (w[i] > 0 && w[i] == w[j] && h[i] == h[j]){
                    wi[k] = w[i];
                    hi[k] = h[i];
                    k++;
                    w[i] = w[j] = h[i] = h[j] = -1;
                    break;
                }
            }
        }

        //printf("### %d %d %d %d %d %d\n", wi[0], hi[0], wi[1], hi[1], wi[2], hi[2]);

        if (wi[0] == 0 || wi[1] == 0 || wi[2] == 0){
            printf("IMPOSSIBLE\n");
            continue;
        }

        for (int i = 0; i < 3; i++){
            for (int j = 0; j < 3; j++){
                if (wi[i] > 0 && i != j && wi[i] == wi[j]){
                    wi[i] = wi[j] = -1;
                }
                if (wi[i] > 0 && i != j && wi[i] == hi[j]){
                    wi[i] = hi[j] = -1;
                }
                if (hi[i] > 0 && i != j && hi[i] == hi[j]){
                    hi[i] = hi[j] = -1;
                }
            }
        }

        //printf("### %d %d %d %d %d %d\n", wi[0], hi[0], wi[1], hi[1], wi[2], hi[2]);

        bool possible = true;
        for (int i = 0; i < 3; i++){
            if (wi[i] != -1 || hi[i] != -1){
                possible = false;
                break;
            }
        }

        if (possible)
            printf("POSSIBLE\n");
        else
            printf("IMPOSSIBLE\n");

    }

    return 0;
}

 

转载于:https://www.cnblogs.com/patrickzhou/p/5705270.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值