poj3096

最新推荐文章于 2019-11-07 16:46:32 发布

weixin_33713503

最新推荐文章于 2019-11-07 16:46:32 发布

阅读量142

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/eric-blog/archive/2011/05/26/2059159.html

本文介绍了一个有趣的字符串问题——SurprisingStrings。该问题是判断一个字符串是否对于所有可能的距离D都是D-独特的。文章通过示例解释了D-独特性和Surprising的概念，并提供了一段C++代码实现解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Surprising Strings

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3457		Accepted: 2323

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

Mid-Central USA 2006

简单枚举

#include <iostream>
#include <string>

using namespace std;

int main()
{
    bool isSup;
    string str;
    int len;

    while(cin>>str && str!="*")
    {
        isSup=true;
        len=str.length();
        for(int dis=0; dis<=len-2; dis++)
        {
            for(int start=0; start+dis+1<=len-1; start++)
            {
                for(int comp=start+1; comp+dis+1<=len-1;comp++)
                {
                    if(str[start]==str[comp] && str[start+dis+1]==str[comp+dis+1])
                    {
                        isSup=false;
                        break;
                    }
                }
            }
        }
        if(isSup)
            cout<<str<<" is surprising."<<endl;
        else
            cout<<str<<" is NOT surprising."<<endl;
    }
    return 0;
}

转载于:https://www.cnblogs.com/eric-blog/archive/2011/05/26/2059159.html