hdu1075

http://acm.hdu.edu.cn/showproblem.php?pid=1075

数据结构的题：map的应用

代码：

#include<iostream>
#include<map>
#include<string>
#include<algorithm>


using namespace std;


int main()
{
char line[3000+10];
char key[20];
char value[20];
int i,j;
map<string,string> mm;
map<string,string>::iterator values;
scanf("%s",&line);
while(scanf("%s",&value)!=EOF)
{
if(0==strcmp(value,"END"))
{
break;
}
else
{
scanf("%s",&key);
mm.insert(pair<string,string>(key,value));
}
}
scanf("%s",&line);
getchar();
while(gets(line))
{
if(0==strcmp(line,"END"))
{
break;
}
else
{
i = 0;
while(line[i]!='\0')
{
j = 0;
while(line[i]>='a'&&line[i]<='z')
key[j++] = line[i++];
key[j] = '\0';
if(mm.end()!=(values = mm.find(key)))
{
cout<<values->second;
}
else
{
printf("%s",key);
}
while(!(line[i]>='a'&&line[i]<='z')&&line[i]!='\0')
printf("%c",line[i++]);
}
printf("\n");
}
}
return 0;
}