1039.zero-complexity Transposition

Title Description:

You are given a sequence of integer numbers. Zero-complexity transposition of the sequence are the reverse of this sequence. Your task is to write a program that prints zero-complexity transposition of the given sequence.

Input:

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).

Output:

For each case, on the first line of the output file print the sequence in the reverse order.

Sample input:

5-3 4 6-8 9

Sample output:

9-8 6 4-3

#include <iostream>using namespacestd;intMain () {intN,i; Long Longa[10001];  while(cin>>N) {    BOOLfirst=true;  for(i=0; i<n;i++) {cin>>A[i]; }     for(i=n-1; i>=0; i--){        if(first) { first=false; cout<<A[i]; }        Elsecout<<" "<<A[i]; } cout<<Endl;} return 0;}

1039.zero-complexity Transposition