CT25454

Diya and the Windward parcels

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Legend says the vault under the wheat plains of Amberfield opens only for a perfect tally of parcels. Diya means to find out. 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 <= 406; -1000000 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 290 -219148 -756699 -761649 -456741 -868570 -494691 -745711 -909590 -684841 -520421 -34448 -803104 -602767 -349010 -21615 -547300 -255548 -213682 -344948 -90932 -295532 -413045 -488558 -356068 -607742 -995034 -359308 -97805 -597857 -853977 -189633 -57447 -734435 -549153 -97203 -983344 -446047 -226052 -34517 -330701 -328967 -143948 -495343 -443036 -613147 -86396 -616737 -909511 -104082 -112264 -971878 -49917 -725511 -755911 -137674 -380503 -372579 -164326 -820651 -352123 -839387 -992290 -246143 -297095 -780637 -416003 -967758 -154510 -307829 -205410 -275221 -883973 -977901 -766095 -700502 -471581 -478492 -539218 -964031 -994927 -934768 -784988 -540609 -602855 -901711 -766036 -224169 -550898 -142444 -395868 -591798 -311411 -973470 -113224 -684747 -429467 -674563 -797090 -783566 -341728 -3136…
Output: -999307

Example 2:

Input: 251 -912323 -961863 -537043 -620522 -82143 -893843 -873828 -767757 -157537 -317389 -982725 -919303 -640364 -936466 -891299 -444153 -122436 -169776 -752081 -480564 -420043 -785621 -419315 -441465 -954526 -843999 -739327 -290882 -345536 -348874 -22872 -428587 -815524 -536248 -801442 -801641 -991034 -316486 -833061 -480464 -272836 -974557 -435140 -219502 -581273 -524960 -193733 -752187 -916124 -732570 -136833 -724644 -70557 -578741 -401845 -119767 -741665 -626014 -404617 -182120 -878750 -939056 -877631 -91609 -88758 -15340 -339849 -931417 -600220 -490754 -439481 -777873 -814495 -305752 -293014 -263589 -273034 -305586 -579970 -936344 -436090 -695174 -971634 -119861 -975066 -730334 -395841 -241798 -953776 -980274 -402822 -10765 -597843 -958581 -766418 -355734 -161850 -769875 -609755 -1406 -6896…
Output: -997655

Example 3:

Input: 283 -517776 -42478 -825312 -726448 -681132 -126945 -97900 -120673 -246937 -364078 -896798 -398990 -701084 -341314 -464674 -598597 -400207 -43999 -728895 -708347 -743274 -645824 -851291 -549911 -632699 -987625 -783310 -83612 -540134 -560776 -347269 -19620 -730074 -278590 -149954 -409299 -339230 -46345 -657760 -591995 -927696 -779358 -509295 -800118 -331622 -177113 -372858 -61313 -465342 -544348 -731155 -961635 -287891 -876156 -215628 -605906 -568480 -298649 -889423 -495241 -428761 -752119 -148976 -342498 -690543 -456697 -384531 -78941 -21127 -444129 -282508 -181287 -605366 -5589 -162572 -196979 -159709 -165235 -556907 -719972 -365136 -957071 -746843 -986648 -846461 -363651 -386154 -981749 -862533 -821441 -560888 -75507 -380474 -312538 -767349 -181556 -841908 -758083 -692098 -448568 -786868 …
Output: -993654

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.