CT23764

The Lowest Reading at Saffronia

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Ulrica inherited the signal tower at the spice bazaar of Saffronia along with its curious bookkeeping system for ingots. Time to make sense of it. 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 <= 772; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

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

Example 2:

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

Example 3:

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

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Lowest Reading at Saffronia - EASY Coding Problem | CodeTikki