-
题目描述:
-
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
-
C++代码:
-
#include<iostream> #include<string> #include<vector> using namespace std; int n; vector<string> s; int main(){ while(cin>>n){ for(int i=0;i<n;i++){ string str; cin>>str; s.push_back(str); } int first = 1; for(int i=s.size()-1;i>=0;i--){ if(first==1) first=0; else cout<<" "; cout<<s[i]; } cout<<endl; s.clear(); } return 0; }