POJ 3096 Surprising Strings(我的水题之路——重点,D-pairs)
来源:互联网 发布:周思成网络课程 编辑:程序博客网 时间:2024/05/29 02:44
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
#include <cstdio>#include <cstdlib>#include <cstring>char str[100];int main(void){ int i, j, k; int count; int len; while (scanf("%s", str), strcmp(str, "*")){ len = strlen(str); if (len <= 2){ printf("%s is surprising.\n", str); continue; } for (i = 0, count = 0; i < len && count != 2; i++){ count = 0; for (j = i + 1, k = 0; j < len ; j++, k++){ if (str[j] == str[k]){ count++; } if (count == 2){ break; } } } if (count == 2){ printf("%s is NOT surprising.\n", str); } else{ printf("%s is surprising.\n", str); } } return 0;}
- POJ 3096 Surprising Strings(我的水题之路——重点,D-pairs)
- 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
- POJ 3096:Surprising Strings
- Surprising Strings(POJ -3096
- poj 3096 Surprising Strings
- poj-3096-Surprising Strings
- poj 3096 Surprising Strings
- ARCSDE的直接连接(SQLSERVER)
- [U]3.1.4 Shaping Regions 递归,计算几何
- 实用的webservice 地址(学习wb)
- Java连接各种数据库
- 手把手教你如何配置和编译ogre 1.7.0 + cegui 0.7.1
- POJ 3096 Surprising Strings(我的水题之路——重点,D-pairs)
- Firefox 页面大小调整
- solr基本特性
- 好长时间没更新博客了
- php 移除数组中重复出现的值
- 浪潮之巅 读书感想
- 关键词所带来的差异
- PHP获取文件夹的图片以及分页
- 前后台相关应用