| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 1024 MB | 324 | 240 | 218 | 72.667% |
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.
The first input line contains a positive integer, n, indicating the number of data sets to check. The sets are on the following n input lines, one set per line. Each set 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 each input set. Then, on the next output line, 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 by color if 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). Leave a blank line after the output for each test case.
5 10 5 15 10 1 0 10 5 15 10 6 10 12 5 10 5 20 30 10 0 15 10 5 30 10 5 15 10 5 15
10 5 15 10 1 0 both 10 5 15 10 6 10 count 12 5 10 5 20 30 color 10 0 15 10 5 30 none 10 5 15 10 5 15 none