zoukankan      html  css  js  c++  java
  • Surprising Strings

    Surprising Strings
    Time Limit: 1000MS        Memory Limit: 65536K
    Total Submissions: 7403        Accepted: 4735
    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 <cstdio>
    #include<set>
    #include <vector>
    #include <cstring>
    #include <list>
    #include <queue>
    #include <algorithm>
    #include<functional>
    #include <stack>
    #define MAXN 200 + 3
    #define INF 0x3f3f3f3f
    using namespace std;
    //直接枚举+hash+set 随便过
    char s[MAXN];
    inline int Hash(char a, char b)
    {
        return (a - 'a') * 26 + b - 'a';
    }
    int main()
    {
        ios::sync_with_stdio(0);
        while (cin >> s, s[0] != '*')
        {
            set<int> S;
            int L = strlen(s);
            int l;
            for (l = 1; l < L; l++)
            {
                S.clear();
                for (int i = 0; i + l < L; i++)
                    S.insert(Hash(s[i], s[i + l]));
                if (S.size() != L - l)
                    break;
            }
            if (l == L)
                cout << s << " is surprising." << endl;
            else
                cout << s << " is NOT surprising." << endl;
        }
        return 0;
    }
  • 相关阅读:
    DB2开发系列之三——SQL函数
    DB2开发系列之二——SQL过程
    DB2开发系列之一——基本语法
    优化的“真谛”
    DB2性能调优
    AIX分页(交换)空间的监控
    AIX5L内存监控和调整
    直接删除undo及temp表空间文件后的数据库恢复一例
    【LeetCode】 -- 68.Text Justification
    关于linux下的.a文件与 .so 文件
  • 原文地址:https://www.cnblogs.com/joeylee97/p/7544871.html
Copyright © 2011-2022 走看看