hpuzsk的博客

拦不住的考研!

杭电2736 Surprising Strings

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);
	}
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/z8110/article/details/49952113
文章标签: 杭电 字符串
个人分类: 简单题
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

杭电2736 Surprising Strings

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭