CT884

The stamps at Reedmarsh

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

The council of the willow walks of Reedmarsh pays by the answer, and Trader intends to earn it. First: the full register of stamps. 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 <= 33; -1000000 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 3 -137680 -716249 -479261
Output: -479261 -716249 -137680

Example 2:

Input: 33 -380207 -550694 -972712 -124644 -763842 -310719 -390641 -185145 -86536 -290409 -364717 -263697 -68097 -473032 -904724 -826955 -842825 -531947 -843800 -955075 -637228 -981358 -517462 -32509 -40187 -403567 -817537 -844492 -197622 -971911 -843470 -646903 -824488
Output: -824488 -646903 -843470 -971911 -197622 -844492 -817537 -403567 -40187 -32509 -517462 -981358 -637228 -955075 -843800 -531947 -842825 -826955 -904724 -473032 -68097 -263697 -364717 -290409 -86536 -185145 -390641 -310719 -763842 -124644 -972712 -550694 -380207

Example 3:

Input: 33 -468399 -546720 -979098 -785976 -418175 -835890 -4863 -930146 -622839 -694045 -200616 -497448 -658043 -35445 -632091 -459427 -446747 -445824 -361141 -697493 -110 -697614 -347334 -361419 -460574 -517991 -206043 -420834 -129240 -910459 -614383 -916413 -205231
Output: -205231 -916413 -614383 -910459 -129240 -420834 -206043 -517991 -460574 -361419 -347334 -697614 -110 -697493 -361141 -445824 -446747 -459427 -632091 -35445 -658043 -497448 -200616 -694045 -622839 -930146 -4863 -835890 -418175 -785976 -979098 -546720 -468399

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.