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

    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()
    {
        char s[30][200],str[300];
        int n,i,j,k,len;
        while(~scanf("%d",&n),n)
        {
            scanf("%s",str);
            len = strlen(str);
            memset(s,'',sizeof(s));
            k = 0;
            for(i = 0;i<len/n && k<len;i++)
            {
                for(j = 0;j<n;j++)
                {
                    if(i%2)
                    s[i][n-j-1] = str[k++];
                    else
                    s[i][j] = str[k++];
                }
            }
            for(i = 0;i<n;i++)
            {
                for(j = 0;j<len/n;j++)
                {
                    printf("%c",s[j][i]);
                }
            }
            printf("
    ");
        }
        return 0;
    }
    


     

  • 相关阅读:
    IP报头结构
    C#组件项目设置与开发应用范例
    UDP数据报协议
    WOW 各等级属性换算表
    清理SQLSERVER日志
    正则表达式匹配EXCEL地址字符串
    TCP数据段格式
    MAC地址结构
    (转载) Delphi中打印条码的方法
    为了使用uart2, 发现6252中define了 SCCB_SERIAL_CLK_PIN 值为 22, 为了避免冲突, 手动修改其值为 23
  • 原文地址:https://www.cnblogs.com/dyllove98/p/3206561.html
Copyright © 2011-2022 走看看