zoukankan      html  css  js  c++  java
  • POJ 2013 Symmetric Order

    题目链接:

    http://poj.org/problem?id=2013

    Description

    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

    Hint:
    题意:
    原来输入的是以长度非递减的方式输入的,现在要你对于每一对姓名在列表对等的地方输出,并且每一对姓名中的第一个在列表的上方。例如:Bo和Pat是一对。
    题解:
    简单的递归题,思路就不说了,直接看代码好了。
    代码:
    #include <cmath>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    char s[15+10][25+10];
    int main()
    {
        int n;
        int k=1;
        while(scanf("%d",&n)!=EOF&&n!=0)
        {
            for(int i=0;i<n;i++)
                scanf("%s",s[i]);
            printf("SET %d
    ",k++);
            for(int i=0;i<n;i+=2)
                printf("%s
    ",s[i]);
            if(n%2==1)
            {
                for(int i=n-2;i>=0;i-=2)
                    printf("%s
    ",s[i]);
            }
            else
            {
                for(int  i=n-1;i>=0;i-=2)
                    printf("%s
    ",s[i]);
            }
        }
    }
    


  • 相关阅读:
    传入采购订单项目建交货单
    20190615 NACE关于采购订单的输出类型
    参照UB单创建DN并过账
    【S/4系列专栏】关于S/4你想知道的问题与答案
    数据结构(1)栈的自定义实现
    iOS开发之Todo List for Swift项目
    算法手记(2)Dijkstra双栈算术表达式求值算法
    HttpWebRequst中https的验证处理问题
    温故知新系列
    windows phone开发-windows azure mobile service使用入门
  • 原文地址:https://www.cnblogs.com/TAT1122/p/5828561.html
Copyright © 2011-2022 走看看