CT26111

The Marigold Row Reverse Order

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Every season at the saffron fields of Marigold Row, someone must schedule the next expedition. This year the task falls to Vigo, armed only with the crates register. 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 <= 221; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 220 8 8 10 6 10 1 0 6 2 7 0 4 0 9 4 3 7 10 2 6 2 5 8 1 4 0 6 9 1 5 10 6 1 2 5 10 10 10 7 8 6 9 2 8 3 9 2 4 3 6 1 6 5 1 2 10 10 2 1 8 1 8 2 5 6 0 8 5 8 0 0 8 3 5 4 4 8 9 7 8 5 6 0 10 8 5 2 4 7 2 0 10 10 8 3 2 2 10 9 5 0 1 6 3 3 2 9 9 3 1 10 6 8 6 4 6 2 7 10 4 7 4 3 8 9 7 4 10 9 5 5 4 1 4 4 1 5 8 7 0 7 5 6 9 7 1 3 3 0 7 7 0 9 4 2 7 10 0 6 1 7 3 7 3 5 10 10 8 10 7 3 8 10 3 6 3 6 2 10 1 8 2 4 4 3 1 6 10 5 1 10 1 10 9 1 4 8 3 10 6 4 10 5 4 9 9 8 1 9 6 6 3 5 3 1 1 4 3 9 9
Output: 9 9 3 4 1 1 3 5 3 6 6 9 1 8 9 9 4 5 10 4 6 10 3 8 4 1 9 10 1 10 1 5 10 6 1 3 4 4 2 8 1 10 2 6 3 6 3 10 8 3 7 10 8 10 10 5 3 7 3 7 1 6 0 10 7 2 4 9 0 7 7 0 3 3 1 7 9 6 5 7 0 7 8 5 1 4 4 1 4 5 5 9 10 4 7 9 8 3 4 7 4 10 7 2 6 4 6 8 6 10 1 3 9 9 2 3 3 6 1 0 5 9 10 2 2 3 8 10 10 0 2 7 4 2 5 8 10 0 6 5 8 7 9 8 4 4 5 3 8 0 0 8 5 8 0 6 5 2 8 1 8 1 2 10 10 2 1 5 6 1 6 3 4 2 9 3 8 2 9 6 8 7 10 10 10 5 2 1 6 10 5 1 9 6 0 4 1 8 5 2 6 2 10 7 3 4 9 0 4 0 7 2 6 0 1 10 6 10 8 8

Example 2:

Input: 68 4 9 4 2 3 5 1 2 4 9 3 5 4 5 0 7 6 9 9 2 7 4 0 5 1 0 7 10 6 10 10 8 0 9 3 8 9 6 2 2 10 7 10 3 9 7 5 7 1 2 2 9 0 8 4 7 3 5 6 0 0 4 7 7 5 3 4 7
Output: 7 4 3 5 7 7 4 0 0 6 5 3 7 4 8 0 9 2 2 1 7 5 7 9 3 10 7 10 2 2 6 9 8 3 9 0 8 10 10 6 10 7 0 1 5 0 4 7 2 9 9 6 7 0 5 4 5 3 9 4 2 1 5 3 2 4 9 4

Example 3:

Input: 127 4 3 6 3 6 10 8 1 1 4 0 5 3 5 6 7 0 6 9 1 1 3 2 6 0 4 3 2 5 7 6 2 3 7 6 1 8 6 7 10 2 9 3 8 5 10 6 9 4 5 10 6 4 0 9 0 5 5 0 4 5 8 8 10 7 8 4 2 5 0 5 0 2 2 7 8 0 10 3 1 6 8 10 1 6 7 8 10 5 7 6 4 3 1 6 2 5 7 0 1 2 1 8 6 1 0 2 10 10 6 1 3 3 9 6 4 10 9 10 0 5 2 7 4 10 6 6
Output: 6 6 10 4 7 2 5 0 10 9 10 4 6 9 3 3 1 6 10 10 2 0 1 6 8 1 2 1 0 7 5 2 6 1 3 4 6 7 5 10 8 7 6 1 10 8 6 1 3 10 0 8 7 2 2 0 5 0 5 2 4 8 7 10 8 8 5 4 0 5 5 0 9 0 4 6 10 5 4 9 6 10 5 8 3 9 2 10 7 6 8 1 6 7 3 2 6 7 5 2 3 4 0 6 2 3 1 1 9 6 0 7 6 5 3 5 0 4 1 1 8 10 6 3 6 3 4

Constraints:

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

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