eolymp
bolt
Спробуйте наш новий інтерфейс для відправки розв'язків
Задачі

Rice Sack

Rice Sack

Several sacks of rice need to be transported to five Orphanage Houses. The heaviest sack will go to Orphanage House Al-Ameen because it has the most number of orphanges. The lightest will be sent to Orphanage House Mutiara due to the small number of children staying there. Given a row of rice sacks, decide which sack goes to Al-Ameen? \InputFile The first line is an integer that represent the number of case. The following lines have \textbf{5} integers indicating the weights of \textbf{5} rice sacks, each separated by a blank. No sack will have a weight of more than \textbf{100} unit. \OutputFile For each test case, the output contains a line in the format \textbf{Case #x:} followed by a sequence of integers, where \textbf{x} is the case number (starting from \textbf{1}) and an integer that indicates the weight of a rice sack that will go to Al-Ameen.
Ліміт часу 1 секунда
Ліміт використання пам'яті 64 MiB
Вхідні дані #1
4
1 6 10 5 20
5 10 25 3 1
30 15 5 1 8
7 4 20 50 5
Вихідні дані #1
Case #1: 20
Case #2: 25
Case #3: 30
Case #4: 50
Джерело ACM-ICPC Malaysia al-Khawārizmī National Programming Contest 2013 (al-Khawārizmī