CT717

Baker's Twilight ingots

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Baker runs the gallery at the mushroom groves of Fungaldeep. Today the books show a list of ingots, and the numbers must be worked out before sundown. 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 <= 81; -100 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

Example 1:

Input: 17 258222 521150 565920 313895 137122 459881 384802 919105 124067 142272 811988 987646 92774 970999 497195 938576 520995
Output: 92774

Example 2:

Input: 37 754729 663677 284151 185821 903849 560111 262504 218946 815633 373010 451048 49852 784797 877802 304956 714102 730052 193800 433114 442670 829243 940438 475185 91682 195655 822080 833793 701727 679934 505297 356195 686228 809502 9842 892108 266585 293989
Output: 9842

Example 3:

Input: 8 289577 813823 590717 541988 726002 940957 415731 261502
Output: 261502

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Baker's Twilight ingots - EASY Coding Problem | CodeTikki