codeforces 255A Greg's Workout

最新推荐文章于 2021-11-11 10:23:15 发布

原创最新推荐文章于 2021-11-11 10:23:15 发布 · 344 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#水题

ACM算法_水题专栏收录该内容

76 篇文章

订阅专栏

本文介绍了一个简单的算法，用于分析一项特定的肌肉锻炼计划。通过输入一系列整数来表示每种类型的锻炼重复次数，该算法确定了哪部分肌肉将获得最多的训练。

点击打开链接

Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was n integers a1, a2, ..., an. These numbers mean that Greg needs to do exactly n exercises today. Besides, Greg should repeat the i-th in order exercise ai times.

Greg now only does three types of exercises: "chest" exercises, "biceps" exercises and "back" exercises. Besides, his training is cyclic, that is, the first exercise he does is a "chest" one, the second one is "biceps", the third one is "back", the fourth one is "chest", the fifth one is "biceps", and so on to the n-th exercise.

Now Greg wonders, which muscle will get the most exercise during his training. We know that the exercise Greg repeats the maximum number of times, trains the corresponding muscle the most. Help Greg, determine which muscle will get the most training.

Input

The first line contains integer n (1 ≤ n ≤ 20). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 25) — the number of times Greg repeats the exercises.

Output

Print word "chest" (without the quotes), if the chest gets the most exercise, "biceps" (without the quotes), if the biceps gets the most exercise and print "back" (without the quotes) if the back gets the most exercise.

It is guaranteed that the input is such that the answer to the problem is unambiguous.

        Examples
      
          input
        
2
2 8

          output
        
biceps

          input
        
3
5 1 10

          output
        
back

          input
        
7
3 3 2 7 9 6 8

          output
        
chest

Note

In the first sample Greg does 2 chest, 8 biceps and zero back exercises, so the biceps gets the most exercises.

In the second sample Greg does 5 chest, 1 biceps and 10 back exercises, so the back gets the most exercises.

In the third sample Greg does 18 chest, 12 biceps and 8 back exercises, so the chest gets the most exercise.

水题，不多说了。

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    scanf("%d",&n);
    int w1=0,w2=0,w3=0,x;
    for(int i=1;i<=n;i++)
    {
    	cin>>x;
    	if(i%3==1)
    		w1+=x;
    	else if(i%3==2)
    		w2+=x;
    	else
    		w3+=x;
    }
    if(w1>w2&&w1>w3)
    	cout<<"chest"<<endl;
    else if(w2>w1&&w2>w3)
    	cout<<"biceps"<<endl;
    else
    	cout<<"back"<<endl;
    return 0;
}