CT2222

Emeric's scrolls Reckoning

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

It is audit day at the heron rookery of Longlegs. Emeric spreads the scrolls records across the table and picks up a sharp pencil. 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 <= 46; -1000000 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 27 -987699 -579007 -793126 -263139 -932538 -84208 -468161 -927358 -798779 -832389 -82164 -803426 -170075 -985257 -435320 -483361 -605020 -619267 -744641 -999057 -170227 -973085 -996012 -894674 -465721 -551662 -192258
Output: -999057

Example 2:

Input: 30 -278378 -13134 -9829 -317419 -548839 -469755 -758340 -757666 -370156 -624557 -992639 -740601 -987334 -299085 -389560 -157499 -116327 -98568 -187045 -614817 -121820 -360098 -648227 -398734 -185335 -45440 -89956 -632521 -556749 -159679
Output: -992639

Example 3:

Input: 18 -711669 -993588 -259111 -760019 -512320 -810184 -554771 -467457 -598589 -219210 -634565 -730585 -154525 -280983 -639865 -425825 -296236 -184730
Output: -993588

Constraints:

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

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