CT453

The tickets at Screech Point

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Petra the factor watches over the gull cliffs of Screech Point's stores of tickets. A careful computation stands between order and chaos. 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 <= 35; -100 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 24 -29 -91 -7 -88 -93 -73 -53 10 -72 -84 -15 -93 -94 -78 9 -92 -24 -30 -72 -34 -61 -57 -75 -3
Output: 10

Example 2:

Input: 17 -99 -27 -65 -32 -40 -38 -73 -86 -15 -57 -29 -53 -62 -49 -7 -28 -22
Output: -7

Example 3:

Input: 19 -43 -44 -6 -22 -1 -80 5 10 -69 -20 -15 -31 -16 -36 -78 -7 -70 -71 -80
Output: 10

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.