CT924

The Reverse Order of Brineport

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Deep in the smokehouses of Brineport, Lara studies rows of tickets entries. One clean number will settle the guild's oldest argument. 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 <= 23; -100 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.

Example 1:

Input: 11 42024972 333045662 561236414 644018286 736958865 458616240 836262473 641736666 385954445 771321703 775294027
Output: 775294027 771321703 385954445 641736666 836262473 458616240 736958865 644018286 561236414 333045662 42024972

Example 2:

Input: 5 187545491 47750919 771510748 93246837 356519463
Output: 356519463 93246837 771510748 47750919 187545491

Example 3:

Input: 9 201811945 555114821 153998735 970177313 631448896 336474201 502814891 746547347 960984104
Output: 960984104 746547347 502814891 336474201 631448896 970177313 153998735 555114821 201811945

Constraints:

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

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