CT26860

The tickets at Willowford

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Every season at the river town of Willowford, someone must outscore the rival chapter. This year the task falls to Isha, armed only with the tickets register. 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 <= 259; -1000000 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

Example 1:

Input: 78 927184 802682 -660487 -354914 -105075 563183 -816436 -696277 -581808 709826 784078 500323 306853 499836 885776 -498564 -728279 -793122 404534 -678705 -472483 -675155 50971 907021 -706508 264352 913549 476793 362951 -981215 -953857 -362011 636400 713928 -597196 483862 -749968 196741 -407730 711084 325959 4302 -817462 -893439 -58217 -20573 -614579 317425 773352 843573 -418742 -236173 -25291 863804 -127598 258960 -268356 206755 -483680 426218 -244859 386926 -321606 -587597 -565226 472759 -996205 -62235 14402 962834 -816352 963321 361095 760387 373327 -172576 576662 903582
Output: -996205

Example 2:

Input: 130 -508922 965399 975037 628561 -628403 -230161 668310 -635305 564154 505742 -504566 -621598 873187 405018 -318499 -639674 493116 -244066 -354808 920835 -957802 669046 -787985 43177 324233 -704693 306761 476659 -61007 -66436 -115744 -15459 -145448 451296 -381704 765968 -11597 -71463 -579668 624488 -446479 840612 677416 230856 291339 337251 -380317 184980 -21341 -995389 -935584 988841 73774 -433456 483461 -884059 -785910 -309977 503842 156210 684505 303250 81165 -7191 743949 -766529 -447383 -415158 100009 317328 689307 623223 165334 489360 294828 -598948 -560615 551496 -716774 -855223 -775154 58765 -239018 623831 340678 -746078 -274823 835889 -443282 963042 19 944090 843044 722162 655211 675514 -306505 -877305 -634622 -150892 -539694 -680126 -596688 -806512 -570429 -571339 450828 602671 45…
Output: -995389

Example 3:

Input: 20 910244 221914 -439222 820667 -76269 -265086 526816 758065 -497936 906766 -829457 -543557 379409 835651 -658452 98363 -230780 409947 -246276 -564768
Output: -829457

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The tickets at Willowford - EASY Coding Problem | CodeTikki