poj 2013 Symmetric Order 规律

#include<stdio.h>

#include<string.h>

#include<iostream>

using namespace std;

char store[20][26];

int set=1;

int n;

int visited[20];

int main()

{

while(cin>>n,n)

{

memset(visited,0,sizeof(visited));

printf("SET %d/n",set);

set++;

for(int i = 1; i <= n; i++)

{

scanf("%s",store[i]);

}

for(int i = 1; i <= n; i += 2)

{

printf("%s/n",store[i]);

visited[i]=1;

}

for(int i = n; i >0; i--)

{

if(!visited[i])

printf("%s/n",store[i]);

}

}

return 0;

}