NYOJ 107 A Famous ICPC Team
来源:互联网 发布:2017淘宝黑科技 编辑:程序博客网 时间:2024/05/19 16:21
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
- 样例输出
Case 1: 4 Case 2: 4
- 提示
- 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 <stdio.h>#include <stdlib.h>int comp ( const void *a, const void *b ){ return * ( int * ) a - * ( int * ) b;}int main(){int i=1;int a[4];while (scanf("%d %d %d %d",&a[0],&a[1],&a[2],&a[3]) != EOF){qsort(a,4,sizeof(int),comp);printf("Case %d: %d\n",i,a[2]+a[3]);i++;}return 0;}
0 0
- nyoj-107-A Famous ICPC Team
- NYOJ 107 A Famous ICPC Team
- nyoj 107 A Famous ICPC Team
- nyoj 107 排序问题之A Famous ICPC Team
- NYOJ 107 A Famous ICPC Team【简单题】
- NYOJ-ACM-A Famous ICPC Team
- A Famous ICPC Team
- HDU4247:A Famous ICPC Team
- HDU4247 A Famous ICPC Team
- HDU4247 A Famous ICPC Team
- HDU 4247 A Famous ICPC Team
- nyoj107&&hdu A Famous ICPC Team
- hdoj-4247-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
- Android APP如何防止二次打包
- Python查询天气小程序
- UML之协作图
- Cocos2d-x Scene生命周期 pushScene和replaceScene
- Cracking the coding interview--Q4.8
- NYOJ 107 A Famous ICPC Team
- Cocos2dx-游戏开发中不同的坐标系,cocos2dx锚点
- 超简单的数码相框制作
- “舍友勾搭上我爸还怀孕了!
- linux lib 动态库
- 设计模式之----------------桥接模式
- 双卡双待手机[海信]挂断来电和指定卡去电实现
- 题目1146:Flipping Pancake
- “舍友勾搭上我爸还怀孕了!