What Are You Talking About HDU1075[通俗易懂]

#include<bits/stdc++.h>
using namespace std;

int main()
{
    string a,b;
    map<string ,string >ma;
    cin>>a;
    while(cin>>a&&a!="END")
    {
        cin>>b;ma[b]=a;

    }
    cin>>a;
    char s[3500];getchar();
    while(gets(s))
    {
        if(!strcmp(s,"END"))break;

        int n=strlen(s);
        a="";
        for(int i=0;i<n;i++)
        {
         if(islower(s[i]))a+=s[i];
         else
         {
             if(ma.find(a)!=ma.end())
                cout<<ma[a];

             else
                 cout<<a;

             cout<<s[i];
             a="";


         }


        }
        cout<<endl;


    }




}

#include <iostream> #include <cstdio> #include <cstring> #include<malloc.h> using namespace std; struct node { char *val; node *next[26]; int flag; node() { for(int i=0;i<26;i++) { next[i]=NULL; } flag=0; } }; node *p,*root=new node(); void change(char *s,char *v) { p=root; for(int i=0;s[i]!='\0';i++) { int ch=s[i]-'a'; if(p->next[ch]==NULL) p->next[ch]=new node(); p=p->next[ch]; } p->flag=1; p->val=(char*)malloc((strlen(v)+1)*sizeof(char)); strcpy(p->val,v); } void find1(char *s) { p=root; for(int i=0;s[i]!='\0';i++) { int ch=s[i]-'a'; if(p->next[ch]==NULL) { printf("%s",s);return; } p=p->next[ch]; } if(p->flag)printf("%s",p->val); else printf("%s",s); } int main() { char a[3010],b[3010]; gets(a); while(scanf("%s",a)==1) { if(!strcmp(a,"END"))break; scanf("%s",b); change(b,a); } getchar(); gets(a); char s[3010]; while(gets(a)) { if(!strcmp(a,"END"))break; int k=0; for(int i=0;i<strlen(a);i++) { if(islower(a[i]))s[k++]=a[i]; else { s[k]='\0'; find1(s); printf("%c",a[i]); k=0; } } printf("\n"); } return 0; }