CT907

Koda's ingots Reckoning

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Deep in the old quarter of Brasshaven, Koda studies rows of ingots entries. One clean number will settle the guild's oldest argument. 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 <= 95; -1000000 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

Example 1:

Input: 85 667989 -340679 169387 77235 641027 -248958 -12368 370725 901264 -491455 -715021 176812 -971635 677089 -827533 -635746 -902810 -347164 740732 -317900 119777 176931 -971886 -668553 175544 -352290 -820420 -302968 -604723 367095 956327 -357179 771865 808195 -679263 -604807 785492 -856754 713119 826297 -636493 -750260 97058 -668372 999721 -697450 -654209 928427 -667935 318245 682362 -306248 299398 -966225 -730137 300732 -312168 -51611 117410 -930 925403 -897314 -63627 -263470 -271140 472623 -278145 -240586 116854 -533829 874210 47781 165895 547285 723665 -892760 727845 165646 -447289 615901 -497622 786638 314171 993795 127424
Output: -971886

Example 2:

Input: 35 -966262 -748804 87060 351751 596533 305201 152263 -786007 -178472 -856224 695791 122625 773874 -173535 -607761 -725879 -40358 -277669 954519 161193 106597 -800856 -303912 808706 -247061 -606319 52977 182269 -52431 793722 559210 -599691 80529 -89478 716485
Output: -966262

Example 3:

Input: 11 -449 -305695 -876824 -951820 -713449 72927 763293 733505 707507 829814 354489
Output: -951820

Constraints:

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

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