當前位置:網站首頁>HDU 1915 Arne Saknussemm

HDU 1915 Arne Saknussemm

2021-08-20 14:50:47 mb611f49e4340c9

 

Arne Saknussemm

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

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
     
  • 1.
  • 2.
  • 3.
  • 4.
  • 5.
 

 

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

Jules Verne
  • 1.
  • 2.
  • 3.
  • 4.
  • 5.
  • 6.
 

 

Source

 

 

題解:

       悲劇的一題,今天才發現原來一直以來自己做的都沒有錯,空格也沒有多輸出,而是少輸出末尾的空行。一大篇的廢話,自己直接看的測試數據,發現第二個數據後面沒有空行,錯的就是這裏。重點的我用紅色標出來了。

#include <iostream> #include <string> using namespace std; int main () { int n,i=0,j,l,flag;string s[1000],ss; while (cin>>n) { flag=0; ss=""; for (i=0;i<n;i++) cin>>s[i]; l=s[0].length(); for (j=0;j<l;j++) for (i=0;i<n;i++) { if (s[i][j]!='_') flag=1; if (flag) { if (s[i][j]=='_') ss+=' '; else if (s[i][j]=='//') ss+='/n'; else ss+=s[i][j]; } } l=ss.length(); for (i=l-1;i>=0;i--) cout<<ss[i]; cout<<endl<<endl; } return 0; }

版權聲明
本文為[mb611f49e4340c9]所創,轉載請帶上原文鏈接,感謝
https://cht.chowdera.com/2021/08/20210820145046888J.html

隨機推薦