CT24075

Zia's Sable parcels

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Deep in the granite steps of Stonehallow, Zia studies rows of parcels entries. One clean number will settle the guild's oldest argument. 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 <= 235; -100 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 184 -54 -52 -22 -1 -10 -87 -57 -52 -24 -10 -74 -6 -34 -61 -46 -17 3 -46 -87 -92 -55 6 -71 -56 -3 -70 -97 -29 -80 3 -46 -57 -16 -9 6 -22 -31 -82 10 -78 8 -92 -20 10 -58 -3 2 -65 -37 -79 -11 -68 -16 -64 -64 10 -23 -20 -72 2 -6 -48 -78 -93 -7 5 -13 -51 -80 -92 -7 -10 -67 -84 -20 -10 -29 -45 -50 -92 7 -99 -69 -58 -18 -38 -68 -56 -7 -84 -94 5 -77 -84 -91 5 -91 -81 8 -73 -22 -45 -44 -29 -64 -50 -80 -10 -24 -70 -16 -48 -59 -24 -55 -34 -30 9 -97 -85 -45 -88 -86 -14 -60 -69 -54 -15 -76 -41 -67 -36 -73 -86 -76 -8 -74 -65 8 -23 -50 -84 -65 -86 -59 -81 -62 -67 -95 -73 -62 -67 -77 -59 -58 -94 3 -82 -80 -46 -24 -29 -14 -11 -44 -95 -99 -68 -92 5 5 -71 -17 -16 -85 -50 -56 -18 -74 -69 -85 -72 -36 -92
Output: -99

Example 2:

Input: 105 -16 -30 -39 -56 -6 -81 -82 2 -23 -11 -12 2 -81 -49 -19 -54 -53 -25 -75 -17 -1 -23 -47 4 -72 -35 -67 -15 -55 -93 -10 -3 -80 -27 -46 -25 -80 -75 -52 -67 -16 -29 -96 -67 -78 7 -37 -26 -85 -55 -17 -52 -99 -68 -5 -72 -18 -89 -21 -17 -72 -36 -5 -44 -26 -50 -54 -57 -33 -51 -55 0 -80 -89 -5 -95 -81 -31 -80 -37 -2 -32 -94 -9 -34 -76 0 -78 -42 -60 -65 -92 -35 -46 4 -69 -9 4 -36 -58 -12 -85 -83 -100 -25
Output: -100

Example 3:

Input: 51 -45 7 -69 4 -31 8 -20 -81 -99 -46 -84 -91 -74 -92 -43 8 -53 0 -24 -42 -83 -41 -76 -45 -22 -22 -73 -22 -69 -73 -4 -18 -50 -15 -33 -37 -28 -77 4 -33 -84 -93 -30 -45 -51 -47 -97 -16 -71 -90 -26
Output: -99

Constraints:

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

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