A Famous ICPC Team

A  Famous ICPC Team

                                     Time Limit:1000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

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.

Example

Input: 2 2 2 2
2 2 2 1 Output: Case 1: 4
Case 2: 4

Explanation

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 to rotate or move, you could find the side length of the box must be at least 4.

思路:  其实就是求最长的两个边长之和,

给出四个正方体箱子的边长,问能装下这四个正方体箱子的大正方体边长最小要多大

要边长最小且必须能装下四个箱子,那么这四个箱子肯定要叠放两层,所以边长由最长的两个小正方体边长决定

代码:

#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int x[4];
    int t=1;
    while(cin>>x[0]>>x[1]>>x[2]>>x[3])
    {
        sort(x,x+4);
        cout<<"Case "<<t++<<": "<<x[2]+x[3]<<endl;
    }
    return 0;
}
#include<stdio.h>
#include<stdlib.h>
int cmp(const void *a,const void *b)
{
    return *(int *)a-*(int *)b;
}
int main(){
    int side[4];
    int i=1;
    while(~scanf("%d",&side[0]))
    {
        for(int j=1;j<4;j++)
            {
                scanf("%d",&side[j]);
            }
            qsort(side,4,sizeof(side[0]),cmp);
            printf("Case %d: ",i);
            printf("%d\n",side[2]+side[3]);
            i++;
    }
return 0;
}

A Famous ICPC Team

时间: 2024-10-06 08:01:05

A Famous ICPC Team的相关文章

HDOJ 4251 The Famous ICPC Team Again

划分树水题..... The Famous ICPC Team Again Time Limit: 30000/15000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 859    Accepted Submission(s): 415 Problem Description When Mr. B, Mr. G and Mr. M were preparing for the

HDU 4247 A Famous ICPC Team

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 sui

【HDOJ】4251 The Famous ICPC Team Again

划分树模板题目,主席树也可解.划分树. 1 /* 4251 */ 2 #include <iostream> 3 #include <sstream> 4 #include <string> 5 #include <map> 6 #include <queue> 7 #include <set> 8 #include <stack> 9 #include <vector> 10 #include <deq

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

题目链接:点击进入 这次求得是给定区间的中值,所以还是直接可以套划分树的模板. 代码如下: #include<iostream> #include<cstring> #include<cstdio> #include<algorithm> using namespace std; const int maxn=100000+100; int tree[20][maxn]; int sorted[maxn]; int toleft[20][maxn]; voi

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

Problem Description When Mr. B, Mr. G and Mr. M were preparing for the 2012 ACM-ICPC World Final Contest, Mr. B had collected a large set of contest problems for their daily training. When they decided to take training, Mr. B would choose one of them

ACM ICPC Team

Link: https://www.hackerrank.com/challenges/acm-icpc-team/submissions/code/11617807 1 def count_max_topics(konw_topics): 2 max_topics = 0 3 max_teams = 0 4 for i, person1 in enumerate(konw_topics): # enumer的用法学习 5 for j, person2 in enumerate(konw_top

nyoj 107

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) res

2016 UESTC ACM Summer Training Team Selection (2)解题报告

总体来说,个人英语水平还太蹩脚,此次大部分时间都花在理解题意上了,而且到最后有些题目的意思还是不理解,orz... 链接→2016 UESTC ACM Summer Training Team Selection (2)  Problem A Popular Vote Accept: 0    Submit: 0 Time Limit: 2000 mSec  Problem Description In an election with more than two candidates, it

A - Perfect Team CodeForces - 1221C

You may have already known that a standard ICPC team consists of exactly three members. The perfect team however has more restrictions. A student can have some specialization: coder or mathematician. She/he can have no specialization, but can't have