poj 2013 Symmetric Order

#include <iostream>using namespace std;#include <string>int main(){    int i,n,count;    string s[15];    count = 1;    while(cin >> n)    {        if(!n) break;        for(i = 0; i < n; i++) cin >> s[i];        cout << "SET " << count++ << endl;        for(i = 0; i < n; i += 2) cout << s[i] << endl;        for(i = n - 1 - n%2; i > 0; i -= 2) cout << s[i] << endl;    }    return 0;}