CT2234

Jade scrolls Lowest Reading

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Caravans arrive at the anvil district of Hammerfall with crates of scrolls, and Jatin the cartographer must account for every last one. 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 <= 64; -1000000 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.

Example 1:

Input: 12 158248842 340622701 381858456 821690960 378045820 18174309 349487460 728942638 941415215 267791424 845874289 877693891
Output: 18174309

Example 2:

Input: 64 920345444 199697083 435190813 625667084 157573362 846045487 782637578 434649034 471928868 901610666 675289565 711233673 351696952 259472100 28691279 531165136 261038368 256142841 597087096 14579129 904003455 386213261 302496967 749459613 947370698 395361590 846563870 565384201 937339635 89114596 39373514 881988013 546544750 502968841 313278823 641135578 737078306 104492145 934611273 839345006 425762123 462191684 139314780 244129160 808070502 112216665 679962112 503992793 955744713 116584691 242573536 82887979 801502234 304535604 575477896 160825579 509944407 905660301 91197282 333541040 713318599 467881232 70482004 567451647
Output: 14579129

Example 3:

Input: 36 624860655 150085605 804792649 695535361 68295756 96262903 417802507 464126475 469795896 832150926 902365968 653794698 887407072 940038867 951642266 142555129 260392383 20641347 935313639 136865747 814816875 696481632 827659965 582166441 741064559 346542994 918121016 834050923 712651277 533644323 767748503 214267054 967006071 866776598 340088194 732359915
Output: 20641347

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Jade scrolls Lowest Reading - EASY Coding Problem | CodeTikki