HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Repetition (Loops) > problem:


51046 - The biggest number

Guest
• Discussion of problem (8)

Volume problems

• 50528 - Rock-Scissors-Paper
• 50744 - The Smallest Perimeter
• 50808 - Total Distance Traveled
• 50814 - Buying Books from Internet
• 50812 - Total Discount for the clients
• 50832 - Rock Paper Scissors Lizard ...
• 51078 - Max trade
• 51077 - Grades Histogram
• 51046 - The biggest number
• 50867 - Average of the Best Grades
• Reflektimi i pikes
• 50994 - The Most Crowded Station
• 51194 - The difference between max...
• 001. 50385 - From m to n
• 002. 50365 - Sum of the numbers f...
• 002. 50452 - Multiplication Table
• 002. 50554 - nth power of m

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan.

The biggest number

Given comma separated N integers. Find the maximum number.

Input
In the first line N - the number of numbers in sequence (1 <= N <= 1,000) is given. Then, in the second line, the number sequence is provided: ( N numbers. ).
Output
Display the biggest number.

input 1 Input 2
6
1,20,18,5,14,16
8
19,-5,7,4,10,17,2,-2
Output 1 Output 2
20
19

Для отправки решений необходимо выполнить вход.

www.contester.ru