Codeforces Round #156 (Div. 2)-A. Greg's Workout_html/css_WEB-ITnose

Greg's Workout

time limit per test

memory limit per test

input

output

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.

Sample test(s)

input

22 8

output

biceps

input

35 1 10

output

back

input

73 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.

div+css3阶梯分页样式

div+css3阶梯分页样式

84

查看详情

解题思路：水题。把所有数据扫一遍，直接计算每种锻炼对应的总次数，找出三者中的最大值所对应的锻炼种类。

AC代码：

#include <iostream>#include <cstdio>#include <algorithm>using namespace std;int main(){//	freopen("in.txt","r",stdin);	int n, k;	while(cin>>n){		int x = 0, xx = 0, xxx = 0;		for(int i=1; i<=n; i++){			cin>>k;			if(i%3==1)  x += k;			else if(i%3==2)  xx += k;			else  xxx += k;		}		int t = max(x, max(xx, xxx));		if(x == t)  cout<<"chest"<<endl;		else if(xx == t)  cout<<"biceps"<<endl;		else  cout<<"back"<<endl;	}	return 0;}