zoukankan      html  css  js  c++  java
  • nyoj_283_对称排序_201312051155

    对称排序

    时间限制:1000 ms  |           内存限制:65535 KB
    难度:1
     
    描述
    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.
     
    输入
    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, NOT SORTED. 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.
    输出
    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. If length of two strings is equal,arrange them as the original order.(HINT: StableSort recommanded)
    样例输入
    7
    Bo
    Pat
    Jean
    Kevin
    Claude
    William
    Marybeth
    6
    Jim
    Ben
    Zoe
    Joey
    Frederick
    Annabelle
    5
    John
    Bill
    Fran
    Stan
    Cece
    0
    样例输出
    SET 1
    Bo
    Jean
    Claude
    Marybeth
    William
    Kevin
    Pat
    SET 2
    Jim
    Zoe
    Frederick
    Annabelle
    Joey
    Ben
    SET 3
    John
    Fran
    Cece
    Stan
    Bill
    来源
    POJ
     1 #include <stdio.h>
     2 #include <string.h>
     3 typedef struct IN
     4 {
     5     char str[30];
     6     int length;
     7 }IN;
     8 IN s[20];
     9 int cmp(const void *a,const void *b)
    10 {
    11     return (*(IN *)a).length - (*(IN *)b).length;
    12 }
    13 int main()
    14 {
    15     int k=1,T;
    16     while(scanf("%d",&T),T)
    17     {
    18         int i,j;
    19         IN t;
    20         memset(s,0,sizeof(s));
    21         for(i=0;i<T;i++)
    22         {
    23             scanf("%s",s[i].str);
    24             s[i].length=strlen(s[i].str);
    25         }
    26         //qsort(s,T,sizeof(s[0]),cmp);
    27         for(i=0;i<T-1;i++)
    28         {
    29             for(j=0;j<T-i-1;j++)
    30             if(s[j].length>s[j+1].length)
    31             {
    32                 t=s[j];
    33                 s[j]=s[j+1];
    34                 s[j+1]=t;
    35             }
    36         }
    37         printf("SET %d
    ",k++);
    38         for(i=0;i<T;i+=2)
    39         printf("%s
    ",s[i].str);
    40         if(T&1)
    41         {
    42             for(i=T-2;i>=0;i-=2)
    43             printf("%s
    ",s[i].str);
    44         }
    45         else
    46         {
    47             for(i=T-1;i>=0;i-=2)
    48             printf("%s
    ",s[i].str);
    49         }
    50     }
    51     return 0;    
    52 }
    53 //快排貌似不行,用冒泡排序 
  • 相关阅读:
    JS实现继承的几种方式
    Chrome断点调试
    前端小技巧总结
    Laravel5.2 下使用Form
    js 获取input file路径改变图像地址
    html p标签换行问题
    Apache+php配置 Mysql安装出错解决办法
    jQuery旋转插件jqueryrotate 图片旋转
    jquery图片3D旋绕效果 rotate3Di的操作
    mac apache php相关
  • 原文地址:https://www.cnblogs.com/xl1027515989/p/3459385.html
Copyright © 2011-2022 走看看