Arne Saknussemm

http://acm.hdu.edu.cn/showproblem.php?pid=1915

Arne Saknussemm

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 145    Accepted Submission(s): 44

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

 

 

Source

Southeastern Europe 2007

 

这一题的题目很长，需要一定的耐心，我看了数遍也还没看懂它到底是讲什么东西，最后是从Sample Input和Sample Output里面发现题目的意思。前面的数字N表示的是字每的行数。接下来是N行字母，然后从每行的最后一个开始输出，依次是最后一行的最后一个，倒数第二行的最后一个，倒数第三行的最后一个……依此类推。此题其实考的就是如何输入输出。题目很长，都是废话，还有注意空格和回车。这一题就是因为太多的空格和回车，所以很容易出错。

#include<stdio.h> #include<string.h> char ori[1001]; int main() { int n,i,j,k,len; char str[200][500]; while(scanf("%d",&n)!=EOF) { memset(ori,'/0',sizeof(ori)); for(i=0;i<n;i++) scanf("%s",str[i]); len=strlen(str[0]); k=0; for(j=len-1;j>=0;j--) { for(i=n-1;i>=0;i--) { ori[k++]=str[i][j]; if(ori[k-1]=='_') ori[k-1]=' '; if(ori[k-1]=='//') ori[k-1]='/n'; } } for(i=k-1;i>=0;i--) { if(ori[i]!=' '&&ori[i]!='//') { k=i+1; break; } } for(i=0;i<k;i++) printf("%c",ori[i]); printf("/n/n"); } return 0; }