A Famous ICPC Team
来源:互联网 发布:调查问卷数据 编辑:程序博客网 时间:2024/06/09 19:47
A Famous ICPC Team
时间限制:1000 ms | 内存限制:65535 KB
难度:2
- 描述
Mr. B, Mr. G, Mr. M and their coach Professor S are planning their way to Warsaw for the ACM-ICPC World Finals. Each of the four has a square-shaped suitcase with side length Ai (1<=i<=4) respectively. They want to pack their suitcases into a large square box. The heights of the large box as well as the four suitcases are exactly the same. So they only need to consider the large box’s side length. Of course, you should write a program to output the minimum side length of the large box, so that the four suitcases can be put into the box without overlapping.
- 输入
- Each test case contains only one line containing 4 integers Ai (1<=i<=4, 1<=Ai<=1,000,000,000) indicating the side length of each suitcase.
- 输出
- For each test case, display a single line containing the case number and the minimum side length of the large box required.
- 样例输入
2 2 2 2
2 2 2 1
- 样例输出
1
2
Case 1: 4
Case 2: 4
Hint:
For the first case, all suitcases have size 2x2.
So they can perfectly be packed in a 4x4 large
box without wasting any space.For the second case,
three suitcases have size 2x2 and the last one is 1x1.
Nomatter how you rotate or move the suitcases, the side
length of the large box mustbe at least 4.
#include <stdio.h>void sort(int a[]) // 选择排序 {int k;for(int i = 0; i < 3; i++){k = i;for(int j = i + 1; j < 4; j++)if(a[k] > a[j])k = j;if(k != i){int t = a[k];a[k] = a[i];a[i] = t;}}}int main(){int a[4],Case = 1;while(scanf("%d%d%d%d",&a[0],&a[1],&a[2],&a[3]) != EOF){sort(a);printf("Case %d: %d\n",Case++,a[2]+a[3]); // 输出结果 }}
- A Famous ICPC Team
- HDU4247:A Famous ICPC Team
- HDU4247 A Famous ICPC Team
- HDU4247 A Famous ICPC Team
- nyoj-107-A Famous ICPC Team
- NYOJ 107 A Famous ICPC Team
- nyoj 107 A Famous ICPC Team
- HDU 4247 A Famous ICPC Team
- nyoj107&&hdu A Famous ICPC Team
- hdoj-4247-A Famous ICPC Team
- NYOJ-ACM-A Famous ICPC Team
- nyoj 107 排序问题之A Famous ICPC Team
- NYOJ 107 A Famous ICPC Team【简单题】
- 杭电OJ第4247题 A Famous ICPC Team
- hdoj_4251The Famous ICPC Team Again
- Hdu 4251 The Famous ICPC Team Again
- hdu 4251 The Famous ICPC Team Again
- HDU 4251 The Famous ICPC Team Again
- 第17周项目-奇数因子
- C++程序设计-第18周"务虚性"总结
- Linux注册系统服务
- u-boot链接分析
- myeclipse快捷键 技巧
- A Famous ICPC Team
- IOS 程序内发邮件
- Struts2的validate验证
- javascript简单判断表单(用户名密码是否为空,密码长度)
- Android中TabHost中实现标签的滚动以及一些TabHost开发的奇怪问题
- 世界各地庆祝玛雅历法“新纪元”开始
- cmd脚本接受传入参数
- 拓展实践:系统函数的调用
- 知识点