Zero-complexity Tran

查看题解 查看答案
题目描述
Time Limit: 1000 ms
Memory Limit: 256 mb

请先登录再刷题,不会做的题目右上可以查看题解和答案~

输入输出格式
输入描述:
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.
输入输出样例
输入样例#:
5
-3 4 6 -8 9
输出样例#:
复制
9 -8 6 4 -3
题目来源
上海交通大学机试题
重置

提交代码后在此处可查看状态