Surprising Strings
来源:互联网 发布:mac口红是什么牌子 编辑:程序博客网 时间:2024/06/05 07:30
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.
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.
For each string of letters, output whether or not it is surprising using the exact output format shown below.
ZGBGXEEAABAABAAABBBCBABCC*
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<cstring>using namespace std;char s[80];int sum,k;int main(){ while(cin>>s,strcmp(s,"*")!=0) { k=0; if (strlen(s)<=2) cout<<s<<" is surprising."<<endl; else { for(int i=1;i<strlen(s)-1;i++) { sum=0; for(int j=i;j<strlen(s);j++) if (s[j]==s[j-i]) sum++; if (sum>=2) { k=1; break; } } if (k==1) cout<<s<<" is NOT surprising."<<endl; else cout<<s<<" is surprising."<<endl; } } return 0;}
- Surprising Strings
- Surprising Strings
- Surprising Strings
- Surprising Strings
- Surprising Strings
- Surprising Strings
- 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--映射
- hdu 2736Surprising Strings
- HDOJ 2736 Surprising Strings
- 【美团面试】不开辟新的内存空间实现数组去重
- TextView 中SpannableString应用,让你灵活玩转TextView
- LRU缓存实现(Java)
- 数组奇偶划分
- Docker总结(一)
- Surprising Strings
- Jenkins集成.NET操作说明
- PostgreSQL BRIN索引内核代码优化思考
- Hadoop的两个核心组成
- Promise
- 7.TCP和UDP的区别和应用场景
- spark键值对操作(二)之数据分区
- Red and Black POJ
- 笔记