UVa10391 - Compound Words
来源:互联网 发布:章鱼软件 编辑:程序博客网 时间:2024/05/16 01:53
基本思路:把每个单词拆开成两个单词,长度可以不同,判断这两个单词是否在s(set<string>类型)中出现过,如果没有,继续拆解本单词,直到有拆解方案合适或者所有拆解方案都判断完。
1、熟悉set的使用。
2、利用string类型的各种使用。
//#define LOCAL#include<iostream>#include<array>#include<queue>#include<set>#include<vector>#include<map>#include<string>#include<cmath>#include<ctime>#include<algorithm>using namespace std; set<string> s;int main(){#ifdef LOCALfreopen("in.txt", "r", stdin);freopen("out.txt", "w", stdout);#endifstring buf;while (cin >> buf){s.insert(buf);}set<string>::iterator it;for (it = s.begin(); it != s.end();it++){for (int j = 1; j < (*it).length(); j++){string s1, s2;//把*t拆解成s1,s2s2=s1 = *it;s1.erase(j, s1.length());s2.erase(0,j);//cout << s1 << " " << s2 << "\n";if (s.count(s1)&&s.count(s2)){cout << *it << "\n";break;}}}//printf("Time used=%.3f\n", (double)clock() / CLOCKS_PER_SEC);return 0;}
0 0
- uva10391 - Compound Words
- UVA10391- Compound Words
- UVa10391 - Compound Words
- UVa10391 - Compound Words
- UVA10391 Compound Words
- UVA10391:Compound Words(复合词)
- [二分查找]Compound Words uva10391
- [UVA10391]Compound Words[map][实现]
- UVa10391-- Compound Words(字符串hash)
- UVA10391 ZOJ1825 Compound Words【SET+暴力】
- uva10391 Compound Words (substr用法)
- [刷题]算法竞赛入门经典(第2版) 5-5/UVa10391 - Compound Words
- Uva10391 Compound Words 【俩方法:1.二分;2.set集合】【习题5-5】
- 算法竞赛入门经典 第二版 习题5-5 复合词 Compound Words uva10391
- Compound Words
- Compound Words
- Compound Words
- Compound Words
- 测试1
- XDOJ1106 - 哥德巴赫猜想
- Android_notification的应用
- 黑马程序员—谁说黑马程序员没有女朋友———有木有,有木有!!!
- struts2前端页面读取Clob/BLOB
- UVa10391 - Compound Words
- mongo的query中包含null怎么查询
- Block的应用---拓展NArray
- PAT (Basic Level) Practise (中文)1006. 换个格式输出整数 (15)
- C/C++中栈内存和堆内存详解
- 黑马程序员—must 8k,黑马真男人,平均9k宿舍~~~~求围观,求给力!!!!
- 使用linq对字符串1,2,3,4,5,6,7,8,9,10求和
- 十年
- 机房收费系统(3)--SQL注入攻击