题目1039：Zero-complexity Transposition

题目1039：Zero-complexity Transposition

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：2756

解决：1101

题目描述：

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

参考代码：（开始用字符串分割，无论如何AC不了，用大数即可，先用字符串分割再转大数也不行）

import java.math.BigInteger;
import java.util.*;


public class Main{
	public static void main(String arg[]){
		
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()){
			
			Integer n = sc.nextInt();
			
			List<BigInteger> num = new ArrayList<BigInteger>();
			for(int i=0;i<n;i++)
				num.add(sc.nextBigInteger());
			Collections.reverse(num);
			
			for(int i=0;i<num.size();i++){
				System.out.print(num.get(i));
				if(i!=num.size()-1) System.out.print(" ");
			} 
			System.out.println();
			//System.out.println(String.join(" ", num));

		}
	}
}