CT25922

Gino's Ancient scrolls

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Deep in the lakeside town of Mirrormere, Gino studies rows of scrolls entries. One clean number will settle the guild's oldest argument. 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 <= 287; -100 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

Example 1:

Input: 81 289700 146432 460962 3392 316609 813936 999314 658430 287973 543872 344993 783445 286431 857930 670066 722981 535124 785695 798868 138895 313129 220185 729572 262509 893032 761180 516541 145043 112069 484402 815843 648522 713205 800458 117771 482397 841339 839836 560187 508564 879930 356993 161381 110165 962976 395281 693780 493255 852253 690899 901044 19494 148471 566555 410610 603725 349571 566917 616138 271139 76167 111137 824452 897500 972131 590448 442795 119097 440187 728247 488422 976777 127188 555681 114915 81679 897173 615202 74947 356078 172634
Output: 3392

Example 2:

Input: 101 40537 593640 830085 787539 11469 128655 519881 955878 184810 795290 454875 998868 160520 727049 830827 956966 483863 321884 636739 856990 959895 291384 334094 779033 134102 243374 816310 578843 22663 933538 751596 717579 58340 373047 527245 697010 643912 54857 385538 291806 344270 708941 818089 746203 1800 898560 679331 346218 946835 829074 585469 274369 593620 499877 818121 705589 339936 444882 956897 360851 682329 122703 114063 154260 449098 106013 439366 93152 668782 456116 742648 457785 761474 521247 593355 551745 773639 911082 81422 646137 671654 455590 244304 968191 869299 988863 468891 350548 204507 557145 955223 531423 913736 695662 957925 441191 752372 977537 999370 406359 977742
Output: 1800

Example 3:

Input: 102 361653 264378 786948 975296 595329 428392 806768 825275 373889 593608 637206 339917 341949 907506 433566 211428 363827 527787 254644 768139 983330 30760 595980 622614 984005 665219 786008 458061 247808 979078 131356 691385 822609 887168 705481 515372 60552 563091 126050 549104 374226 965570 816660 42979 849361 489298 263022 970163 884455 238483 482530 342284 189357 990325 760279 628817 16779 598452 136901 838925 943264 224622 151728 356588 753466 948455 717287 404069 668667 430619 314705 399368 190494 101355 831863 257728 870754 749069 555319 41532 294824 561344 503849 963458 518701 770519 812956 842322 453075 714941 661731 866277 652375 588444 321996 541140 90487 459854 637239 521161 368388 137442
Output: 16779

Constraints:

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

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