CT923

Kael Counts the scrolls

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

The registry keeper Kael has been asked to prove the quality of the harvest. On the desk lies a long table of scrolls readings. Task: Read n integers and print the largest value. Input format: First line: n. Second line: n space-separated integers. Output format: Print the maximum value. Constraints: 1 <= n <= 44; -100 <= a[i] <= 1000; answers fit a signed 64-bit integer.

Example 1:

Input: 31 949 -55 914 -98 840 101 115 356 624 710 -33 622 569 6 372 204 131 765 7 577 781 356 186 633 803 491 149 200 799 931 -80
Output: 949

Example 2:

Input: 10 374 459 692 752 945 111 720 859 175 -39
Output: 945

Example 3:

Input: 7 713 -51 557 989 962 112 457
Output: 989

Constraints:

1 <= n <= 44; -100 <= a[i] <= 1000; answers fit a signed 64-bit integer.

Loading...
Test Cases:No test cases
No test cases available.
Kael Counts the scrolls - EASY Coding Problem | CodeTikki