Surprising Strings poj 3096 map
来源:互联网 发布:数据化人生小说 编辑:程序博客网 时间:2024/06/05 02:52
Surprising StringsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6972 Accepted: 4514Description
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.
#include<cstring>#include<cstdio>#include<iostream>#include<algorithm>#include<map>#include<utility>using namespace std;char s[86];int main(){ while(~scanf("%s",s)) { if(s[0]=='*') break; int l=strlen(s); if(l<=2) { printf("%s is surprising.\n",s); continue; } int i,j; int flag; for(i=0;i<l-1;i++) { flag=1; map<string,int>mp; for(j=0;j<l-1-i;j++) { char p[2]={s[j],s[j+1+i]}; if(mp[p]==0) { mp[p]=1;continue; } else { flag=0;break; } } if(flag==0) break; } if(flag) printf("%s is surprising.\n",s); else printf("%s is NOT surprising.\n",s); }}
- [POJ 3096]Surprising Strings[map]
- Surprising Strings poj 3096 map
- POJ 3096 Surprising Strings(map 水)
- Surprising Strings POJ 3096 (暴力+map)
- POJ 3096 Surprising Strings(STL map)
- Surprising Strings poj 3096 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 3096 Surprising Strings
- poj 3096 Surprising Strings
- poj 3096 Surprising Strings
- POJ 3096:Surprising Strings
- Surprising Strings(POJ -3096
- scrapy源码分析(八)--------ExecutionEngine
- NO.9 HTML继续走起
- poj 1195 Mobile phones
- 常见对象_Random类的概述和方法使用
- 2017 年热门编程语言排行榜,你的语言上榜没?
- Surprising Strings poj 3096 map
- js练习--轮播图
- 什么是fastCGI
- 单链表的读取
- ZYNQ学习资料
- 数组大折腾3
- Toolbar_学会使用
- Ubuntu 16.04 安装个人Wiki BlueSpice
- poj3114 Countries in War