POJ 3096
来源:互联网 发布:seo自学网haiyaoseo 编辑:程序博客网 时间:2024/06/06 03:51
给定一个字符串,
输入surprising 的条件:
从相邻0个字符开始找,全部没有相同情况
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.
Source
[Submit] [Go Back] [Status] [Discuss]
Home Page Go Back To top
#include<iostream>#include<string>#include<map>using namespace std;string str;int main(){while (cin >> str && str != "*"){bool flag = true;for (int i = 0; i < str.length() && flag; i++){map<string, int> mp;for (int j = 0; j + i + 1 < str.length() && flag ; j++){char tmp[3] = {str[j], str[j + i + 1], '\0'};if (mp[tmp]>0){cout << str << " is NOT surprising." << endl;flag = false;}else{mp[tmp]++;}}}if (flag){cout << str << " is 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
- AIDL使用以及原理分析
- 治大国犹如烹小鲜
- HDU 2665 Kth number 主席树模板题
- 日记10月12日
- Android中的三种动画
- POJ 3096
- ubuntu1604LTS制作本地源
- ubuntu系统中两个版本的python
- HDU 5918 Sequence I (水题+字符串匹配)
- js中的事件绑定与解绑
- 静态函数的好处
- Codeforces 629C Famil Door and Brackets【dp】
- C++函数指针point
- python2中scrapy安装