CT939

Violet scrolls Reverse Order

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

It is audit day at the observatory of Starfall. Farmer spreads the scrolls records across the table and picks up a sharp pencil. Task: Read n integers and print them in reverse order. Input format: First line: n. Second line: n space-separated integers. Output format: Print the n values in reverse order, space-separated. Constraints: 1 <= n <= 65; -100 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

Example 1:

Input: 63 688717 990235 870067 405568 263023 584667 573346 503438 910265 78644 941991 750080 845372 27480 679922 4436 924073 954030 317222 193226 643745 919071 224539 128869 770934 727739 347561 849006 36919 110777 953808 878303 109031 197979 140545 275417 172080 800460 556346 957618 597777 162611 573423 108834 784491 468016 882562 644738 83678 389832 676901 64482 69582 893243 332869 896046 74628 801502 786859 931676 592832 268269 312627
Output: 312627 268269 592832 931676 786859 801502 74628 896046 332869 893243 69582 64482 676901 389832 83678 644738 882562 468016 784491 108834 573423 162611 597777 957618 556346 800460 172080 275417 140545 197979 109031 878303 953808 110777 36919 849006 347561 727739 770934 128869 224539 919071 643745 193226 317222 954030 924073 4436 679922 27480 845372 750080 941991 78644 910265 503438 573346 584667 263023 405568 870067 990235 688717

Example 2:

Input: 64 678279 367513 201639 363858 753689 880627 146011 969420 134280 353869 603955 492278 581392 512232 416903 946392 750650 461464 719713 999968 150468 19378 504291 331522 554362 934072 655755 280205 245141 407466 443158 619364 610128 27035 701906 611571 84749 465340 156037 934740 489460 493817 43428 466985 849138 223236 278006 212701 46743 990431 78628 580472 797512 913535 587600 449386 510495 65925 554800 805492 448334 519024 433433 792799
Output: 792799 433433 519024 448334 805492 554800 65925 510495 449386 587600 913535 797512 580472 78628 990431 46743 212701 278006 223236 849138 466985 43428 493817 489460 934740 156037 465340 84749 611571 701906 27035 610128 619364 443158 407466 245141 280205 655755 934072 554362 331522 504291 19378 150468 999968 719713 461464 750650 946392 416903 512232 581392 492278 603955 353869 134280 969420 146011 880627 753689 363858 201639 367513 678279

Example 3:

Input: 10 658087 866123 912302 880791 825036 956073 620163 46598 617125 984720
Output: 984720 617125 46598 620163 956073 825036 880791 912302 866123 658087

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Violet scrolls Reverse Order - EASY Coding Problem | CodeTikki