UVa 10391 - Compound Words
2014-12-10 17:49
399 查看
前几次写的时候每输入一个就把它和前几次输入的复合单词存起来,结果果断TLE。然后把单词分解开来比较,这种思路没错,不过一开始我没有控制输出一次,改掉后又禁止了同一单词复合,不明所以的WA了N次。我也是醉了。
为了这玩意儿我还自己弄了单词表,把里面的单词全都提出来了。。。
为了这玩意儿我还自己弄了单词表,把里面的单词全都提出来了。。。
#include<iostream> #include<set> #include<string> #include<map> #include<vector> using namespace std; int main() { string w; vector<string> words; set<string> words_list; while(cin >> w) { words.push_back(w); words_list.insert(w); } for(int i = 0; i < words.size(); i++) { int size_1; for(size_1 = 1; size_1 < words[i].size(); size_1++) { string s1, s2; for(int j = 0; j < size_1; j++) s1 += words[i][j]; for(int j = size_1; j < words[i].size(); j++) s2 += words[i][j]; if(words_list.count(s1)&& words_list.count(s2)) { cout << words[i] << endl; break; } } } return 0; }
相关文章推荐
- uva 10391 - Compound Words
- UVa 10391 Compound Words
- Uva 10391 - Compound Words
- UVA 10391 Compound Words
- UVa 10391 - Compound Words
- UVA 10391 Compound Words
- uva 10391 Compound Words (字符串-hash)
- uva10391 Compound Words
- uva 10391 Compound Words(查找)
- uva 10391 Compound Words
- Uva-10391-Compound Words
- UVa 10391 - Compound Words
- uva 10391 Compound Words
- uva 10391 Compound Words (字符串-hash)
- UVA 10391 - Compound Words
- UVA 10391 - Compound Words
- UVa 10391 - Compound Words 字符串hash
- UVA 10391 Compound Words
- UVA 10391 Compound Words
- UVA 10391 Compound Words -