UVa 12372 - Packing for Holiday
来源:互联网 发布:位面淘宝txt八零 编辑:程序博客网 时间:2024/05/18 03:41
题目:打包行李,判断是不是能放得下,给你货物的尺寸,箱子为20*20*20尺寸。
分析:简单题。直接判断是不是三维都不超过20即可。
说明:(⊙_⊙)
#include <iostream>#include <cstdlib>#include <cstdio>using namespace std;int main(){int n,x,y,z;while ( cin >> n ) for ( int t = 1 ; t <= n ; ++ t ) {cin >> x >> y >> z;cout << "Case " << t << ": ";if ( x <= 20 && y <= 20 && z <= 20 )cout << "good\n";else cout << "bad\n";}return 0;}
0 0
- UVa 12372 - Packing for Holiday
- 12372 - Packing for Holiday
- UVA 10005 Packing polygons
- UVa 10005 - Packing polygons
- Uva - 1149 - Bin Packing
- UVA 1149 - Bin Packing
- UVA 1149 Bin Packing
- uva 1149Bin Packing
- UVA 1149 Bin packing
- UVA 1149 Bin Packing
- UVA - 1149 Bin Packing
- uva 1149/Bin Packing
- UVA 1149 Bin Packing
- Bin Packing UVA
- UVa-1149 Bin Packing
- Holiday's Accommodatio UVA
- Day20: BACK FOR HOLIDAY
- UVa 102 - Ecological Bin Packing
- MFC sqlserver等操作
- SSL握手过程
- 高效运算
- android 获得屏幕、视图、任务栏、状态栏的高宽以及屏幕的设置
- SSL握手过程详解
- UVa 12372 - Packing for Holiday
- [leetcode] Longest Consecutive Sequence
- leetcode之Minimum Depth of Binary Tree
- #pragma预处理命令
- poj 1129(图的着色问题)
- 怎么把Android手机的通讯录导入到iphone手机中
- ORA-01855: AM/A.M. or PM/P.M. required问题排查与解析
- DH 密钥交换
- 黑马程序员——Java基础语法(上)