poj 2503 babelfish
2013-05-06 22:51
239 查看
题目比较简单,但是输入比较纠结,我是用getline函数获取一行,再处理的,可以判断字符是否为空格来分开,我直接用sstream处理了,有点小题大做,用时比较多;
使用map比较方便
Memory: 9620K Time: 1813MS
Language: C++ Result: Accepted
使用map比较方便
Memory: 9620K Time: 1813MS
Language: C++ Result: Accepted
#include <iostream> #include <string> #include <sstream> #include <map> #include <cstring> using namespace std; map<string,string> dictionary; int main() { string str; while(getline(cin,str) && (str != "")) { stringstream data; data.str(str); string str1,str2; int word_count=0; while(data) //分别获取两个单词 { word_count++; if(word_count == 1) data>>str1; else data>>str2; } dictionary[str2] = str1; } while(getline(cin,str) && (str != "")) { if(dictionary.find(str) != dictionary.end()) cout<<dictionary[str]<<endl; else cout<<"eh"<<endl; } return 0; }
相关文章推荐
- Babelfish--POJ 2503
- POJ2503 Babelfish
- POJ 2503 Babelfish[字典树]
- poj 2503 Babelfish trie树!!!!指针版和数组版 基础
- POJ 2503 Babelfish
- poj——2503——Babelfish
- POJ 2503-Babelfish(map)
- poj-2503 Babelfish
- poj 2503 Babelfish(二分)
- poj 2503_Babelfish_map
- POJ 2503 Babelfish
- POJ 2503 Babelfish(STL、二分、字典树、哈希)
- poj-2503-Babelfish-字典树
- poj 2503 Babelfish 用trie树做
- poj 2503 Babelfish (哈希)
- poj2503——Babelfish
- POJ-2503-Babelfish
- POJ 2503 Babelfish
- POJ 2503 Babelfish
- poj2503--Babelfish(特里一水)