10391 - Compound Words(stl map)
来源:互联网 发布:神仙道 源码 编辑:程序博客网 时间:2024/06/02 02:00
题目:10391 - Compound Words
题目大意:找出有里面出现过的两个单词组成的符合串找出来,按字典序打印。
解题思路:把出现过的单词用map记录下来,然后把每个单词都分两半来考虑是否出现过,两半可以长短不一。
注意:审题要仔细,这题当初就是漏了符合串是由两个单词组成的。
#include<stdio.h>#include<iostream>#include<map>#include<string.h>#include<string>using namespace std;const int N = 120005;const int M = 100;map<string, int> s;char str[N][M];int main () {int n = 0, flag;while (gets(str[n]) != NULL) {s[str[n++]] = 1;}for (int i = 0; i < n; i++) {for (int j = 1; j < strlen(str[i]); j++) {char str1[M], str2[M];strcpy(str1, str[i]);str1[j] = '\0';strcpy(str2, str[i] + j);//printf("%s\n", str2);if (s[str1] + s[str2] == 2){printf("%s\n", str[i]);flag = 1; break;}} }return 0;}
1 0
- 10391 - Compound Words(stl map)
- uva 10391 Compound Words(stl map)
- UVA Compound Words(STL map)
- UVa 10391 - Compound Words(STL成员函数)
- [UVA10391]Compound Words[map][实现]
- uva 10391 Compound Words 习题5-5 (STL string、set练习)
- uva 10391 Compound Words (字符串-hash)
- UVa 10391 - Compound Words (字符串hash)
- UVA - 10391 Compound Words(hash)
- 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
- Compound Words 10391
- uva 10391 - Compound Words
- Android 中的BroadCastReceiver
- POJ 2251 Dungeon Master
- tcp/ip状态变迁
- spring3,struts2,hibernate,junit,设计模式视频教程下载
- 10个精妙的Java编码最佳实践
- 10391 - Compound Words(stl map)
- [ext4]空间管理 - 分配机制
- [LeetCode] Single Number
- 双网卡绑定
- 深入学习JDK 线程池(之五)
- cocos2d-x 通过JNI实现c/c++和Android的java层函数交互
- 整合Eclipse与Tomcat开发第一个WEB程序
- C# 中点击按钮datagridview自行添加一空白行!
- [LeetCode] Single Number II