题解 | #子串计算#

#include <iostream>
#include "map"
using namespace std;

int main() {
    string s;
    while (cin >> s) { // 注意 while 处理多个 case
        // cout << a + b << endl;
        map<string, int> myMap;
        for (int i = 0; i <= s.size()-1; i++) {
            for (int j = 1;  i+j <= s.size(); j++) {
                string temp = s.substr(i, j);
                myMap[temp]++;
            }
        }
        
        for (auto i = myMap.begin(); i != myMap.end(); i++) {
            if (i->second > 1) cout << i->first << ' ' << i->second << endl;
        }
    }
}
// 64 位输出请用 printf("%lld")