Surprising Strings poj 3096 map的运用
来源:互联网 发布:用友nc java插件下载 编辑:程序博客网 时间:2024/06/05 13:26
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.
#include<cstring>#include<iostream>#include<cstdio>#include<algorithm>using namespace std;#include<map>char s[80];int main(){ while(scanf("%s",s)!=EOF) { if(s[0]=='*') break; int l=strlen(s); if(l<=2) { printf("%s is surprising.\n",s); continue; } int i,j; bool mark; for(i=0;i<l-1;i++) { mark=true; map<string,bool>sign; for(j=0;j<l-1-i;j++) { char p[2]={s[j],s[j+i+1]}; if(sign[p]==false) {sign[p]=true; continue; } else {mark=false;break; } } if(mark==false) break; } if(mark) {printf("%s is surprising.\n",s); } else printf("%s is NOT surprising.\n",s); }}
- Surprising Strings poj 3096 map的运用
- [POJ 3096]Surprising Strings[map]
- Surprising Strings poj 3096 map
- [ACM] POJ 3096 Surprising Strings (map的使用)
- poj 3096 Surprising Strings(stl map的使用)
- POJ 3096 Surprising Strings(map 水)
- Surprising Strings POJ 3096 (暴力+map)
- 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
- define
- C语言复杂表达式,指针高级运用
- C++代码学习
- docker自学笔记(0)——基本概念
- Java并发编程(Java Concurrency)(13)- Java volatile 关键字(Java Volatile Keyword)
- Surprising Strings poj 3096 map的运用
- 关于File.separator 文件路
- vim 编辑器常用指令
- 算法竞赛入门经典第二版 4 - 2
- Resilient Distributed Datasets: A Fault-Tolerant Abstraction forIn-Memory Cluster Computing
- 支付:在线支付功能的概述
- Java-List.add
- Eqs poj 1840 哈希
- OpenVPN搭建和配置