POJ 1051

#include <iostream>
#include <algorithm>
#include <string>
#define MAXN 27
using namespace std;

struct node
{
    int len;
    string s;
};
char fun(string s);
node _node[MAXN];
int n[];

int main()
{
    int time = ;
    //freopen("acm.acm","r",stdin);
    int i;
    _node[].len = ;
    _node[].s = ".-";
    _node[].len = ;
    _node[].s = "-...";
    _node[].len = ;
    _node[].s = "-.-.";
    _node[].len = ;
    _node[].s = "-..";
    _node[].len = ;
    _node[].s = ".";
    _node[].len = ;
    _node[].s = "..-.";
    _node[].len = ;
    _node[].s = "--.";

    _node[].len = ;
    _node[].s = "....";
    _node[].len = ;
    _node[].s = "..";
    _node[].len = ;
    _node[].s = ".---";
    _node[].len = ;
    _node[].s = "-.-";
    _node[].len = ;
    _node[].s = ".-..";
    _node[].len = ;
    _node[].s = "--";
    _node[].len = ;
    _node[].s = "-.";

    _node[].len = ;
    _node[].s = "---";
    _node[].len = ;
    _node[].s = ".--.";
    _node[].len = ;
    _node[].s = "--.-";
    _node[].len = ;
    _node[].s = ".-.";
    _node[].len = ;
    _node[].s = "...";
    _node[].len = ;
    _node[].s = "-";
    _node[].len = ;
    _node[].s = "..-";
    _node[].len = ;
    _node[].s = "...-";
    _node[].len = ;
    _node[].s = ".--";
    _node[].len = ;
    _node[].s = "-..-";
    _node[].len = ;
    _node[].s = "-.--";
    _node[].len = ;
    _node[].s = "--..";

    int test;
    string _s;
    string s;
//    int i;
    cin>>test;
    while(test --)
    {

        cin>>s;
        _s = "";
        for(i = ; i < s.length(); ++ i)
        {
            if(s[i] >= 'A' && s[i] <= 'Z')
            {
                _s += _node[s[i]-'A'].s;
                n[i] = _node[s[i]-'A'].len;
            }
            else if(s[i] == '_')
            {
                _s += "..--";
                n[i] = ;
            }
            else if(s[i] ==',')
            {
                _s += ".-.-";
                n[i] = ;
            }
            else if(s[i] == '.')
            {
                _s += "---.";
                n[i] = ;
            }
            else if(s[i] == '?')
            {
                _s += "----";
                n[i] = ;
            }
        }
        reverse(n,n+s.length());
    //    for(i = 0; i < s.length(); ++ i)
    //    {
    //        cout<<n[i]<<" ";
    //    }
    //    cout<<s<<endl;
    //    cout<<_s<<endl;
    //    cout<<endl;
        cout<<++ time<<": ";
        int j = ;
        for(i = ; i < _s.length();)
        {
            string k;
            k = _s.substr(i,n[j]);
            i += n[j ++];
            //cout<<k<<endl;
            //    cout<<(char)(fun(k)+'A');
        //    cout<<k<<" ";
            cout<<fun(k);
        }
        cout<<endl;
    }
}

char fun(string s)
{
    int i;
    if(s == "..--")
    {
        return '_';
    }
    else if(s == ".-.-")
    {
        return ',';
    }
    else if(s == "---.")
    {
        return '.';
    }
    else if(s == "----")
    {
        return '?';
    }

    for(i = ; i < MAXN; ++ i)
    {
        if(_node[i].s == s)
        {
            return char('A'+i);
        }
    }
}

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。

技术网站地址： vmfor.com