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("
    ");
        }
    }
    



  • 相关阅读:
    Redis数据库属于nosql数据库类型的一种,什么是nosql数据库,和传统关系型数据库比较,以及windows版本的Redis安装
    redis测试100万并发请求 redis-benchmark -h localhost -p 6379 -c 100 -n 10000
    yum install gcc-c++
    反射技术实战
    违反完整约束条件***已找到子记录的删除方法
    C# 连接和操作SQL SERVER数据库
    C#设计模式学习笔记
    C# 获取windows特殊路径
    Android中的颜色设置
    十个值得一试的开源深度学习框架
  • 原文地址:https://www.cnblogs.com/javawebsoa/p/3198770.html
Copyright © 2011-2022 走看看