POJ
来源:互联网 发布:玻璃心 知乎 编辑:程序博客网 时间:2024/06/01 14:34
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 <iostream>#include <string>#include <map>using namespace std;string s;char now_str[3];int main(){ while (cin >> s&&s != "*") { bool is_surpri = true, is_unique = true; int len = s.size(); if (len>2) { for (int d = 0; d <= len - 2; d++) { map <string, bool> map_cnt; for (int i = 0; i<len - d - 1; i++) {//生成关键字 now_str[0] = s[i]; now_str[1] = s[i + d + 1]; now_str[2] = '\0'; if (map_cnt[now_str]) {//如果这个关键出现过,则不符合unique,跳出;若没出现过,则自动构建 is_unique = false; break; } else { map_cnt[now_str] = true; } } if (!is_unique) { is_surpri = false; break; } } } if (!is_surpri) cout << s << " is NOT surprising." << endl; else cout << s << " is surprising." << endl; } return 0;}
阅读全文
0 0
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- POJ
- poj
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- Scrapy 安装问题详解
- LeetCode随笔之BFS广度优先搜索
- SHA
- netsh advfirewall firewall show rule 隐藏参数,查看入站、已启用的策略
- Vue相关开源项目库汇总(史上最全)
- POJ
- redis内存淘汰机制
- 洛谷p1164
- C++设计模式(5):抽象工厂模式
- 如何运用Photoshop将多张图片修改成PDF格式
- Myeclipse下使用Maven搭建spring boot项目(第一篇)
- 网站页面布局
- C#-学生信息管理系统
- 使用Interllij Idea2017.2创建SpringBoot 启动不了Tomcat问题