CT25075

Dorian's Lowest Reading Ledger

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

At the singing sands of Echo Dunes, Dorian records each coins in a worn leather ledger. The guild wants answers, not guesses. 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 <= 383; -100 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 111 -35 -80 -75 6 -5 -15 -43 -38 -21 -19 3 -91 -85 -69 -93 7 -52 -60 -9 -78 -35 -14 -20 -91 -34 -83 -78 -40 -90 -30 -89 -95 -61 -8 -39 -4 -81 -41 -99 -40 -17 -41 -86 -80 2 -83 -44 -19 -95 -1 -50 -44 -20 -89 -59 -84 2 -21 -89 -28 -75 -12 -27 -87 -5 8 -90 -28 -61 -81 -46 -5 -3 -65 -4 -45 2 -63 -52 -9 -20 -52 -20 2 -51 -35 -85 -99 -44 -95 -50 -8 -27 -96 -52 -88 -16 -74 -65 -52 2 -10 -64 -100 -26 -59 -70 -2 -11 -15 -6
Output: -100

Example 2:

Input: 331 -25 -21 -71 -18 -82 -84 -26 0 -100 -89 -10 -3 -99 -89 -11 -94 -42 -64 -88 -35 -98 -71 2 1 -53 -53 -1 -51 -10 -83 -52 5 -68 -71 -72 -93 -99 9 -30 5 -49 -45 -44 -55 -58 -52 -83 -32 -50 -34 -38 -39 5 -62 -39 -53 -88 -2 -77 -37 -78 -28 -36 -27 -96 -56 -79 -11 -97 -61 5 -46 -1 -26 -30 -27 4 -54 -76 -86 -72 -89 8 7 -95 -36 -70 -37 -28 -33 -18 -69 10 -45 -100 -54 -66 -73 -9 -32 -5 -21 -11 -30 -3 -50 6 -4 -71 -16 -78 -7 -74 4 -33 -93 -52 -86 -45 -30 -68 -79 -82 -46 -96 -67 -25 -44 -99 -75 -55 -97 -88 -98 -99 5 -93 -55 -61 -86 -36 5 -24 -37 -73 -31 -25 4 -9 -58 -81 -28 9 -24 -80 -40 -89 -71 -69 4 -93 -96 -31 -72 -37 -54 -19 -18 5 -20 10 6 -39 2 -80 -22 -63 -87 -84 -45 -22 -72 -50 -91 -97 -16 -57 -66 5 5 -75 -78 -12 -99 -95 2 -89 0 -20 -55 -94 -13 -70 -74 -95 -45 -10 6 -59 -29 4 -41 -51 -6 -85 -…
Output: -100

Example 3:

Input: 294 -79 -100 -49 -97 -84 -28 -12 -75 -83 -52 9 -70 -97 8 -64 -46 -55 -86 2 -52 -39 -79 -85 -74 -3 -91 -78 -57 -73 -67 4 -4 -97 -28 -63 -25 2 -56 -46 -15 -30 -76 3 -100 -73 -53 -13 -68 -58 -81 -81 -26 -68 -46 -1 2 -9 -75 -89 -20 -30 -14 -7 -70 -15 -46 -69 -99 -14 -70 -27 -24 -70 -18 -39 -86 -88 -42 -90 -45 -26 -22 -27 -100 -56 -29 -18 -13 -89 -56 -58 -17 -31 -7 -79 -89 -79 -51 -25 -23 -16 -72 -80 -33 -48 -18 -44 -77 -66 -3 6 -34 -51 1 -84 -99 -38 -82 -12 0 -78 -8 -69 -31 -88 -12 -66 -93 -67 -39 -95 -75 -17 -2 -67 -41 -10 -77 -1 -28 -14 10 -60 -93 -39 8 -68 -38 -48 -96 -12 -69 2 6 -3 -94 -3 -97 -47 -56 -13 -58 -62 -29 -45 -42 -29 -49 -90 -88 -50 -51 -8 -91 -83 -40 -15 -89 -66 -67 -43 -59 -94 -48 0 -63 -15 -67 -33 -3 2 -10 -6 -28 6 5 -15 -27 -35 -17 -22 -72 -74 0 -90 -7 -88 -13 -10 -36 -100 -…
Output: -100

Constraints:

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

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