POJ3096-Surprising Strings【STL--map】
来源:互联网 发布:telnet 端口开放命令 编辑:程序博客网 时间:2024/06/01 07:18
Memory Limit: 65536KTotal Submissions: 6088
Accepted: 3976
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.
简单的map
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <map>using namespace std;map<string ,int > m;char str[10010];int main (){ while(cin>>str){ if(str[0]=='*') break; int i,j,len,mark; len=strlen(str); for(i=0;i<len;++i){ m.clear(); mark=1; for(j=0;j<len-i-1;++j){ char s[3]={str[j],str[j+i+1],'\0'}; m[s]++; if(m[s]>1) mark=0; } if(mark==0) break; } if(mark) printf("%s is surprising.\n",str); else printf("%s is NOT surprising.\n",str); } return 0;}</span>
- POJ3096-Surprising Strings【STL--map】
- poj3096 Surprising Strings (STL中map)
- (POJ3096)Surprising Strings <STL-map 水题>
- Surprising Strings poj3096(map应用)
- poj3096——Surprising Strings(STL)
- poj3096 Surprising Strings
- POJ3096 Surprising Strings 水题
- Surprising Strings -- POJ3096
- poj3096 Surprising Strings
- poj3096 Surprising Strings
- POJ 3096 Surprising Strings(STL map)
- Surprising Strings(STL)
- HDOJ 2736 Surprising Strings——c++STL(map)
- poj 3096 Surprising Strings(stl map的使用)
- POJ 3096 Surprising Strings 【STL】
- Surprising Strings——MAP
- [POJ 3096]Surprising Strings[map]
- Surprising Strings poj 3096 map
- windows平台下载android源码
- Java中的EBCDIC转换
- treap 模板
- 我们都是被上帝咬过的苹果
- Linux下安装maven
- POJ3096-Surprising Strings【STL--map】
- VS2015 C#6.0 中的那些新特性
- MFC基本对话框的属性——— 增添最小化 最大化按钮
- C中字符串知识学习小记
- uva 311 Packets(贪心)
- 第四讲项目2—英尺到米的转换
- 表单中Readonly和Disabled的区别
- uva 10020 Minimal coverage
- 【Eclipse】【FAQ】Eclipse工程原来使用好好的,突然内存溢出异常关闭了,基本的jdk类就识别不了——删除jre重新加到编译路径中解决