C - Surprising Strings
来源:互联网 发布:黑蚂蚁网络电视 编辑:程序博客网 时间:2024/05/16 04:17
C - Surprising Strings
题意:输入一段字符串,如果在同一距离下有两个字符串相同输出Not surprising
,否则输出surprising。
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.
InputThe 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.
#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>#include <queue>#include <map>using namespace std;char s[500];char t[500];int main(){ int i,j; int n; while(scanf("%s",s)!=EOF) { if(s[0]=='*') break; n = strlen(s); bool flag = true; for(i=0;i<n;i++) { if(!flag) break; map<string,int>mapp; for(j=0;j+i+1<n;j++) { if(!flag) break; t[0] = s[j]; t[1] = s[j+i+1]; t[2] = '\0'; if(mapp[t]>0) { printf("%s is NOT surprising.\n",s); flag = false; } else mapp[t]++; } } if(flag)cout<<s<<" is surprising."<<endl; } return 0;}
- C - Surprising Strings
- Surprising Strings
- Surprising Strings
- Surprising Strings
- Surprising Strings
- Surprising Strings
- Surprising Strings
- HDOJ 2736 Surprising Strings——c++STL(map)
- sicily 1390 Surprising Strings
- poj3096 Surprising Strings
- POJ3096 Surprising Strings 水题
- 1390. Surprising Strings
- poj 3096 Surprising Strings
- poj 3096 Surprising Strings
- poj 3096 Surprising Strings
- poj 3096 Surprising Strings
- POJ 3096 Surprising Strings
- Surprising Strings--映射
- 左旋转字符串
- POJ-1703 Find them, Catch them
- JavaScript学习 jquery16 浏览器版本相关属性
- poj3934Queue(dp)
- 【索引】Lists
- C - Surprising Strings
- 3GPP TS 36.201 V8.3.0 直译
- Android OpenGL ES 开发教程(7):创建实例应用OpenGLDemos程序框架
- JVM加载class文件的原理
- Oracle 绑定变量 详解
- Chrome 被和谐的解决办法
- VC中MessageBox的常见用法
- 河南省第六届acm省赛 探寻宝藏&& poj 3422 (最大费用最大流)
- PIC单片机红外遥控编码及识别.