CT1852

The Peak of the Solar ingots

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

It is audit day at the monsoon port of Rainhaven. Theo spreads the ingots records across the table and picks up a sharp pencil. 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 <= 99; -1000000 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.

Example 1:

Input: 6 961913906 535324546 852168229 139348811 71511235 524427685
Output: 961913906

Example 2:

Input: 24 758278914 688006089 974111146 522176026 820272253 643681920 399711743 682860747 496586179 372415691 928982307 376895737 943283337 16544455 64563622 414524436 325852791 655636314 638509837 100344584 380330950 351060824 533719380 777733648
Output: 974111146

Example 3:

Input: 74 803015274 863079241 173293894 991091044 170690552 593140515 304739442 764837335 50049343 995306981 620138050 713264604 385089567 213526347 901030389 308019590 4453242 977269346 178604080 779016382 156345398 296178763 704951106 44156528 844545394 931793999 504760307 445405144 654908794 24727205 316953580 988609592 554441249 893265663 541676541 891890521 944029761 613707039 128416719 517221127 880724091 13485270 688429014 205061332 662586809 124069107 705331872 867000588 631579604 454455650 939423102 585756035 197004919 391679230 530709475 225574652 12483439 305820849 327270664 367757778 25123082 178013565 285223361 283441504 490197960 880510569 284843337 745436051 439700799 56659947 756739818 127682948 402900957 402761880
Output: 995306981

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Peak of the Solar ingots - EASY Coding Problem | CodeTikki