UVa 1587 Box

标签：acm   uva   紫书   

大水题一发  弄清长方体的几个面的关系就行了

#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;
}

Input 

1w, h10 000

Output 

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

UVa 1587 Box

标签：acm   uva   紫书   

原文地址：http://blog.csdn.net/acvay/article/details/42811867