CT2181

The Reverse Order at Tuskmore

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

The log keeper Hestia has been asked to compute the guild dues owed. On the desk lies a long table of lanterns readings. 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 <= 32; -100 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.

Example 1:

Input: 17 477336950 269134545 167275355 769987155 583201932 572481489 86695990 512020443 240739371 387034306 113799850 9154582 540458281 849349319 56817617 339704862 679666011
Output: 679666011 339704862 56817617 849349319 540458281 9154582 113799850 387034306 240739371 512020443 86695990 572481489 583201932 769987155 167275355 269134545 477336950

Example 2:

Input: 10 913207874 37907833 266796730 267849123 749663729 778764303 288475810 606521743 784293023 195572437
Output: 195572437 784293023 606521743 288475810 778764303 749663729 267849123 266796730 37907833 913207874

Example 3:

Input: 2 882561744 413003524
Output: 413003524 882561744

Constraints:

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

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