All submissions for this problem are available.
Read problem carefully
jien and shong are goods friends and also they love each other. They study regularly with each other. Shong gives the task to jien that he will give you many numbers out of which you will tell the greatest one. Jien wants to win the task to increase love of Shong for him. Can you help Jien love to win
Input: - First line will contain integer N, shows number of input entered. - Each next line contains of a single line of input, single integers till number of input entered N.
For each testcase, output in a single line answer given the greatest number among.
|Time Limit:||5 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, SQL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, R, COB, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.