poj 3096 Surprising Strings
来源:互联网 发布:多空博弈指标源码 编辑:程序博客网 时间:2024/06/06 06:33
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.
#include<iostream>#include<string>#include<cstdio>using namespace std;int main(){ char ch[100]; int flag[1000]; while(scanf("%s", &ch) == 1) { if(ch[0] == '*' && ch[1] == '\0') break; bool isOK = true; int n = strlen(ch); int i,j; for(i=1; i<n && isOK ; i++) { memset(flag, 0, sizeof(flag)); for(j=0; j+i<n && isOK; j++) { int t = 26*(ch[j+i] - 'A' + 1) + (ch[j] - 'A'); if(flag[t] == 0) flag[t] = 1; else isOK = false; } } if(isOK) printf("%s is surprising.\n", ch); else printf("%s is NOT surprising.\n", ch); } return 0;}
以上是暴力的方法
/*#include<cstdio>#include<iostream>#include<algorithm>#include<string>#include<cstring>#include<map>#include<stdlib.h>#include<queue>using namespace std;int main(){ char a[100]; int flag=0,l; while(scanf("%s",a)!=EOF) { if(a[0]=='*') break; l=strlen(a); if(l <= 2) { printf("%s is surprising.\n",a); continue; } for(int i=0; i<=l-2; i++) { flag=0; map<string,int>q; for(int j=0; j<l-i; j++) { char ch[3]= {a[j],a[j+i+1],'\0'}; if(q[ch]==0) { q[ch]=1; } else { flag=1; break; } } if(flag) break; } if(flag == 1) printf("%s is NOT surprising.\n",a); else printf("%s is surprising.\n",a); }}用的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
- poj 3096 Surprising Strings
- poj-3096-Surprising Strings
- poj 3096 Surprising Strings
- poj 3096 Surprising Strings
- POJ 3096 Surprising Strings
- poj 3096 Surprising Strings
- FLASH在IE6下Error 2032错的处理
- Manaing the Activity Lifecycle
- android模拟器重启问题
- error: expected unqualified-id before 'delete' void delete(node* p,char a) ^
- Linux 双网卡配置两个IP同时只有一个会通的原因
- poj 3096 Surprising Strings
- hdu 1010 Tempter of the Bone(DFS+奇偶剪枝)
- suse linux 11 error: gnu/stubs-32.h: 没有那个文件或目录 解决方法
- 8.12NOI(P)模拟
- 实现tomcat网页个性化标签栏图标
- 学习日记之中介者模式和Effective C++
- HDU1203,I NEED A OFFER!
- <模板> 矩形分割
- angularjs(step by step):controller