hdoj-4247-A Famous ICPC Team
来源:互联网 发布:windows xp pack2 编辑:程序博客网 时间:2024/05/19 12:41
Problem Description
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.
Input
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.
Output
For each test case, display a single line containing the case number and the minimum side length of the large box required.
Sample Input
2 2 2 2
2 2 2 1
Sample Output
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. No matter how you rotate or move the suitcases, the side length of the large box must be at least 4.
找个正方形把他们装起来,然后最大的加起来就可以了
#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>using namespace std;int main() { int a[4],cas = 1; int x,y,ans; while(~scanf("%d%d%d%d",&a[0],&a[1],&a[2],&a[3])) { sort(a,a+4); printf("Case %d: %d\n",cas++,a[2]+a[3]); } return 0; }
- hdoj-4247-A Famous ICPC Team
- A Famous ICPC Team
- HDU 4247 A Famous ICPC Team
- HDOJ 4247 A Famous ICPC Team
- HDU4247:A Famous ICPC Team
- HDU4247 A Famous ICPC Team
- HDU4247 A Famous ICPC Team
- HDOJ 4251 The Famous ICPC Team Again
- 杭电OJ第4247题 A Famous ICPC Team
- nyoj-107-A Famous ICPC Team
- NYOJ 107 A Famous ICPC Team
- nyoj 107 A Famous ICPC Team
- nyoj107&&hdu A Famous ICPC Team
- NYOJ-ACM-A Famous ICPC Team
- nyoj 107 排序问题之A Famous ICPC Team
- NYOJ 107 A Famous ICPC Team【简单题】
- hdoj_4251The Famous ICPC Team Again
- HDOJ 题目4251The Famous ICPC Team Again(划分树)
- Hibernate的dao接口加实现类
- C# 实现IAccessible学习(二)
- Lowest Common Ancestor
- Linux 用Makefile编译C代码
- QT数据库连接池的实现
- hdoj-4247-A Famous ICPC Team
- 欢迎使用CSDN-markdown编辑器
- 指针数组比较字符串按首字符从小到大排序
- SICP 练习1.43 repeated
- maxLength属性不起作用了?可能是与InputFilter冲突了
- android屏幕适配
- Spring mvc 原理浅析
- LeetCode Fraction to Recurring Decimal
- 赢在职场-WEB全栈开发-1-9 文本样式概览