HDU 1915 Arne Saknussemm （解题报告）

Problem Description

Following the account of Jules Verne, a scrambled message written by the middle age alchemist Arne Saknussemm, and deciphered by professor Lidenbrock, started the incredible travel to the center of the Earth. The scrambling procedure used by Arne is alike the procedure given below.

1. Take a non empty message M that contains letters from the English alphabet, digits, commas, dots, quotes (i.e. '), spaces and line breaks, and whose last character is different than space. For example, consider the following message whose translation reads "In Sneffels's crater descend brave traveler, and touch the center of the Earth".

In Sneffels craterem descende audasviator, et terrestre centrum attinges.

2. Choose an integral number 0<K≤length(M) and add trailing spaces to M such that the length of the resulting message, say M', is the least multiple of K. For K=19 and the message above, where length(M)=74 (including the 8 spaces and the line break that M contains), two trailing spaces are added yielding the message M' with length(M')=76.

3. Replace all the spaces from M' by the character _ (underscore) ; replace all the line breaks from M' by / (backslash), and then reverse the message. In our case:

__.segnitta_murtnec_ertserret_te_,rotaiv/sadua_ednecsed_meretarc_sleffenS_nI


4. Write the message that results from step 3 in a table with length(M')/K rows and K columns. The writing is column wise. For the given example, the message is written in a table with 76/19=4 rows and 19 columns as follows:
[缺少图片]

5. The strings of characters that correspond to the rows of the table are the fragments of the scrambled message. The 4 fragments of Arne's message given in step 1 are:

_etmneet_t/udsmt_fS.narctrtria_edrrlen
_gtuerr_,asaneeasf_si_t_seeovdec_ecenI


Write a program that deciphers non empty messages scrambled as described. The length of a message, before scrambling, is at most 1000 characters, including spaces and line breaks.

 

 

Input

The program input is from a text file where each data set corresponds to a scrambled message. A data set starts with an integer n, that shows the number of fragments of the scrambled message, and continues with n strings of characters that designate the fragments, in the order they appear in the table from step 4 of the scrambling procedure. Input data are separated by white-spaces and terminate with an end of file.

 

 

Output

The deciphered message must be printed on the standard output, from the beginning of a line and must be followed by an empty line as shown in the input/output sample below.

 

 

Sample Input

4  _etmneet_t/udsmt_fS
   _gtuerr_,asaneeasf_
   .narctrtria_edrrlen
   si_t_seeovdec_ecenI
11 e n r e V _ s e l u J

 

 

Sample Output

In Sneffels craterem descende audas
viator, et terrestre centrum attinges.

Jules Verne

分析：该题是破译密码的题目，_代表空格，/代表回车，其他的原样输出。

不过该题需要注意的是/不能'/'这样表示，而要'//',这一点要注意;还有就是下划线'_'的问题.

因为每个字符串的长度要求一样,如果不够用'_'表示,所以末尾的下划线全部忽略.

我是先定义一个二维数组接收,在定义一个一维数组来存放,最后输出一维数组.

代码如下:

#include <stdio.h>
#include <algorithm>
using namespace std;

char matrix[1000][1000];
char line[2000];

int main ()
{
	
    int n;
    int i,j;
    int len;
    int pos=0;
    while(scanf("%d",&n)!=EOF)
    {		
        pos=0;
        for(i=0;i<n;i++)
            scanf("%s",matrix[i]);
        len=strlen(matrix[0]);
        int flag=0;
        for(j=0;j<len;j++)
        {
            for(i=0;i<n;i++)
            {
                if(matrix[i][j]!='_')
                    flag=1;
                if(flag==1)	
                {
                    line[pos]=matrix[i][j];
                    pos++;
                }
            }		
        }
        line[pos]='/0';
        reverse(line,line+pos);
        for(i=0;i<pos;i++)
        {
            if(line[i]=='_')
            {
                printf(" ");
                continue;
            }
            else if(line[i]=='//')
            {
                printf("/n");
                continue;
            }
            else 
                printf("%c",line[i]);
        }
       printf("/n/n");
    }
    return 0;
}