CT24604

Elio's Silent Ledger

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Elio inherited the counting house at the mangrove channels of Rootwater along with its curious bookkeeping system for parcels. 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 <= 812; -100 <= a[i] <= 1000; answers fit a signed 64-bit integer.

Example 1:

Input: 647 596 391 969 54 936 641 874 532 532 686 843 834 739 279 31 112 173 599 -9 -39 258 824 392 189 911 305 947 736 282 180 18 965 304 604 292 749 571 544 808 130 445 216 10 18 810 734 866 722 698 637 859 39 997 962 607 761 930 549 354 997 153 555 868 889 764 102 46 897 566 748 946 944 47 -69 459 940 216 240 150 706 856 819 -41 550 729 375 537 63 857 946 133 102 854 641 296 53 913 952 679 196 35 305 277 630 557 839 366 332 397 579 505 330 802 344 -57 920 702 416 483 589 183 214 456 802 503 -100 459 113 970 590 892 583 662 987 733 13 388 684 630 702 764 942 491 -14 -13 632 680 535 91 580 167 851 712 489 59 356 772 490 123 188 164 -94 568 679 53 228 724 460 683 656 466 157 849 205 676 311 169 516 991 307 705 574 -96 977 857 580 80 504 13 651 6 75 234 420 557 701 28 409 770 598 896 510 262 340 -…
Output: 997

Example 2:

Input: 178 670 -87 -19 29 332 757 770 268 559 247 197 912 644 777 106 858 868 321 -83 975 669 916 709 428 374 899 586 96 432 414 634 456 989 -11 792 133 727 741 -38 998 -32 -50 353 830 155 511 461 653 545 804 252 671 986 550 357 750 681 248 799 796 911 -3 737 -7 916 293 835 636 548 370 775 781 697 45 909 963 269 222 777 674 155 463 191 873 436 660 66 61 240 486 383 -44 408 -22 625 74 356 380 276 986 590 450 482 -17 -23 527 149 -36 571 205 788 206 410 902 67 85 833 371 329 27 489 89 541 683 459 831 723 136 739 12 660 158 221 10 744 -67 941 798 641 318 360 603 447 598 354 72 146 310 860 741 163 746 239 935 433 2 154 868 -38 -54 27 90 204 836 787 716 250 810 476 656 285 997 475 213 284 44 968 315
Output: 998

Example 3:

Input: 288 557 915 505 125 592 636 388 -7 993 499 361 654 337 955 -3 155 204 817 105 882 156 -70 87 106 -63 -92 203 464 545 476 897 361 823 90 537 272 778 -21 217 137 407 564 563 352 -14 194 805 581 857 69 975 617 79 722 528 186 157 820 51 18 11 715 -80 90 595 733 256 44 35 -6 887 292 980 153 322 -94 273 928 472 238 965 727 685 121 -41 254 38 71 72 -3 812 465 160 93 973 338 17 -57 -2 103 878 470 387 551 788 333 72 -93 284 126 73 882 612 -74 231 329 868 700 623 800 859 563 677 913 101 245 540 516 -79 599 221 132 -18 53 975 440 754 91 689 333 586 603 -29 299 101 505 497 860 899 170 204 374 673 475 322 -53 308 491 55 114 234 21 874 702 489 246 499 -60 -27 266 694 912 995 635 417 995 264 689 897 93 211 497 503 492 858 847 950 742 -91 488 113 -30 409 261 737 913 479 572 677 801 83 -36 49 681 673 820 6…
Output: 995

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Elio's Silent Ledger - EASY Coding Problem | CodeTikki