POJ 3096 Surprising Strings 【STL】
来源:互联网 发布:北京语言大学网络教育 编辑:程序博客网 时间:2024/06/06 00:59
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.
C++标准函数库:
#include <stdio.h>#include <string>#include <string.h>#include <iostream>#include <map>using namespace std;int main(){ char str[110]; while( cin>>str && str[0] != '*') { int i, j; int l; l = strlen(str); if(l<=2) { cout<<str<<" is surprising."<<endl; continue; } int flag = 1; for(i=0; i<= l-2; i++) { map<string, bool> q; bool sign = 1; for(j=0; j<=l-i-2; j++) { char p[3] = {str[j], str[j+i+1], '\0' }; if(!q[p]) q[p] = 1; else { sign = 0; break; } } if(!sign) { flag = 0; break; } } if(flag) cout<<str<<" is surprising."<<endl; else cout<<str<<" is NOT surprising."<<endl; } return 0;}
- POJ 3096 Surprising Strings 【STL】
- POJ 3096 Surprising Strings(STL 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
- HDU1950:Bridging signals(LIS)
- php应用篇-百度图片的防盗链
- 安装TortoiseSVN遇到无法通过Windows Istaller服务器安装此安装序包...解决办法
- PC装OSX10.9
- oracle专用模式(DEDICATED) 和 共享模式(SHARE)
- POJ 3096 Surprising Strings 【STL】
- 为什么codeigniter 会出现这个 Disallowed Key Characters 错误提示
- 浅谈Android五大布局—LinearLayout、FrameLayout、AbsoulteLayout、RelativeLayout和TalbeLayout。
- poj 1166 敌兵布阵 线段树
- C中获取文件长度
- iOS上使用Quartz 2D绘制简单图形
- Qt 中文显示
- HDU-#1879 继续畅通工程(Prim & Kruskal)
- U盘修复技巧大全