首页 > 试题广场 >

Zero-complexity Transposition

[编程题]Zero-complexity Transposition
  • 热度指数：12805 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 64M，其他语言128M
  • 算法知识视频讲解
You are given a sequence of integer numbers. Zero-complexity transposition of the sequence is the reverse of this sequence. Your task is to write a program that prints zero-complexity transposition of the given sequence.

输入描述:
For each case, the first line of the input file contains one integer n-length of the sequence (0 ＜ n ≤ 10 000). The second line contains n integers numbers-a1, a2, …, an (-1 000 000 000 000 000 ≤ ai ≤ 1 000 000 000 000 000).


输出描述:
For each case, on the first line of the output file print the sequence in the reverse order.
示例1

输入

5
-3 4 6 -8 9

输出

9 -8 6 4 -3
算法知识视频讲解
添加回答
Python
TimeMac头像 TimeMac 
while True:
    try:
        num = int(input())
        print(' '.join(input().split()[::-1]))
    except Exception:
        break
编辑于 2018-10-13 14:44:56 回复(0)
Python
华科平凡头像 华科平凡

python solution：

while True:
    try:
        a,b=input(),input().split()
        print(" ".join(b[::-1]))
    except:
        break
发表于 2017-10-16 18:00:53 回复(0)
Python
questRush头像 questRush 
try:
    while 1:
        n = input()
        print ' '.join(raw_input().split()[::-1])
except:
    pass

发表于 2016-12-27 09:33:25 回复(0)
提交观点

问题信息

栈
难度：
3条回答 4948浏览

热门推荐

通过挑战的用户

查看代码

相关试题

Zero-complexity Transposition

扫一扫，把题目装进口袋

求职之前，先上牛客

扫描二维码，进入QQ群

扫描二维码，关注牛客公众号