# Surprising Strings

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 422    Accepted Submission(s): 290

Problem 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
ZGBG X EE AAB AABA AABB BCBABCC *

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<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s[110000][3],sh[110];
int i,j,k,l,m,n,ans,num,flag,sum,len;
int ac()
{
int i,j;
for(i=0;i<l;i++)
for(j=i+1;j<l;j++)
if(strcmp(s[i],s[j])==0)
return 0;
return 1;
}
int main()
{
while(scanf("%s",sh),strcmp(sh,"*\0"))
{
flag=0;
len=strlen(sh);
if(len<3)
flag=1;
for(i=0;i<len-2;i++)
{
l=0;
for(j=0;j+i<len-1;j++)
{
s[l][0]=sh[j];
s[l++][1]=sh[j+i+1];
}
if(ac()==0)
break;
}
if(i==len-2)
flag=1;
if(flag)
printf("%s is surprising.\n",sh);
else
printf("%s is NOT surprising.\n",sh);
}
}

#### POJ3096--Surprising Strings（简单的字符串处理和相同字符串统计）

2013-12-24 01:12:36

#### HDOJ 2736 Surprising Strings

2013-09-05 17:35:22

#### HDU 2736 Surprising Strings

2014-08-06 21:19:40

#### HDU 2736 Surprising Strings

2014-08-05 15:52:37

#### TOJ 2522 水~ Surprising Strings

2014-02-13 15:11:36

#### ZOJ-2814

2014-01-14 21:26:19

#### POJ 3096-Surprising Strings（set）

2014-09-01 12:15:15

#### POJ3096-Surprising Strings

2011-07-31 17:17:22

#### HDOJ 2736 Surprising Strings——c++STL（map）

2014-08-05 19:51:30

#### POJ 3096 && HDU 2736 Surprising Strings（水~）

2015-08-30 08:35:02