[字典树]hdu 1075

/**
[字典树]hdu 1075 map水过(PE了两次)
*/
#include <stdio.h>
#include <string.h>
#include <string>
#include <map>
#include <algorithm>

using namespace std;
int main()
{
    int i,j;
    char s[11],s2[11],str[3001];
    gets(s);
    map<string,string> mp;
    while(scanf("%s",s))
    {
        if(strcmp(s,"END") == 0)
            break;
        scanf("%s",s2);
        mp[string(s2)] = string(s);
    }
    getchar();
    gets(str);
    while(gets(str))
    {
        if(strcmp(str,"END") == 0)
            break;
        for(i = 0; str[i]; ++i)
        {
            if(str[i] < 'a' || str[i] > 'z')
            {
                printf("%c",str[i]);
                continue;
            }