Medal Ranking
题号:NC237409
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
64bit IO Format: %lld

题目描述

When  different  countries  compete  against  each  other  (e.g.,  in  the  Olympics),  they  receive gold/silver/bronze  medals.    The  countries  can  then  be  ranked  in  one  of  two  ways:  by “count” which  is  based  on  the  total  number  of  medals  (regardless  of  the  medal  colors)  or  by “color” which  is  based  on  the  number  of  gold  medals  (and  silver  medals  if  tied  in  gold  medals,  and bronze medals if tied in gold and silver).

Given the gold/silver/bronze medal counts for USA and Russia, you are to determine if USA wins in these two ranking methods.

输入描述:

There is one input line, it consists of 6 integers (each integer between 0 and 500 inclusive); the first  three  integers  represent  (respectively)  the  gold,  silver,  and  bronze  medal  counts  for  USA; the last three integers provide this info for Russia (in same order).

输出描述:

Print one of four messages (count, color, both, none), indicating how USA can win. USA  will  win  by count if  its  total  medal  count  is  higher  than  the  total  for  Russia.    USA  will win bycolorif it has more gold medals than Russia (if tied in gold, then USA must have more silver; if tied in gold and silver, then USA must have more bronze).
示例1

输入

复制
10 5 15 10 1 0

输出

复制
both
示例2

输入

复制
10 5 15 10 6 10

输出

复制
count
示例3

输入

复制
12 5 10 5 20 30

输出

复制
color
示例4

输入

复制
10 0 15 10 5 30

输出

复制
none
示例5

输入

复制
10 5 15 10 5 15

输出

复制
none