CT22026

The Lowest Reading at Grapehollow

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

The council of the terraced vines of Grapehollow pays by the answer, and Tracker intends to earn it. First: the full register of coins. 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 <= 576; -100 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 186 -52 -42 -52 -7 -35 -11 -61 -84 -100 -16 -52 -67 6 -94 -99 -14 -25 6 -70 -86 -39 -38 -27 -93 -56 -4 -43 -94 -98 2 -31 -45 -29 -34 -5 -18 -69 -19 -82 -54 -29 -98 -82 -68 -35 -37 -18 -26 -51 -95 -45 -30 -74 5 -100 -98 -11 5 -43 -52 -77 -6 -34 -19 -36 -52 -27 -40 -41 -26 -16 -9 -27 0 8 -2 -67 -92 2 -78 -29 -50 5 -1 -47 -89 -36 -82 -25 -49 -26 -98 -67 -92 -4 -70 -68 6 -37 -81 -80 -15 -39 -70 -8 -5 -8 -90 -37 -2 -84 -3 -50 -16 -53 7 -36 -54 -12 -91 -88 1 10 -26 -36 -99 -60 -10 -38 -44 -81 -69 5 9 -96 -41 -75 -50 -66 -13 -57 -67 -64 -58 -99 -24 -33 -24 -25 -8 -47 -17 -14 9 -12 -86 -66 -18 -17 -1 -85 -95 -79 -66 -23 7 -8 2 -1 -39 -42 -96 -29 -74 -52 -2 -62 -7 10 -32 -93 -39 -30 -7 -69 -42
Output: -100

Example 2:

Input: 296 -39 -36 -1 -90 -49 -88 -98 -61 -14 3 -35 8 -10 -74 -18 -41 -94 -51 -30 -99 -82 -91 -65 -92 -70 -63 -75 0 1 -18 -84 -25 -91 -94 -34 10 -57 -46 -96 -25 -29 -50 -87 -63 -37 -21 -32 10 -90 -56 -62 -86 6 -56 -19 -55 -34 -56 9 -9 -44 -81 -3 -10 8 -13 -25 -29 -59 -80 -61 -30 -82 -35 -90 -58 -65 -59 0 -62 -16 -59 -86 -99 -73 -47 -100 -73 -44 -76 -59 8 -70 -20 -36 -42 -32 -67 -68 -37 -41 -90 -5 -75 -54 -85 -59 -75 -89 -82 -31 -33 -78 -16 -2 -49 -1 -18 -75 -67 -27 -83 -29 -60 -23 -71 -51 -9 8 -43 -29 -89 -99 -75 0 -13 -17 -69 5 -28 -41 4 -56 -71 -72 -20 -60 -81 -32 -38 -72 10 -83 -30 -78 -79 -93 -6 -44 -48 -58 -83 -39 -5 6 -53 3 -82 -63 -82 -18 -39 -94 -57 -94 -42 -65 -30 -47 -90 -18 -42 -51 -72 1 -64 -60 -31 -51 -42 -2 0 -96 -87 -14 -40 -6 -67 -82 -26 -37 -16 -58 -54 -54 7 -56 -74 -56 -9 -4 -98…
Output: -100

Example 3:

Input: 550 -52 -63 -44 -57 -4 -60 -58 1 -61 -82 -62 -23 1 -66 -96 -53 -72 -49 -99 -25 -27 -92 4 -78 -73 0 -52 -4 -39 -45 -76 0 -56 -52 5 -38 -31 -33 -12 -6 -38 -40 -42 -27 -10 -89 -69 -74 -38 4 -17 -65 -52 -24 -32 -18 -58 -92 -35 -78 6 -54 -100 -87 -95 -44 -33 -2 -68 -25 -68 -5 -90 -92 -63 -88 -15 -61 -100 -12 -57 -72 5 -32 -87 -91 8 -59 -67 -33 1 -7 -36 5 -55 -91 -35 -97 -20 -90 -2 -72 -62 -10 -95 -40 4 -7 9 -3 -94 -62 -87 -45 -45 -69 -15 3 0 -34 -28 -23 -39 -78 8 -32 -57 -58 9 -28 -14 -34 -98 -96 -73 -16 -94 -26 -48 -62 -7 -80 -42 1 -46 -92 -69 -14 -46 -53 -64 -3 -37 -59 -64 -66 -53 -8 -10 -7 -32 -73 7 -44 -83 -21 -28 -94 -81 -23 -63 -45 -81 -70 5 -3 -42 -92 -58 -14 -56 -4 -92 -43 -80 -72 -96 -59 -22 -28 -83 -58 10 -36 -75 -41 -100 -91 -35 -62 -85 -67 -23 -37 -36 -49 -66 -11 10 -56 -83 -59 -57 …
Output: -100

Constraints:

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

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