ZOJ 2172 Symmetric Order
来源:互联网 发布:唇语软件下载 编辑:程序博客网 时间:2024/04/29 03:21
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.
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
题意:字符串操作,如图即可
思路:观察规律,原先的序列变成了0,2,4,....(若N是奇数)N-2,....1或0,2,4,....(若N是偶数)N-1,.....,1
代码:
#include<stdio.h>
int main()
{
int N;
char str[30][50];
int n=0;
int a[30];
while (scanf("%d",&N))
{
if(N==0)
break;
int i,t=0;
n++;
getchar();
for(i=0;i<N;i++)
gets(str[i]);
for(i=0;i<N;i+=2)
a[t++]=i;
if(N%2==0)
{
for(i=N-1;i>=1;i-=2)
a[t++]=i;
}
else
{
for(i=N-2;i>=1;i-=2)
a[t++]=i;
}
printf("SET %d\n",n);
for(i=0;i<N;i++)
printf("%s\n",str[a[i]]);
}
return 0;
}
- 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水题
- Symmetric Order
- Symmetric Order
- Symmetric Order
- Symmetric Order
- ZOJ2172 Symmetric Order
- poj 2013 Symmetric Order
- poj 2013 Symmetric Order
- poj 2013 Symmetric Order
- POJ2013浅析------Symmetric Order
- Symmetric Order (P2013)
- ORA-01034: ORACLE not available
- Linux安全删除和恢复文件的脚本
- memcached文档
- 总线系统
- 秋雨寄相思
- ZOJ 2172 Symmetric Order
- Drupal 7 数据库 操作(很好,很犀利)
- hql语句里日期比较
- 链表
- 获取iphone通讯录所有属性
- andrid monkey测试
- android竖直显示文字
- C# 使用线程状态标识替代过时suspend和resumn方法
- 97年Mekka ’97 4K Intro比赛的一等奖作品