2014 winter acm 3 c

C

My Tags	(Edit)

	Source : - Sealed -
	Time limit : 1 sec		Memory limit : 32 M

Submitted : 23, Accepted : 17

In your job at Albatross Circus Management (yes, it's run by a bunch of clowns), you have just finished writing a program whose output is a list of names in nondescending order by length (so that each name is at least as long as the one preceding it). However, your boss does not like the way the output looks, and instead wants the output to appear more symmetric, with the shorter strings at the top and bottom and the longer strings in the middle. His rule is that each pair of names belongs on opposite ends of the list, and the first name in the pair is always in the top part of the list. In the first example set below, Bo and Pat are the first pair, Jean and Kevin the second pair, etc.

Input

The input consists of one or more sets of strings, followed by a final line containing only the value 0. Each set starts with a line containing an integer, n, which is the number of strings in the set, followed by n strings, one per line, sorted in nondescending order by length. None of the strings contain spaces. There is at least one and no more than 15 strings per set.  Each string is at most 25 characters long. 

Output

For each input set print "SET n on a line, where n starts at 1, followed by the output set as shown in the sample output.

Sample Input

7
Bo
Pat
Jean
Kevin
Claude
William
Marybeth
6
Jim
Ben
Zoe
Joey
Frederick
Annabelle
5
John
Bill
Fran
Stan
Cece
0

Sample Output

SET 1
Bo
Jean
Claude
Marybeth
William
Kevin
Pat
SET 2
Jim
Zoe
Frederick
Annabelle
Joey
Ben
SET 3
John
Fran
Cece
Stan
Bill

题目大意：

                 给出的是字符串 长度递增的字符串， 要你给出如列题所示的输出 写出代码

解题方法：

    观察输出可知 对于 7    先输出  0 ， 2， 4，  6 ， 再输出  5， 3， 1 于是奇偶输出即可的

源代码：

  开始我还想复杂来，以为要先排个序什么的 其实不用的。。。

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;

struct ss
{
    string s;
    int str;
}node[27];

bool cmp(ss s1, ss s2)
{
    return s1.str> s2.str;
}
void swap(ss s1, ss s2)
{
    ss s3;
    s3 = s1;
    s1 = s2;
    s2 = s3;
}
int main()
{
    int t = 1;
    int n, i;
    while(cin>>n && n != 0)
    {
        for(i = 0; i < n; i++)
        {
            cin>>node[i].s;
            node[i].str= node[i].s.length();
        }
        cout<<"SET "<<t++<<endl;
        for(i = 0; i < n; i++)
        {
            if(i %2 == 0)
            cout<<node[i].s<<endl;
        }
        for(i = n- 1; i >= 0;i--)
        {
            if(i %2 != 0)
            {
                cout<<node[i].s<<endl;
            }
        }


    }
    return 0;
}