HDU4247:A Famous ICPC Team

原创 2013年12月01日 20:40:24
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 <stdio.h>
#include <string.h>
#include <algorithm>
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;
}


 

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU:4251 The Famous ICPC Team Again(划分树)

题意:给一组数字,多次查询求中位数。 思路:划分树。 #include #include #include #include #include #include #include u...

HDU4251 The Famous ICPC Team Again(划分树裸)

题意:长度为n的数列,有m次询问,每次输出区间[l,r]的中位数。 思路:划分树模板套上即可。 #include #include #include #include #inclu...

HDU 4251-The Famous ICPC Team Again(划分树-区间中位数)

The Famous ICPC Team Again Time Limit: 30000/15000 MS (Java/Others)    Memory Limit: 32768/32768 K ...

Hdu 4251 The Famous ICPC Team Again

The Famous ICPC Team Again Time Limit: 30000/15000 MS (Java/Others)    Memory Limit: 32768/32768 K ...

hdu 4251 The Famous ICPC Team Again(划分树裸题)

The Famous ICPC Team Again Time Limit: 30000/15000 MS (Java/Others)    Memory Limit: 32768/32768 K ...

HDU_4251_The Famous ICPC Team Again(划分树)

题型:数据结构 题意:n个数,m次cha

HDU 4251 The Famous ICPC Team Again 划分树

题目:http://acm.hdu.edu.cn/showproblem.php?pid=4251 题意:给定一个数组,求区间中位数,保证给定区间长度是奇数 思路:划分树求区间中位...

hdu 4251 The Famous ICPC Team Again--划分树

/* 求区间中间值 可以转化为求kth值 所以用了划分树 直接套用了上一篇的函数 上篇有讲解 */ #include #include using namespace std; const int ...

hud--4251The Famous ICPC Team Again+划分树入门题

题目链接:点击进入 这次求得是给定区间的中值,所以还是直接可以套划分树的模板。代码如下:#include #include #include #include using namespace std...

HDU 4247 Pinball Game 3D(cdq 分治+树状数组+动态规划)

Pinball Game 3D Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)