CT27469

Yusuf Counts the lanterns

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

The harbor bell rings at the lily shoals of Padmore; Yusuf weighs the day's lanterns manifests and starts the calculations. 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 <= 372; -100 <= a[i] <= 1000; answers fit a signed 64-bit integer.

Example 1:

Input: 62 -10 879 624 223 348 761 894 541 -89 758 908 90 345 318 383 292 21 -18 59 481 161 980 262 403 395 868 588 22 -17 126 286 230 306 886 469 112 109 633 142 717 512 443 817 32 983 855 344 886 713 12 -72 779 282 76 685 -73 -15 -57 711 361 579 415
Output: 983

Example 2:

Input: 166 522 -20 55 338 914 314 601 735 830 845 313 84 548 875 520 589 -30 76 495 -71 312 538 879 476 293 451 782 759 761 475 818 177 701 319 487 380 124 216 -56 -66 527 222 330 962 328 51 967 939 938 642 984 819 321 502 877 866 222 233 651 -41 151 186 249 667 961 -36 173 853 597 214 252 848 946 57 853 393 -59 743 725 184 855 223 601 637 170 738 64 823 541 937 480 92 939 548 468 901 904 189 795 946 800 817 453 674 494 753 279 472 670 725 -10 402 948 597 188 558 519 397 69 750 354 517 990 124 791 557 275 50 623 766 -82 989 609 605 594 814 505 179 365 194 897 617 572 635 359 950 91 190 995 609 310 857 -89 676 304 82 346 163 728 799 408 620 71 690 82 186
Output: 995

Example 3:

Input: 95 682 354 582 355 461 696 262 757 656 469 324 407 573 358 996 123 191 270 -26 680 84 436 769 822 416 946 -72 425 593 632 254 187 550 631 -35 508 986 995 601 132 670 466 264 323 417 865 660 784 53 486 791 44 655 438 139 156 965 531 611 -55 154 77 280 79 694 853 753 777 968 872 411 499 -68 305 108 51 547 326 529 -18 544 496 19 73 571 136 338 619 1000 -88 221 71 356 825 35
Output: 1000

Constraints:

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

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