本文主要是介绍九度oj-Zero-complexity Transposition，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
- 题目描述：
-
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.
- 样例输入：
-
5 -3 4 6 -8 9
- 样例输出：
-
9 -8 6 4 -3
- 来源：
- 2007年上海交通大学计算机研究生机试真题
#include<iostream> using namespace std; long long a[10005]; int main() {int n,i;while(cin>>n){for(i=0;i<n;i++)cin>>a[i];for(i=n-1;i>0;i--)cout<<a[i]<<" ";cout<<a[0]<<endl;}return 0; }
这篇关于九度oj-Zero-complexity Transposition的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
