zoukankan      html  css  js  c++  java
  • Uva

    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}
    Joe delivers pallets for Ivan. Joe is not very smart and often makes mistakes -- he brings Ivan pallets that do not fit together to make a box. But Joe does not trust Ivan. It always takes a lot of time to explain Joe that he has made a mistake. Fortunately, Joe adores everything related to computers and sincerely believes that computers never make mistakes. Ivan has decided to use this for his own advantage. Ivan asks you to write a program that given sizes of six rectangular pallets tells whether it is possible to make a box out of them.

    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$wh$ le$10 000) -- width and height of the pallet in millimeters respectively.

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


  • 相关阅读:
    Vue应用框架整合与实战--Vue技术生态圈篇
    SpringBoot2.0之八 多数据源配置
    SpringBoot2.0之七 实现页面和后台代码的热部署
    SpringBoot2.0之六 多环境配置
    SpringBoot2.0之五 优雅整合SpringBoot2.0+MyBatis+druid+PageHelper
    SpringBoot 中常用注解@PathVaribale/@RequestParam/@GetMapping介绍
    @getMapping与@postMapping
    701搜商家电话直通 网络黄页完成“终极使命”
    根据经纬度计算距离
    微网站
  • 原文地址:https://www.cnblogs.com/zhangyaoqi/p/4591619.html
Copyright © 2011-2022 走看看