[POJ3096]Surprising Strings

试题描述

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.

输入

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.

输出

For each string of letters, output whether or not it is surprising using the exact output format shown below.

输入示例

ZGBG
X
EE
AAB
AABA
AABB
BCBABCC
*

输出示例

ZGBG is surprising.
X is surprising.
EE is surprising.
AAB is surprising.
AABA is surprising.
AABB is NOT surprising.
BCBABCC is NOT surprising.

数据规模及约定

见“输入”

题解

n² 枚举一下长度和字母对，然后把字母对哈希一下，看是否出现重复。打个时间戳可以节省时间。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <cstring>
#include <string>
#include <map>
#include <set>
using namespace std;#define maxn 85
#define maxm 800
char S[maxn];
int has[maxm];int main() {while(scanf("%s", S + 1) == 1) {int n = strlen(S + 1);if(n == 1 && S[1] == '*') break;bool ok = 1;memset(has, 0, sizeof(has));for(int l = 1; l < n; l++) {for(int i = 1; i + l <= n; i++) {int x = (S[i] - 'A') * 26 + S[i+l] - 'A';if(has[x] == l){ ok = 0; break; }has[x] = l;}if(!ok) break;}printf("%s%s\n", S + 1, ok ? " is surprising." : " is NOT surprising.");}return 0;
}

转载于:https://www.cnblogs.com/xiao-ju-ruo-xjr/p/6105568.html

[POJ3096]Surprising Strings相关推荐

POJ3096.Surprising Strings题解--zhengjun
思路一看这个字符串长度很小,就直接暴力就好了. 然后我们需要一种快速的查看是否有一对大写字符相同的容器. 于是就可以想到用 26 26 26 进制+桶,这样就是一一对应了. 代码 #include& ...
POJ-3096（Surprising Strings）
题目:Surprising Strings Description The D-pairs of a string of letters are the ordered pairs of letter ...
sicily 1390 Surprising Strings
这道题其实也不是很难,只是有些小细节需要注意而已,刚开始想着用C++的string类型,后来想到都是取出字符中的两个字符而已,就想到了用数组了,嘿嘿... // source code of subm ...
POJ 3096 Surprising Strings
这个题是对STL中Map的使用考察. 记录一下代码: #include <stdio.h> #include <map> #include <string.h> # ...
idea直连linux部署项目,idea项目打包和在linux的部署
浅谈:深入理解struts2的流程已经spring和struts2的整合第一步:在tomcat启动的时候 1.在tomcat启动的时候,首先会加载struts2的核心过滤器StrutsPrepare ...
POJ3096Surprising Strings（map）
题意:输入很多字符串,以星号结束.判断每个字符串是不是"Surprising Strings",判断方法是:以"ZGBG"为例,"0-pairs&qu ...
HOJ题目分类//放这儿没事刷刷学算法！嘻嘻！
各种杂题,水题,模拟,包括简单数论. 1001 A+B 1002 A+B+C 1009 Fat Cat 1010 The Angle 1011 Unix ls 1012 Decoding Task 1 ...
算法刷题记录(Day 12)
Surprising Strings(poj 3096) 原题链接解题思路:对于每一个D-pair的D值,生成相应的组,并存放在set中,若发现重复,则直接退出,否则代表成功. #include&l ...
Chapter 3. Strings, Vectors and Arrays -C++ Primer 5 notes
Chapter 3. Strings, Vectors and Arrays What does built-in types include? chapter 2 array maybe more? ...

[POJ3096]Surprising Strings

[POJ3096]Surprising Strings相关推荐

最新文章

热门文章