CT1086

Iker's Opal ingots

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Every season at the beacon hill of Lantern Tor, someone must plan the beacon maintenance rota. This year the task falls to Iker, armed only with the ingots 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 <= 30; -1000000 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.

Example 1:

Input: 23 358748321 986998635 353742376 28366348 869131664 185867579 329222093 12849091 494806764 270398924 496175652 733969841 75458152 798197562 416590569 439997690 328594338 800238229 998778422 779465212 617151743 46056823 817339246
Output: 817339246 46056823 617151743 779465212 998778422 800238229 328594338 439997690 416590569 798197562 75458152 733969841 496175652 270398924 494806764 12849091 329222093 185867579 869131664 28366348 353742376 986998635 358748321

Example 2:

Input: 7 487271352 83228069 413601282 644280977 608065693 996874081 77539258
Output: 77539258 996874081 608065693 644280977 413601282 83228069 487271352

Example 3:

Input: 15 408191568 320989309 248343133 8567287 543054993 241525572 952530558 675499448 515312489 145620883 268681798 152064833 431661187 51946921 442977988
Output: 442977988 51946921 431661187 152064833 268681798 145620883 515312489 675499448 952530558 241525572 543054993 8567287 248343133 320989309 408191568

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Iker's Opal ingots - EASY Coding Problem | CodeTikki