zoukankan      html  css  js  c++  java
  • To and Fro

    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<iostream>
    #include<stdio.h>
    #include<string.h>
    using namespace std;
    const int N=205;
    char str[N][N],na[N];
    
    int main()
    {
        int n;
        while(~scanf("%d",&n),n)
        {
            getchar();
            gets(na);
            int len=strlen(na);
            int m=len/n;
            int k=0;
            for(int i=0;i<m;i++)
            {
                if(i%2==0)
                {
                    for(int j=0;j<n;j++)
                    {
                        str[i][j]=na[k];
                        k++;
                    }
                }
                else
                {
                    for(int j=n-1;j>=0;j--)
                    {
                        str[i][j]=na[k];
                        k++;
                    }
                }
            }
            for(int j=0;j<n;j++)
            {
                for(int i=0;i<m;i++)
                {
                    printf("%c",str[i][j]);
                }
    
            }
            printf("
    ");
        }
        return 0;
    }
  • 相关阅读:
    判断大文件是否上传成功(一个大文件上传到ftp,判断是否上传完成)
    hbase的region
    把hdfs数据写入到hbase表
    eclipse和scala整合,打包配置文件及打包步骤
    sparkStreaming 读kafka的数据
    脚本put数据到hdfs
    Hive的自定义函数
    Ftp客户端需要TSL功能的文件上传
    Hive中的数据库、表、数据与HDFS的对应关系
    一文了解RPC框架原理
  • 原文地址:https://www.cnblogs.com/iwantstrong/p/5919598.html
Copyright © 2011-2022 走看看