CT23692

The scrolls Lowest Reading Puzzle

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Caravans arrive at the savanna camp of Amberplain with crates of scrolls, and Zaid the dispatch writer 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 <= 975; -1000000 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

Example 1:

Input: 740 -910874 -31793 -770286 -866586 997503 610919 847208 485929 923915 840511 132416 -10653 -611115 -825671 739233 504903 -229104 -705065 -43891 782298 -78832 80669 -29844 411906 -145761 -610975 151938 348528 567227 867978 256287 634613 -717402 -416807 590128 925087 964391 281353 -948545 -594773 181362 -163591 363799 641759 -611721 800986 595055 -938791 -363833 847316 -341222 -138106 -549017 -754790 -65884 -417185 -600345 615307 816993 951892 -297355 -502964 -695238 914421 635684 -1689 529923 -42848 -940811 -192209 -561819 852732 426565 -232866 -136727 -591872 951516 575921 -806619 709164 -686161 -478481 -8081 -813572 367770 -494853 785531 -436185 625642 233119 517062 -100950 630874 58686 697590 -747581 -604760 -257776 743704 592904 -883524 -851377 900875 -866404 -654719 -455391 -944818 -54…
Output: -999983

Example 2:

Input: 716 -161 -262909 678391 -722878 -137224 -541208 -876902 46366 173462 -345881 334771 -38729 -517485 -356479 -702378 -179114 289102 -272263 -976629 -250438 456579 -489552 355299 980986 335859 -393071 555783 781094 284821 944840 424234 636634 -397800 -173464 -133471 776603 402756 -65452 726700 81186 -9362 989180 -814036 -827700 439232 860256 -470907 953455 -756568 -390912 442204 -853045 -484293 -926028 -344849 338119 -389491 -667564 -592119 188936 558950 278212 673641 -776469 459518 619102 -136986 878071 816549 499917 971781 -673241 -356715 863837 189487 124774 -785746 -393459 -732311 -153915 -393286 657140 -864398 774708 757125 -685980 -347710 -300665 959193 900027 -750056 557921 -302619 -822431 150599 -633872 -70161 -427317 -850914 -558265 -234620 227297 -908152 810691 418923 -102088 196247…
Output: -994356

Example 3:

Input: 947 497528 -184144 2815 -702061 -887013 -646038 976629 -83976 -236087 -476598 884117 576730 -455550 -928450 904951 351313 -933202 -559271 -787858 -929574 445389 196090 592153 -870759 330767 115374 -270878 126951 -847814 -738847 -908583 756876 926632 877097 472222 597229 79133 620989 -569029 968952 378654 393979 -597165 833245 832936 -992402 -773245 -145849 -579170 904936 -453594 709212 -326169 189483 -621535 219069 514090 583524 632576 -794159 611553 869604 -106131 -392169 -619254 344690 311829 -519369 938666 -589909 419740 -268544 -220921 -387585 657970 -314753 -791744 925755 -187119 -832640 -988249 614307 600923 -611195 -151436 492490 -947352 -838685 47274 -353173 -719967 -129199 341338 6998 -232333 420615 -871819 -53902 -436954 -136942 550575 918156 613809 193979 651392 134714 334291 26…
Output: -998764

Constraints:

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

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