zoukankan      html  css  js  c++  java
  • hdu1200(来来回回串起来)

    Problem Description
    Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number of columns and write the message (letters only) down the columns, padding with extra random letters so as to make a rectangular array of letters. For example, if the message is “There’s no place like home on a snowy night” and there are five columns, Mo would write down

    t o i o y
    h p k n n
    e l e a i
    r a h s g
    e c o n h
    s e m o t
    n l e w x


    Note that Mo includes only letters and writes them all in lower case. In this example, Mo used the character ‘x’ to pad the message out to make a rectangle, although he could have used any letter.

    Mo then sends the message to Larry by writing the letters in each row, alternating left-to-right and right-to-left. So, the above would be encrypted as

    toioynnkpheleaigshareconhtomesnlewx

    Your job is to recover for Larry the original message (along with any extra padding letters) from the encrypted one.
     

     

    Input
    There will be multiple input sets. Input for each set will consist of two lines. The first line will contain an integer in the range 2. . . 20 indicating the number of columns used. The next line is a string of up to 200 lower case letters. The last input set is followed by a line containing a single 0, indicating end of input.
     

     

    Output
    Each input set should generate one line of output, giving the original plaintext message, with no spaces.
     

     

    Sample Input
    5 toioynnkpheleaigshareconhtomesnlewx 3 ttyohhieneesiaabss 0
     

     

    Sample Output
    theresnoplacelikehomeonasnowynightx thisistheeasyoneab
    #include<stdio.h>
    #include<string.h>
    int main()
    {
        int n,i,len,m,e,j;
        char str[10000],ch[1000][25];
        while(scanf("%d",&n)==1&&n)
        {
            getchar();
            scanf("%s",str);
            len=strlen(str);
            m=len/n;//把str串分成m个小串
            if(len%n)
            m++;
            for(i=0;i<m;i++)
            if(i%2==0)//当能被2整除的就正向保存
            {
                e=0;
                 for(j=i*n;j<len&&j<(i+1)*n;j++)
                    ch[i][e++]=str[j];
            }
            else//否则就倒着保存
            {
                e=0;
                for(j=(i+1)*n-1;j>=i*n;j--)
                if(str[j]!='')
                ch[i][e++]=str[j];
            }
            e=len%n;//注意,有的不能除尽,最后一个小串长度小于n
            for(j=0;j<n;j++)
            for(i=0;i<m;i++)
            if(i==m-1)//最后一个小串输出
            {
                if(j<e||e==0)
                printf("%c",ch[i][j]);
            }
            else
            printf("%c",ch[i][j]);
    
            printf("
    ");
        }
    }
    



  • 相关阅读:
    c#创建对象并动态添加属性
    js从$scope外部调用$scope内部函数,跨js调用非全局函数
    JQuery中$.ajax()方法参数详解
    c#关于int(或其他类型)的字段在对象初始化时默认初始化问题的解决方法
    SQLServer中存储过程StoredProcedure创建及C#调用(转)
    2020年将热门的8大IT职业领域
    2015总结+2016计划
    hadoop程序在本地模式调试作业
    Flume+Kafka+storm的连接整合
    scp 和 pscp
  • 原文地址:https://www.cnblogs.com/javawebsoa/p/3198770.html
Copyright © 2011-2022 走看看