程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> HDU1200:To and Fro

HDU1200:To and Fro

編輯:C++入門知識

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,'\0',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("\n");
    }
    return 0;
}

 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved