CT591

The Lowest Reading of the Amber parcels

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

The harbor bell rings at the kelp forests of Tangledeep; Zaid weighs the day's parcels manifests and starts the calculations. Task: Read n integers and print the smallest value. Input format: First line: n. Second line: n space-separated integers. Output format: Print the minimum value. Constraints: 1 <= n <= 84; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 2 9 8
Output: 8

Example 2:

Input: 59 1 10 6 5 0 6 6 6 7 4 3 1 7 7 4 3 7 9 9 2 7 0 7 3 8 0 6 2 3 1 10 9 5 10 1 0 0 3 2 2 9 8 7 4 0 7 7 10 9 0 9 1 3 3 2 2 8 6 5
Output: 0

Example 3:

Input: 82 8 7 7 1 0 2 1 6 10 8 5 6 8 6 4 5 4 5 2 6 0 5 0 7 1 9 3 1 7 9 2 7 8 8 2 9 7 2 10 7 9 4 9 2 6 9 9 4 0 6 5 1 3 10 7 3 5 2 0 9 2 5 10 9 8 6 0 1 10 1 2 0 0 3 10 0 9 1 6 2 10 7
Output: 0

Constraints:

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

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