CT25109

The Lowest Reading at Bramblecourt

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Caravans arrive at the thorn maze of Bramblecourt with crates of ingots, and Potter the clerk must account for every last one. 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 <= 880; -100 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

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

Example 2:

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

Example 3:

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

Constraints:

1 <= n <= 880; -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 Bramblecourt - EASY Coding Problem | CodeTikki