POJ 3096 Surprising Strings(水题)
来源:互联网 发布:5c5c5c最新域名升级 编辑:程序博客网 时间:2024/06/11 18:11
Surprising Strings
Description
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 issurprising 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.
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
题意:什么是惊奇的串,拿ZGBG来说吧,成对连续的字符ZG和BG,然后相隔的字符ZB和GG,再之后是相隔两个的对ZG,这五个都不一样就是惊奇的。AABB来说,存在的字符对是AA, BB, AB, AB, AB,有重复的就不是惊奇的。
题解:简单的哈希,但map更加的简单。
#include <stdio.h>#include <string.h>#include <iostream>#include <map>using namespace std;int main(){ int i, j, n; char str[80]; while(~scanf("%s", str) && strcmp(str, "*") != 0) { n = strlen(str); int flag = 0; for(i = 0; i < n ; i++) { map<string, int> ma; char a[2]; for(j = 0; j < n - i; j++) { a[0] = str[j]; a[1] = str[j+i+1]; if(ma[a] == 1) { flag = 1; break; } ma[a] = 1; } } if(flag == 0) printf("%s is surprising.\n", str); else printf("%s is NOT surprising.\n", str); } return 0;}
- 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
- POJ 3096:Surprising Strings
- Surprising Strings(POJ -3096
- poj 3096 Surprising Strings
- poj-3096-Surprising Strings
- poj 3096 Surprising Strings
- poj 3096 Surprising Strings
- POJ 3096 Surprising Strings
- 分组背包
- HPUOJ--2017寒假作业-专题0/P-贪心
- usaco shuttle puzzle(dfs剪枝)
- java 23种设计模式
- java TLAB分析
- POJ 3096 Surprising Strings(水题)
- Wireshark网络抓包(二)——过滤器
- Android性能优化系列之内存优化
- 假期训练——Hangman Judge UVA - 489 模拟
- 熟练使用java的Enum、EnumSet、EnumMap
- 虚拟机运行时常量池与String的intern方法
- Android Studio 执行 lint task失败的问题
- Java基础学习总结(97)——合格的Java的架构师需要具备的技术知识
- Hyperledger fablic 1.0 在centos7环境下的安装与部署和动态增加节点