RICE SACK
Problem Description
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?
Input
The first line is an integer that represent the number of case. The following lines have 5 integers
indicating the weights of 5 rice sacks, each separated by a blank. No sack will have a weight of
more than 100 unit.
Output
For each test case, the output contains a line in the format Case #x: followed by a sequence of
integers, where x is the case number (starting from 1) and an integer that indicates the weight of
a rice sack that will go to Al-Ameen.
Sample Input Output
Sample Input
4
1 6 10 5 20
5 10 25 3 1
30 15 5 1 8
7 4 20 50 5
Sample Output
Case #1: 20
Case #2: 25
Case #3: 30
Case #4: 50
Cara nak selesaikan Problem G ni adalah dengan cari nilai maksimum dari 5 nilai yang diberi.
Solution :
Share this
Related Posts
573 - The Snail Problem Link
import java.util.*;
public class uva573 {
public static void main(String [- ArrayListsumber :
http://stackoverflow.com/
http://abouttr3.blogspot.com/p/arraylist.html
http://w
Algorithm - Programming Development Life Cycle(PDLC)Assalamu'alaikum saya ucapkan kepada pembaca di blog ini. Baiklah hari ini kita akan ke p- 10082 - WERTYUProblem Link
Caranya sangat senang iaitu dengan menggunakan "if-else" statement. S
:)
:(
hihi
:-)
:D
=D
:-d
;(
;-(
@-)
:P
:o
:>)
(o)
:p
:-?
(p)
:-s
(m)
8-)
:-t
:-b
b-(
:-#
=p~
$-)
(y)
(f)
x-)
(k)
(h)
cheer