CT852

The Lowest Reading Beneath Needlepoint

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Morning light hits the pine barrens of Needlepoint as Amara unrolls the day's manifest of lanterns. The tally will decide the next shipment. 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 <= 29; -1000000 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.

Example 1:

Input: 11 378530953 780821281 928970045 136448669 173138158 570737136 402476398 869183880 773757060 674352170 850461843
Output: 136448669

Example 2:

Input: 21 229458984 812459381 703964428 423057897 244171040 737430215 740745124 58415248 822399250 787850878 36086636 293923023 506495906 463345079 130209748 387328986 371304719 597319939 513326386 282318050 613102096
Output: 36086636

Example 3:

Input: 1 424817583
Output: 424817583

Constraints:

1 <= n <= 29; -1000000 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.

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