11799 - Horror Dash

Problem Link

import java.util.*;
public class uva11799 {
public static void main(String [] args) {
Scanner scn = new Scanner(System.in);
int n = scn.nextInt();
for(int x = 1; x<=n; x++) {
int no = scn.nextInt();
int max = 0;
for(int y=0; y<no;y++) {
int num = scn.nextInt();
if(num > max)
max = num;
}
System.out.println("Case "+x +": "+max);
}
}
}

Share this

Related Posts

:)
:(
hihi
:-)
:D
=D
:-d
;(
;-(
@-)
:P
:o
:>)
(o)
:p
:-?
(p)
:-s
(m)
8-)
:-t
:-b
b-(
:-#
=p~
$-)
(y)
(f)
x-)
(k)
(h)
cheer