2172_Symmetric Order(水题)
来源:互联网 发布:客户管理源码 编辑:程序博客网 时间:2024/06/11 17:14
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 byn 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.
Example input:Example output:7Bo
Pat
Jean
Kevin
Claude
William
Marybeth
6
Jim
Ben
Zoe
Joey
Frederick
Annabelle
5
John
Bill
Fran
Stan
Cece
0SET 1
Bo
Jean
Claude
Marybeth
William
Kevin
Pat
SET 2
Jim
Zoe
Frederick
Annabelle
Joey
Ben
SET 3
John
Fran
Cece
Stan
Bill
Source: Mid-Central USA 2004
***************************************************************************************************************
//题意:将原来非降序的一组名字按对称的顺序输出,具体为:(数组下标从1开始)先奇数升序的输出,然后偶数降序输出
#include<iostream>
#include<string>
using namespace std;
struct list
{
string name;
};
int main()
{
list order[16];
int n,i,count=1;
while(cin>>n&&n)
{
for(i=1;i<=n;i++)
cin>>order[i].name;
cout<<"SET "<<count++<<endl;
for(i=1;i<=n;i+=2)
cout<<order[i].name<<endl;
if(n%2==0)
for(i=n;i>=1;i-=2)
cout<<order[i].name<<endl;
else
for(i=n-1;i>=1;i-=2)
cout<<order[i].name<<endl;
}
return 0;
}
- 2172_Symmetric Order(水题)
- leetcode第一刷_Symmetric Tree
- zoj 2172 Symmetric Order水题
- zoj 2172 Symmetric Order
- zoj 2172 Symmetric Order
- zoj 2172 Symmetric Order
- ZOJ 2172 Symmetric Order
- ZOJ 2172 Symmetric Order
- zoj 2172 Symmetric Order
- ZOJ 2172 Symmetric Order
- order
- ORDER
- Order
- hdu 5702 Solving Order 水题
- POJ 2013 Symmetric Order (水题)
- cf#317-B-Order Book-水题
- hdu 5702 Solving Order(结构体排序 水题)
- FS5-Order
- acm fzu 2108 Mod problem
- HDU-1412{A}+{B}
- python中的数据类型
- 抽象类
- org.apache.xerces.dom.ElementNSImpl.setUserData
- 2172_Symmetric Order(水题)
- 抽象类举例
- Linux和Windows对"\r\n"的不同处理
- hdu 1053 Entropy
- ubuntu(Debian)减肥
- NEFU 657 Reverse a Road(SPFA)
- include文件返回值问题
- Path Sum
- U盘安装debian 5