HDU 1075-What Are You Talking About（map）

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cctype>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define maxn 360
#define _ll __int64
#define ll long long
#define INF 0x3f3f3f3f
#define Mod 1000000007
#define pp pair<int,int>
#define ull unsigned long long
#define max(x,y) ( ((x) > (y)) ? (x) : (y) )
#define min(x,y) ( ((x) > (y)) ? (y) : (x) )
using namespace std;
char str[3010];
int main()
{
	map <string,string> m;
	char x[12],y[12],word[12];
	scanf("%s",x);
	while(~scanf("%s",x)&&x[0]!='E')
	{
		scanf("%s",y);
		string ta(x),tb(y);
		m[y]=x;
	}
	scanf("%s",x);getchar();
	while(gets(str)&&str[0]!='E')
	{
		int len=strlen(str),i=0;
		while(i<len)
		{
			if(str[i]<'a'||str[i]>'z')
			{
				putchar(str[i++]);
				continue;
			}
			int p=0;
			while((str[i]>='a'&&str[i]<='z')&&i<len)
				word[p++]=str[i++];
			word[p]='\0';
			string sb(word);
			if(m.count(sb))
				printf("%s",m[sb].c_str());
			else
				printf("%s",word);
		}
		puts("");
	}
	return 0;
}