poj 1051(水题,摩斯密码)

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
struct Node{
    char c;
    char d[5];
}node[30];
int main(){
    char data[30][5] = {".-","-...","-.-.","-..",".","..-.",
                    "--.","....","..",".---","-.-",
                    ".-..","--","-.","---",".--.",
                    "--.-",".-.","...","-","..-",
                    "...-",".--","-..-","-.--","--..",
                    "..--",".-.-","---.","----"};
    int n;
    char a[105];
    for(int i=0;i<26;i++){
        node[i].c = 'A'+i;
        strcpy(node[i].d,data[i]);
    }
    node[26].c = '_';
    node[27].c = ',';
    node[28].c = '.';
    node[29].c = '?';
    for(int i=26;i<30;i++){
        strcpy(node[i].d,data[i]);
    }
    char code[405];
    int num[105],ans_i;
    char ans[105];
    scanf("%d",&n);
    for(int kase=1;kase<=n;kase++){
        scanf("%s",a);
        code[0] = '\0';
        memset(num,0,sizeof num);
        memset(code,0,sizeof code);
        for(int i=0;i<strlen(a);i++){
            if(a[i]=='_'){
                num[i] = strlen(data[26]);
                strcat(code,data[26]);
            }
            if(a[i]==','){
                strcat(code,data[27]);
                num[i] = strlen(data[27]);
            }
            if(a[i]=='.'){
                strcat(code,data[28]);
                num[i] = strlen(data[28]);
            }
            if(a[i]=='?'){
                num[i] = strlen(data[29]);
                strcat(code,data[29]);
            }
            if(a[i]>='A'&&a[i]<='Z'){
                strcat(code,data[a[i]-'A']);
                num[i] = strlen(data[a[i]-'A']);
            }
        }
        ans_i = 0;
        for(int i=strlen(a),j=0;i>=0;i--){
            char t[5];
            int k; 
            for(k=0;k<num[i];k++){
                t[k] = code[j++];
            }
            t[k] = '\0';
            for(int i=0;i<30;i++){
                if(strcmp(node[i].d,t)==0){
                    ans[ans_i++] = node[i].c;
                    break;
                }
            }
        }
        ans[ans_i] = '\0';
        printf("%d: ",kase);
        printf("%s\n",ans);
    }
    return 0;
} 

 

posted @ 2021-08-19 14:45  智人心  阅读(67)  评论(0)    收藏  举报