题目描述

blablabla

样例

blablabla

算法1

(暴力枚举) $O(n^2)$

blablabla

时间复杂度

参考文献

C++ 代码

#include <bits/stdc++.h>
using namespace std;

const int N = 110;

string str;

int main()
{
    while (cin >> str)
    {



    unordered_map<string,int> M;

    vector<string> V;


    for (int len = 1; len <= str.size(); len ++ )
    {
        for (int i = 0; i < str.size(); i ++ )
        {
            int ans = 0;
            string tmp = str.substr(i,len);

            if (M.count(tmp)) continue;

            //cout <<tmp << endl;
            for (int j = 0; j + len <= str.size(); j ++ )
            {
                if ( str.substr(j,len) == tmp) ans ++;

            }
            M[tmp] = ans;
            V.push_back(tmp);
        }
    }

    sort(V.begin(), V.end());

    for (string& a: V)
    {
        if (M[a] > 1) cout << a << " " << M[a] << endl;

    }

    }



}

算法2

(暴力枚举) $O(n^2)$

blablabla

时间复杂度

参考文献

C++ 代码

blablabla