CT25420

The Moonlit barrels of Arjun

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Every season at the fox den of Rustwood, someone must win the guild's seasonal contest. This year the task falls to Arjun, armed only with the barrels register. Task: Read n integers and print their total sum. Input format: First line: n. Second line: n space-separated integers. Output format: Print the sum of all n values. Constraints: 1 <= n <= 385; 0 <= a[i] <= 1000; answers fit a signed 64-bit integer.

Example 1:

Input: 254 557 360 440 218 208 907 303 480 21 651 487 141 610 0 931 672 759 928 282 869 451 525 667 133 1 117 809 628 7 848 606 49 367 319 945 549 427 152 846 214 966 600 391 230 380 568 4 619 845 413 783 464 317 76 993 282 923 321 522 789 449 565 624 469 459 330 300 448 522 174 911 926 815 35 651 27 114 238 260 539 511 507 988 556 718 38 146 823 437 826 177 845 220 142 791 452 692 624 516 977 915 365 672 447 887 43 438 860 362 278 429 527 389 759 492 925 298 145 510 160 62 934 456 94 793 32 318 845 617 363 644 830 894 87 44 609 553 513 438 966 406 243 509 653 229 758 328 80 816 762 671 565 393 683 366 118 73 466 316 812 683 903 599 366 779 58 280 543 773 949 147 383 527 351 749 980 680 994 677 243 261 826 148 884 143 126 91 823 342 983 45 500 420 109 808 146 499 855 323 469 84 382 132 751 466 93…
Output: 125567

Example 2:

Input: 299 465 168 517 150 373 347 185 40 340 534 840 424 275 254 90 768 651 928 372 856 998 229 667 43 862 191 869 833 323 252 833 155 400 650 74 382 472 882 229 403 231 34 979 325 10 739 317 851 125 713 649 223 979 720 512 541 166 16 829 152 28 182 62 181 704 51 817 627 453 646 722 50 602 186 287 440 597 644 176 366 346 928 338 266 869 419 574 512 43 491 923 90 415 1 581 227 626 720 151 14 34 161 365 323 865 650 417 701 61 491 253 192 999 529 538 463 273 492 627 147 704 5 645 420 919 622 292 121 940 798 966 46 550 79 749 75 406 437 514 793 427 829 732 390 829 620 452 541 288 832 187 22 759 923 51 862 55 79 357 456 745 717 586 319 499 186 635 10 866 958 471 231 807 384 198 602 67 759 815 15 631 604 648 915 143 290 582 980 544 250 690 798 688 649 863 391 917 880 429 43 25 484 291 557 328 230 132 …
Output: 145651

Example 3:

Input: 67 409 980 576 127 648 162 656 985 610 735 840 341 815 369 913 756 121 579 452 65 655 937 983 126 149 587 297 219 954 685 888 626 45 200 375 699 207 615 115 229 181 375 837 598 849 756 416 308 463 859 242 677 579 550 315 371 919 412 575 176 896 400 894 245 691 301 75
Output: 34690

Constraints:

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

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