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.

#include <stdio.h>#include <string.h>#include <string>#include <map>#include <algorithm>using namespace std;char s[100];int main(){	int len;	int i, j;	map<string, int>ma;	map<string, int>::iterator it;    char sc[3];	int flag;    while( gets(s)!=NULL )	{		if(strcmp("*", s)==0)			break;		else		{			len = strlen(s);			if(len==1)			{				printf("%s is surprising.\n", s );				continue ;			}			flag=1; //初始化标记变量            j=1;			for(j=1; j<len; j++)			{				ma.clear();			    for(i=0; i+j<len; i++)				{				    sc[0]=s[i];				    sc[1]=s[i+j];				    sc[2]=‘\0‘;				    ma[sc]++;				}				for(it=ma.begin(); it!=ma.end(); it++)				{				    if(it->second>1)					{					    flag=0; //找到重复的了					    break;					}				}				if(flag==0)				{					printf("%s is NOT surprising.\n", s); //不是的话,直接跳出					break;				}			}			if(flag==1)			{				printf("%s is surprising.\n", s );			}		/*	else if(flag==0)			{				printf("%s is NOT surprising.\n", S );			}  */		}	}	return 0 ;}