What Are You Talking About (map)
InputThe problem has only one test case, the test case consists of two parts, the dictionary part and the book part. The dictionary part starts with a single line contains a string "START", this string should be ignored, then some lines follow, each line contains two strings, the first one is a word in English, the second one is the corresponding word in Martian‘s language. A line with a single string "END" indicates the end of the directory part, and this string should be ignored. The book part starts with a single line contains a string "START", this string should be ignored, then an article written in Martian‘s language. You should translate the article into English with the dictionary. If you find the word in the dictionary you should translate it and write the new word into your translation, if you can‘t find the word in the dictionary you do not have to translate it, and just copy the old word to your translation. Space(‘ ‘), tab(‘\t‘), enter(‘\n‘) and all the punctuation should not be translated. A line with a single string "END" indicates the end of the book part, and that‘s also the end of the input. All the words are in the lowercase, and each word will contain at most 10 characters, and each line will contain at most 3000 characters.
OutputIn this problem, you have to output the translation of the history book.
Sample Input
START from fiwo hello difh mars riwosf earth fnnvk like fiiwj END START difh, i‘m fiwo riwosf. i fiiwj fnnvk! END
Sample Output
hello, i‘m from mars. i like earth!
Hint
Huge input, scanf is recommended.
本題相當於翻譯句子;
#include<iostream> #include<map> #include<string > usingnamespace std; int main() { map <string, string> mp; string str, temp; cin >> str; while (cin >> str && str != "END") { cin >> temp; mp[temp] = str; } cin >> str; getchar(); while (getline(cin, str) && str != "END") { string st = ""; for (int i = 0; i < str.length(); i++) { if (!isalpha(str[i])) { map<string, string>::iterator p = mp.find(st); if (p == mp.end()) cout << st; else cout << mp[st]; cout << str[i]; st = ""; } else st += str[i]; } cout << endl; } return 0; }
利用map<string,string>解決;註意的是放在map中的first,second位置的不同,而引起的find的不同;
靈活應用map
What Are You Talking About (map)