CT1579

Kavya's stamps Lowest Reading

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

In the mining town of Ironvein, Kavya the paymaster keeps careful count of the stamps. Track down a clerical error, every figure matters. 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 <= 38; -100 <= a[i] <= 1000; answers fit a signed 64-bit integer.

Example 1:

Input: 22 817 362 821 827 951 965 51 740 231 619 509 594 991 624 938 251 100 -80 394 570 -77 259
Output: -80

Example 2:

Input: 31 -20 369 439 577 852 -13 891 769 653 85 -54 -16 -51 316 609 284 385 579 871 132 720 787 15 169 649 1000 661 409 880 215 -90
Output: -90

Example 3:

Input: 17 52 165 215 821 928 724 513 541 230 668 925 496 274 541 326 261 901
Output: 52

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Kavya's stamps Lowest Reading - EASY Coding Problem | CodeTikki