CT25735

Bishop and the Obsidian barrels

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Morning light hits the railway depot of Cinderline as Bishop unrolls the day's manifest of barrels. The tally will decide the next shipment. Task: Read n integers and print the largest value. Input format: First line: n. Second line: n space-separated integers. Output format: Print the maximum value. Constraints: 1 <= n <= 677; -100 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

Example 1:

Input: 209 31498 900397 236628 296851 979601 352399 776349 398323 136835 660430 103855 251221 977127 704668 317018 73192 980975 322119 812948 774988 288191 614407 446996 311738 321340 874834 137061 830217 497310 31465 513080 866496 921610 739217 954576 273841 751038 923583 439758 740085 604781 709282 645096 302577 745967 522003 186051 433965 818408 456949 922334 347478 997946 197438 139880 783838 708591 389399 450942 283450 397694 412069 82670 341356 779625 999684 623874 298441 640233 661381 532966 615823 942437 511458 341329 350377 596078 31100 652910 369139 46374 131665 330852 35751 203918 455928 800318 796841 65980 442821 50867 40145 17645 697563 94415 770997 817425 262707 88365 486103 823009 122589 798205 117302 601391 661079 960521 363621 497815 278721 948439 524150 21579 160340 759238 94105…
Output: 999684

Example 2:

Input: 277 533747 710530 395537 860747 378260 963319 165733 502798 635363 765561 801448 58344 766958 70068 914789 833145 180898 366936 53720 52487 328822 717492 444688 558588 763656 934287 296770 902631 176584 963515 139428 856347 911027 662453 965682 437517 26346 70666 495584 102945 952624 995428 296543 987508 721443 103685 273507 211246 720468 522052 880093 522432 560495 600568 265100 494591 272119 521479 938037 109414 853568 754418 682783 349436 24547 278388 648118 340458 187352 177088 735521 583865 762411 552702 927352 511076 773170 373912 323811 93677 712457 753313 254958 656064 548216 727386 431898 230317 669390 729736 962017 457856 32542 364015 603461 362742 329143 435510 254106 56234 395283 328614 467625 128619 505549 59671 761519 68092 210257 715897 829572 906444 460616 867407 179312 404…
Output: 995428

Example 3:

Input: 194 690815 253977 608735 623984 846278 200507 415020 814510 842618 972594 34674 485707 771657 503531 385984 112184 146577 490409 970352 559242 692288 244426 10186 44363 222031 238643 151164 287193 200390 14612 469782 460664 61929 454267 280910 352599 571751 680445 905376 511766 191162 203976 472240 549194 641427 865660 273815 257522 58802 698078 607900 167074 514858 189921 70508 161536 974141 810760 498865 -14 137445 767660 219025 489993 117924 28373 693013 597424 644338 172477 827618 490442 623738 842826 725593 322998 474989 417168 693572 69557 314575 359684 170798 919820 924995 262858 503504 998345 857736 432641 662282 148810 434654 69217 669258 749901 728054 542213 545238 652795 846259 630676 583957 468038 878817 111538 833064 590154 626195 216398 796393 973788 393151 94656 814401 24470…
Output: 998345

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Bishop and the Obsidian barrels - EASY Coding Problem | CodeTikki