CT833

The scrolls Reverse Order Puzzle

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

In the rookery of Crowhaven, Gino the reckoner keeps careful count of the scrolls. Verify the ledger before the auditors arrive, every figure matters. 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 <= 64; -100 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

Example 1:

Input: 46 32721 507161 470526 714330 547943 6875 717703 327130 59788 158152 932721 121541 80724 998627 25061 40970 841593 89993 453602 690059 289622 512614 302469 528149 80338 345679 826536 621537 117611 648862 967855 600453 484808 221696 510084 413082 232611 727024 402122 869028 936804 338529 39804 396956 987420 790695
Output: 790695 987420 396956 39804 338529 936804 869028 402122 727024 232611 413082 510084 221696 484808 600453 967855 648862 117611 621537 826536 345679 80338 528149 302469 512614 289622 690059 453602 89993 841593 40970 25061 998627 80724 121541 932721 158152 59788 327130 717703 6875 547943 714330 470526 507161 32721

Example 2:

Input: 15 713050 886138 512548 403594 275663 138962 222212 401447 397808 53472 537350 684806 400193 81633 859706
Output: 859706 81633 400193 684806 537350 53472 397808 401447 222212 138962 275663 403594 512548 886138 713050

Example 3:

Input: 2 189600 121120
Output: 121120 189600

Constraints:

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

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