P,MTHBGWB

 

Problem
Morse code represents characters as variable length sequences of dots and dashes. In practice, characters in a message are delimited by short pauses. The following table shows the Morse code sequences:

Note that four dot-dash combinations are unassigned. For the purposes of this problem we will assign them as follows (these are not the assignments for actual Morse code):

Thus, the message “ACM_GREATER_NY_REGION” is encoded as:

.- -.-. -- ..-- --. .-. . .- - . .-. ..-- -. -.-- ..-- .-. . --. .. --- -.

M.E. Ohaver proposed an encryption scheme based on mutilating Morse code. Her scheme replaces the pauses between letters, necessary because Morse is a variable-length encoding that is not prefix-free, with a string that identifies the number of dots and dashes in each. For example, consider the message “.--.-.--”. Without knowing where the pauses should be, this could be “ACM”, “ANK”, or several other possibilities. If we add length information, however, “.--.-.- -242” , then the code is unabiguous.

Ohaver’s scheme has three steps, the same for encryption and decryption:
1. Convert the text to Morse code without pauses but with a string of numbers to indicate code lengths
2. Reverse the string of numbers
3. Convert the dots and dashes back into to text using the reversed string of numbers as code lengths
As an example, consider the encrypted message “AKADTOF_IBOETATUK_IJN”. Converting to Morse code with a length string yields “.--.-.--..----..-...--..-...---.-.--..--.-..--...----.232313442431121334242”. Reversing the numbers and decoding yields the original message “ACM_GREATER_NY_REGION”.
This problem requires that you implement Ohaver’s encoding algorithm. The input will consist of several messages encoded with Ohaver’s algorithm. The first line of the input is an integer n that specifies the number of test cases. The following n lines contain one message per line. Each message will use only the twenty-six capital letters, underscores, commas, periods, and question marks. Messages will not exceed 100 characters in length.
Output
For each message in the input, output the line number starting in column one, a colon, a space, and then the decoded message. The output format must be adhered to precisely.
Example

Input
5
AKADTOF_IBOETATUK_IJN
PUEL
QEWOISE.EIVCAEFNRXTBELYTGD.
?EJHUT.TSMYGW?EJHOT
DSU.XFNCJEVE.OE_UJDXNO_YHU?VIDWDHPDJIKXZT?E

Output
1: ACM_GREATER_NY_REGION
2: PERL
3: QUOTH_THE_RAVEN,_NEVERMORE.
4: TO_BE_OR_NOT_TO_BE?
5: THE_QUICK_BROWN_FOX_JUMPS_OVER_THE_LAZY_DOG
Notes
As presented, this encryption scheme is only trivially secure. In fact it offers no security at all if the algorithm is known to the attacker. The key is the string of numbers needed to decide where the pauses should be inserted to recover the message, but with the method shown here, this information is encoded in and easily recovered from the encrypted data. Even should some other method be chosen to scramble the length information in the encoding, secrecy of the algorithm is the real key in this technique. Modifications of Ohaver’s technique do exist in which the security is not based on the secrecy of the algorithm.

Solution
#include<iostream>
#include <string>
using namespace std;
const char *code[]={".-","-...","-.-.","-..",".","..-.","--.",
                "....","..",".---","-.-",".-..","--","-.",
                "---",".--.","--.-",".-.","...","-","..-",
                "...-",".--","-..-","-.--","--..",
                "..--",".-.-","---.","----"};

void trans(char *source);

int main()
{
    int n;
    cin>>n;
    char st[100];
    for (int i=1;i<=n;i++) {
        cin>>st;
        cout<<i<<": ";
        trans(st);
    }
    return 0;
}
void trans(char *source)
{
    int i,j;
    int slen=strlen(source);//how many characters in one input line
    string temp;//the encryption code series
    string dest;
    int nseries[100]={0};//the encryption numeric series

    for (i=0;i<slen;i++) {
        j=source[i]-'A';
        if (j==30)     j=26;
        if (j==-21) j=27;
        if (j==-19) j=28;
        if (j==-2)     j=29;
        temp.append(code[j]);
        nseries[i]=strlen(code[j]);
    }
    int t=0;
    for (j=0;j<slen;j++) {       
        for (i=0;i<30;i++) {
            if ((temp.compare(t,nseries[slen-1-j],code[i]))==0) {
                if (i==26)  i=30;
                if (i==27)  i=-21;
                if (i==28)  i=-19;
                if (i==29)  i=-2;
                cout<<(char(65+i));
                break;
            };
        }
        t+=nseries[slen-1-j];
    }
    cout<<endl;
}