POJ 3096
来源:互联网 发布:python telnetlib详解 编辑:程序博客网 时间:2024/06/05 17:14
The D-pairs of a string of letters are the ordered pairs of letters that are distance D from each other. A string isD-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 ofScientific 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<string>using namespace std;int main(){ string s; while(getline(cin,s)) { if(s[0]=='*') return 0; int x=s.length();int flag=0; for(int i=0;i<x;i++) { for(int j=i+1;j<x;j++) { if(s[i]==s[j]) { //cout<<s[i]<<s[j]<<endl; for(int k=1;k<x;k++) { if(s[i+k]==s[j+k]&&i+k<x&&j+k<x) { flag=1; } } } } } if(flag==0) cout<<s<<" is surprising."<<endl; else cout<<s<<" is NOT surprising."<<endl; } return 0;}
- poj-3096
- POJ 3096
- poj 3096
- POJ-3096
- POJ 3096
- POJ-3096
- POJ 3096
- 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
- POJ 3096 Surprising Strings
- POJ 3096 SET 练习
- poj 3096 Surprising Strings
- poj 3096 Surprising Strings
- 多进程编程
- MOOC清华《程序设计基础》第6章第2题:求f(a,b)问题(动态规划)
- 迷宫问题
- 一些常用的行级标签和块级标签
- 12期 8月期刊自荐
- POJ 3096
- js中的继承
- LeetCode 648 : Replace Words(java)
- CSU-ACM2017暑假集训2-二分搜索 poj3104-drying
- plsql继续试用方法
- u3d
- 【TFS定制】TFS模板编辑:简单操作介绍
- LinkedHashMap实现缓存
- 网络流算法--FORD-FULKERSON方法及其多种实现