[ACM] POJ 3096 Surprising Strings (map的使用)
来源:互联网 发布:java cas是什么 编辑:程序博客网 时间:2024/06/05 16:24
Description
The D-pairs of a string of letters are the ordered pairs of letters that are distance D from each other. A string is D-unique if all of its D-pairs are different. A string is surprising if it is D-unique for every possible distance D.
Consider the string ZGBG. Its 0-pairs are ZG, GB, and BG. Since these three pairs are all different, ZGBG is 0-unique. Similarly, the 1-pairs of ZGBG are ZB and GG, and since these two pairs are different, ZGBG is 1-unique. Finally, the only 2-pair of ZGBG is ZG, so ZGBG is 2-unique. Thus ZGBG is surprising. (Note that the fact that ZG is both a 0-pair and a 2-pair of ZGBG is irrelevant, because 0 and 2 are different distances.)
Acknowledgement: This problem is inspired by the "Puzzling Adventures" column in the December 2003 issue of Scientific American.
Input
The input consists of one or more nonempty strings of at most 79 uppercase letters, each string on a line by itself, followed by a line containing only an asterisk that signals the end of the input.
Output
For each string of letters, output whether or not it is surprising using the exact output format shown below.
Sample Input
ZGBGXEEAABAABAAABBBCBABCC*
Sample Output
ZGBG is surprising.X is surprising.EE is surprising.AAB is surprising.AABA is surprising.AABB is NOT surprising.BCBABCC is NOT surprising.
Source
判断一个字符串是不是surpring。
条件:该字符串的所有D-pairs,D是字符串中两个字母的距离, 如果所有的D-pairs都不同,那么该字符串是D-unique。如果对所有的距离D,都满足D-unique,那么字符串就是surpring.
比如ZGBG
0-pairs : ZG GB BG 不相同,是0-unique
1-pairs : ZB GG 不相同,是1-unique
2-pairs: ZG 不相同,是2-unique
综上,ZGBG是surpring
每一个D-pairs进行判断,如果在判断一个D-pairs过程中有相同的,那么该字符串肯定不是surpring。
用map<string,bool> 来判断是否字符串已经出现过,要注意其声明的位置,要在每一层D循环里面声明。
代码:
#include <iostream>#include <stdio.h>#include <map>#include <string.h>using namespace std;char str[80];int main(){ while(scanf("%s",str)!=EOF&&str[0]!='*') { int len=strlen(str); if(len<=2) { cout<<str<<" is surprising."<<endl; continue; } bool ok=1;//是surpring for(int d=0;d<=len-2;d++)//距离d { bool dtap=1;//是D-unique map<string,bool>mp;//注意其声明的位置 for(int s=0;s<=len-2&&s+d+1<len;s++) { string temp=""; temp+=str[s]; temp+=str[s+d+1]; if(mp[temp])//该字符串出现过 { dtap=0; break; } else mp[temp]=1; } if(!dtap) { ok=0; break; } } if(ok) cout<<str<<" is surprising."<<endl; else cout<<str<<" is NOT surprising."<<endl; } return 0;}
- [ACM] POJ 3096 Surprising Strings (map的使用)
- poj 3096 Surprising Strings(stl map的使用)
- Surprising Strings poj 3096 map的运用
- Surprising Strings POJ 3096 (暴力+map)
- [POJ 3096]Surprising Strings[map]
- Surprising Strings poj 3096 map
- POJ 题目3096 Surprising Strings(map 水)
- POJ 3096-Surprising Strings(map-相同串)
- POJ 3096 Surprising Strings(map 水)
- POJ 3096 Surprising Strings(STL map)
- POJ: Surprising Strings(map、字符串处理)
- poj 3096 Surprising Strings
- poj 3096 Surprising Strings
- poj 3096 Surprising Strings
- poj 3096 Surprising Strings
- POJ 3096 Surprising Strings
- POJ 3096 Surprising Strings
- POJ 3096 Surprising Strings
- poj 1160 动态规划(一维城市建邮局)
- modelsim-察看错误命令 verror
- 华安泰2014摄影作品征集:盛夏里的青春
- ARM9 (2440A) 从启动代码到应用程序(Main) 1
- Spring AOP 完成日志记录
- [ACM] POJ 3096 Surprising Strings (map的使用)
- 1!+2!+...n!求和程序
- check android activity exist
- OCP 1Z0 053 200
- 让你提前认识软件开发(39):软件研发之殇
- 智能家居通用管理平台(二)-软件架构设计
- 带缓存的HTTP代理服务器(七)
- Android蓝牙开发——查询手机上已配对的蓝牙设备
- ubuntu eclipse 下驚醒GTK的配置(全)