POJ2503 Babelfish （map）

Babelfish Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 42407 Accepted: 18000

Description

You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.

Input

Input consists of up to 100,000 dictionary entries, followed by a blank line, followed by a message of up to 100,000 words. Each dictionary entry is a line containing an English word, followed by a space and a foreign language word. No foreign word appears more than once in the dictionary. The message is a sequence of words in the foreign language, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.

Output

Output is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as "eh".

Sample Input

dog ogday cat atcay pig igpay froot ootfray loops oopslay atcay ittenkay oopslay

Sample Output

cat eh loops

 

用map映射 易超时 用到了sscanf函数

sscanf()的用法http://www.cnblogs.com/gmh915/archive/2009/09/30/1576995.html

STL map用法http://blog.csdn.net/nwf5d/article/details/4338872

#pragma warning(disable:4786)//屏蔽4786警告 #include<stdio.h> #include<string.h> #include<map> #include<ctype.h> #include<iostream> using namespace std; int main() { map<string,string>mat; char word[15],s[15],str[30]; while(gets(str)) { if(str[0]==0) break; sscanf(str,"%s%s",word,s);//sscanf（) - 从一个字符串中读进与指定格式相符的数据。 mat[s]=word; } while(gets(str)) { //查找并获取map中的元素it==mat.end() 没找到 map<string,string>::iterator it=mat.find(str); if(it!=mat.end()) { cout<<mat[str]<<endl; } else cout<<"eh"<<endl; } }