PROBLEM LINK:
Practice : SCHOOL02 Problem - CodeChef
Contest :Contest Page | CodeChef
Author: laks
Editorialist: laks
DIFFICULTY:
CAKEWALK.
PREREQUISITES:
NO.
PROBLEM:
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.
Output:
For each testcase, output in a single line answer given the greatest number among.
QUICK EXPLANATION:
In this, a problem you have to create a program in which you should enter the number and till user wants and it is in array use sorting to find the greatest one.
EXPLANATION:
In this, you have to write code like this first, you have to write while loop for the number of input cases then, you have to enter numbers until test cases come to end and you should enter in the array and by sorting you should find the greatest easily.
SOLUTIONS:
[details=“Setter’s Solution”]
https://www.codechef.com/viewsolution/25771951