Gym_100971G_Repair
来源:互联网 发布:木工画图软件 编辑:程序博客网 时间:2024/06/03 22:46
Alex is repairing his country house. He has a rectangular metal sheet of size a × b. He has to cut two rectangular sheets of sizes a1 × b1 and a2 × b2 from it. All cuts must be parallel to the sides of the initial sheet. Determine if he can do it.
The first line contains two space-separated integers a and b (1 ≤ a, b ≤ 109) — the sizes of the initial sheet.
The second line contains two space-separated integers a1 and b1 (1 ≤ a1, b1 ≤ 109) — the sizes of the first sheet to cut out.
The third line contains two space-separated integers a2 and b2 (1 ≤ a2, b2 ≤ 109) — the sizes of the second sheet to cut out.
Output «YES» (without quotes), if it's possible to cut two described sheets from the initial sheet, or «NO» (without quotes), if it's not possible.
12 2014 75 6
YES
12 2011 920 7
NO
题意:
给你一个a*b的矩形,问你能否在其中割取a1*b1和a2*b2的两个矩形
解:
一共有8中情况,每种情况考虑到了就能写了。一开始思路不太清晰,导致WA了三次。
代码:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;bool judge(int x1,int y1,int x2,int y2,int a,int b){ if(x1<=a&&y1<=b) { if(x1+x2<=a&&max(y1,y2)<=b) return true; if(y1+y2<=b&&max(x1,x2)<=a) return true; if(x1+y2<=a&&max(y1,x2)<=b) return true; if(y1+x2<=b&&max(x1,y2)<=a) return true; } return false;} //默认a为长边,b为短边,就有8种情况,画一下图就都懂了。int main(){ int a,b; int a1,b1,a2,b2; while(~scanf("%d%d",&a,&b)) { int temp=min(a,b); a=max(a,b); b=temp; scanf("%d%d",&a1,&b1); scanf("%d%d",&a2,&b2); temp=min(a1,b1); a1=max(a1,b1); b1=temp; temp=min(a2,b2); a2=max(a2,b2); b2=temp; if(judge(a1,b1,a2,b2,a,b)||judge(b1,a1,a2,b2,a,b)) printf("YES\n"); else printf("NO\n"); } return 0;}
- Gym_100971G_Repair
- 前端开发编译器 ps:少年你需要一把称手的兵器
- 机器学习:你需要多少训练数据?
- linux下 mysql5.7没有innodb引擎
- 【笔记】神经网络(一)
- poj 2373 Dividing the Path
- Gym_100971G_Repair
- 数据库SQL优化大总结
- c++实验六
- AngularJs基础
- [leetcode]464. Can I Win
- Android 判断是否能真正上网(避免连入wifi无网的状态)
- C#通过读取配置文件里的内容连接数据库
- 我对于iOS的KVO的理解基于Objective-C
- 【Lucene&&Solr】Windows搭建solr服务器