PKU Judge Online 2013 Symmetric Order

■2013 Symmetric Order

□Problem
省略．

□Solution
省略．

□Code

package p2013;

import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;

// AC
public class Main{

 Scanner sc=new Scanner(System.in);

 final int INF=Integer.MAX_VALUE;
 final double EPS=1e-9;

 void run(){
  for(int t=1;; t++){
   int n=sc.nextInt();
   if(n==0)
    break;
   String[] ss=new String[n];
   for(int i=0; i<n; i++)
    ss[i]=sc.next();
   LinkedList<String> list=new LinkedList<String>();
   for(int i=n-1; i>=0; i--)
    if(i%2==0)
     list.addFirst(ss[i]);
    else
     list.addLast(ss[i]);
   println("SET "+t);
   for(String s : list)
    println(s);
  }
 }

 void print(String s){
  System.out.print(s);
 }

 void println(String s){
  System.out.println(s);
 }

 public static void main(String[] args){
  // System.setOut(new PrintStream(new BufferedOutputStream(System.out)));
  new Main().run();
 }
}