判断a2*b2 和 a3* b3 是否可以装入a1*b1
逻辑代码基本功,
漏考虑了一点,两种形状都要考虑,而不是如果大小符合第一种,就不考虑第二种形状了,导致WA了,也没有人hack我,估计hack了,也难想到错误
int can(int a1, int b1, int a2, int b2){
return (a1<=a2 && b1<=b2) || (a1<=b2 && b1<=a2);
}
int main()
{
/*
#ifndef ONLINE_JUDGE
freopen ("in.txt" , "r" , stdin);
freopen ("out.txt" , "w" , stdout);
#endif
*/
int a1, b1, a2, b2, a3, b3;
while(cin>>a1>>b1>>a2>>b2>>a3>>b3){
bool ok= (a2<=a1 && b2<=b1) && ((can(a3, b3, a1-a2, b1) || can(a3, b3, b1-b2, a1))) ||
(b2<=a1 && a2<=b1) && (can(a3, b3, b1-a2, a1) || can(a3, b3, a1-b2, b1));
puts( ok ? "YES" : "NO");
}
return 0;
}