poj 2013 Symmetric Order

#include <iostream>
#include <string>
using namespace std;
string data[20];
int main(){
	int n;
	int count = 1;
	while(cin>> n && n){
		for(int i =1;i<=n;i++){
			cin>>data[i];
		}
		int index[20];                   //头尾记录该输出的单词的下标值
		int start = 1 , rear = n;
		for(int i =1 ; i <= n/2 ; i++){
				index[start] = 2*i - 1;
				index[rear] = 2*i;
				start++;
				rear--;
			}
		if(n%2 != 0)
			index[n/2 + 1] = n;
		cout<<"SET "<<count<<endl;
		count++;
		for(int i =1;i<=n;i++)
			cout<<data[index[i]]<<endl;
	}
}