牛客网 逆序题 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.
示例1

输入

5
-3 4 6 -8 9

输出

9 -8 6 4 -3

经验

1. scanf的输入是以空白符（回车空格）为结束符的；

AC代码

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
int main(){
    int n,a[10000];
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
    }
    reverse(a,a+n);
    for(int i=0;i<n-1;i++){
        cout << a[i] <<" ";
    }
    cout<<a[n-1]<<endl;
    return 0;
}