zoukankan      html  css  js  c++  java
  • C

                                   C - Surprising Strings

    题意:输入一段字符串,假设在同一距离下有两个字符串同样输出Not surprising
    ,否则输出surprising。


    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.



    #include <iostream>
    #include <stdio.h>
    #include <string.h>
    #include <algorithm>
    #include <queue>
    #include <map>
    using namespace std;
    char s[500];
    char t[500];
    int main()
    {
        int i,j;
        int n;
        while(scanf("%s",s)!=EOF)
        {
            if(s[0]=='*')
                break;
             n = strlen(s);
             bool flag = true;
             for(i=0;i<n;i++)
             {
                 if(!flag)
                    break;
                 map<string,int>mapp;
                 for(j=0;j+i+1<n;j++)
                 {
                     if(!flag)
                        break;
                    t[0] = s[j];
                    t[1] = s[j+i+1];
                    t[2] = '';
                    if(mapp[t]>0)
                    {
                        printf("%s is NOT surprising.
    ",s);
                        flag = false;
                    }
                    else
                        mapp[t]++;
                 }
             }
                if(flag)
    			cout<<s<<" is surprising."<<endl;
        }
        return 0;
    }


  • 相关阅读:
    浅谈MVVM
    组装数据和页面渲染
    Vuejs实现轮播图
    Vuejs选项卡案例
    选项卡案例
    js中用来操作数组的相关的方法
    js中用来操作字符串的相关的方法
    用逗号拼接字符串,并且去掉最后一个逗号
    微信分享链接或网站文章到微信朋友圈,缩略图片不显示,该如何解决?
    Spring 的介绍和目标
  • 原文地址:https://www.cnblogs.com/zfyouxi/p/3913194.html
Copyright © 2011-2022 走看看