CT1495

The Reverse Order at Tangledeep

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

In the kelp forests of Tangledeep, Xara the quartermaster keeps careful count of the parcels. Publish the quarterly findings, 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 <= 25; -1000000 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

Example 1:

Input: 6 -286977 59646 -767047 787704 677144 612969
Output: 612969 677144 787704 -767047 59646 -286977

Example 2:

Input: 8 70591 -147628 -641893 643983 830776 103268 322683 -81180
Output: -81180 322683 103268 830776 643983 -641893 -147628 70591

Example 3:

Input: 6 -384939 164807 846897 -577410 547508 -639582
Output: -639582 547508 -577410 846897 164807 -384939

Constraints:

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

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