uva 10391 Compound Words 习题5-5 (STL string、set练习)
2015-01-03 11:19
393 查看
题目:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1332
参考博客:http://www.xuebuyuan.com/445444.html 感谢分享
说明:find()的用法 、substr()用法
参考博客:http://www.xuebuyuan.com/445444.html 感谢分享
#include<stdio.h> #include<iostream> #include<vector> #include<string> #include<set> #include<map> using namespace std; set<string> a,ans; int main(){ string temp; while(cin >>temp){ //if(temp=="0") break;//用于本地测试 a.insert(temp); } set<string>::iterator it; for(it=a.begin();it!=a.end();it++){ string s=*it; for(int i=0;i<s.length();i++) if(a.find(s.substr(0,i))!=a.end()){ if(a.find(s.substr(i,s.length()))!=a.end()) ans.insert(s); } } for(set<string>::iterator it=ans.begin();it!=ans.end();it++) cout << *it<<endl; return 0; }
说明:find()的用法 、substr()用法
相关文章推荐
- 入门经典-习题5-5,41-uva10391复合词-string assign,set⭐⭐⭐⭐⭐难度:1
- uva 230 Borrowers 习题5-8 (STL string,map练习)
- 入门经典-习题7-1,109-uva208消防车-DFS,并查集,打印路径,利用set保存边,字典序,STL⭐⭐⭐⭐⭐复杂度:3
- UVA 10391 Compound Words 用set实现
- 【习题5-5 UVA-10391】Compound Words
- UVa 10391 - Compound Words(STL成员函数)
- Uva - 10391 Compound Words(hash or stl)
- UVA 10815 Andy's First Dictionary 安迪的字典 stl应用 set+string做法
- uva 10763 Foreign Exchange 习题5-4 (STL 练习)
- UVA 10391 Compound Words
- uva 10391 compound words
- UVA 10391 - Compound Words
- STL中: string、vector、list、deque、set、map 的区别(转)
- STL <set>练习
- uva 10391 Compound Words
- STL几个(set map vector string)用法
- STL几个(set map vector string)用法
- UVA 10391 Compound Words
- UVa 10391 - Compound Words 字符串hash
- UVa 10391 - Compound Words