CT2079

The Peak of the Jasper coins

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Tailor inherited the mill at the archive halls of Scrollkeep along with its curious bookkeeping system for coins. Time to make sense of it. 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 <= 64; 0 <= a[i] <= 1000; answers fit a signed 64-bit integer.

Example 1:

Input: 39 713 41 776 418 564 732 30 836 39 573 186 414 514 735 941 34 525 470 877 624 948 941 138 808 550 313 708 917 353 470 210 150 649 796 897 94 11 866 211
Output: 948

Example 2:

Input: 54 94 130 322 203 153 604 108 531 200 997 33 724 952 517 151 172 917 513 411 720 622 227 994 116 240 875 543 955 944 274 408 865 999 834 61 376 144 774 745 557 981 796 916 494 766 545 348 176 395 185 232 163 633 442
Output: 999

Example 3:

Input: 11 843 927 332 612 350 797 881 610 91 301 498
Output: 927

Constraints:

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

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