题目地址:http://poj.org/problem?id=1051
题目大意:根据每个字母与四个标点符号的摩尔电码以及每个所输入的摩尔电码的长度解密;
解密过程为先将长度串反转,然后再根据长度串找对应的摩尔电码;
实例:PUEL-->.--...-..-.. 4314-->4134-->PERL
题目评价:水题,无任何算法,说实话,我还在打了半天,要注意很多字符串的小问题。
代码:
#include<cstdio>
#include<string.h>
#include<string>
#include<iostream>
using namespace std;
char map1[26][10]={".-","-...","-.-.","-..",".","..-.","--.","....","..", ".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-", ".--","-..-","-.--","--.."};
char map2[4][10]={"..--","---.",".-.-","----"};
int finda(char c)
{
if (c=='_')return 0;
else if(c=='.')return 1;
else if(c==',')return 2;
else if(c=='?')return 3;
}
char findb(char c[])
{
for(int i=0;i<26;i++){if(strcmp(c,map1[i])==0) return 'A'+i;}
if (strcmp(c,"..--")==0) return '_';
else if(strcmp(c,"---.")==0) return '.';
else if(strcmp(c,".-.-")==0) return ',';
else if(strcmp(c,"----")==0) return '?';
}
int main()
{
int n;cin>>n;
for(int i=1;i<=n;i++)
{
char first[110];scanf("%s",first);
string temp;int num[110];
int j=0;
while(first[j]!='\0')
{
if(first[j]>='A'&&first[j]<='Z'){temp=temp+map1[first[j]-'A'];num[j]=strlen(map1[first[j]-'A']);}
else{temp=temp+map2[finda(first[j])];num[j]=strlen(map2[finda(first[j])]);}
j++;
}//输入部分
int count=0;
for(int x=j-1;x>=(j/2);x--){int temp2;temp2=num[count];num[count]=num[x];num[x]=temp2;count++;}//交换部分
count=0;
cout<<i<<": ";
for(int x=0;x<j;x++)
{
int a=num[x];char ans,temp3[10];int y;
for(y=0;y<a;y++){temp3[y]=temp[count];count++;}temp3[a]='\0';
ans=findb(temp3);
cout<<ans;
}
cout<<endl;//输出部分
}
return 0;
}